1633 search results - page 88 / 327 » Planar Map Graphs |
147
click to vote
COMBINATORICA
2010
14 years 9 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
174
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
Many applications in computer vision require comparisons
between two images of the same scene. Comparison
applications usually assume that corresponding regions in
the two image...
129
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper presents a feature based 3D mapping approach with regard to obtaining compact models of semistructured environments such as partially destroyed buildings where mobil...
118
click to vote
WADS
1995
Springer
15 years 5 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
116
click to vote
DISOPT
2008
15 years 2 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...