1633 search results - page 78 / 327 » Planar Map Graphs |
167
click to vote
ICCV
2007
IEEE
16 years 15 days ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
148
click to vote
ICNP
2005
IEEE
15 years 11 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
185
click to vote
ALGOSENSORS
2004
Springer
15 years 11 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
161
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
272
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
An index is devised to support position-independent search for images containing quartets of icons. Point quartets exist that do not unambiguously map to quadrilaterals, however, ...