177 search results - page 15 / 36 » Link Distance and Shortest Path Problems in the Plane |
CGIM
2003
13 years 10 months ago
2003
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
SIROCCO
2001
13 years 10 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...