553 search results - page 16 / 111 » On Planar Path Transformation |
AIIA
2005
Springer
14 years 28 days ago
2005
Springer
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
We present a novel approach for tracking locally planar regions in an image sequence and their grouping into larger planar surfaces. The tracker recovers the affine transformation...
ESA
2004
Springer
14 years 23 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
GD
2004
Springer
14 years 23 days ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...