1633 search results - page 94 / 327 » Planar Map Graphs |
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
The manipulation of text on a sign or billboard is relatively easy to do in a way that is perceptually convincing. When text is on a planar surface and imaged under perspective pr...
ICCSA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
- This paper introduces a new approach to identify singularities of planar parallel manipulators (PPMs). This method is based on Maxwell’s reciprocal figure theory which establis...
WG
2007
Springer
14 years 4 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...