450 search results - page 31 / 90 » Quadrangulations of Planar Sets |
ALGORITHMICA
2006
13 years 9 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We present a novel stereo algorithm which performs surface reconstruction from planar camera arrays. It incorporates the merits of both generic camera arrays and rectified binocul...
RSS
2007
13 years 10 months ago
2007
— In this paper, we design planar nR serial chains that provide one degree-of-freedom movement for an end-effector through five arbitrarily specified task positions. These chai...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
GD
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...