On shortest paths in polyhedral spaces
SIAM Journal on Computing
On shortest paths amidst convex polyhedra
SIAM Journal on Computing
SIAM Journal on Computing
Nonoverlap of the star unfolding
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Fully persistent lists with catenation
Journal of the ACM (JACM)
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Handbook of discrete and computational geometry
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constructing Approximate Shortest Path Maps in Three Dimensions
SIAM Journal on Computing
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Computational geometry column 35
ACM SIGACT News
Robot Manipulators: Mathematics, Programming, and Control
Robot Manipulators: Mathematics, Programming, and Control
Folding and Unfolding in Computational Geometry
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximating Shortest Paths on a Nonconvex Polyhedron
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Shortest paths on realistic polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Approximation algorithms for shortest descending paths in terrains
Journal of Discrete Algorithms
Querying Approximate Shortest Paths in Anisotropic Regions
SIAM Journal on Computing
Constant-time all-pairs geodesic distance query on triangle meshes
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Parallel chen-han (PCH) algorithm for discrete geodesics
ACM Transactions on Graphics (TOG)
Hi-index | 0.01 |
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm runs in O(nlog n) time and requires O(nlog n) space, where n is the number of edges of P. The algorithm is based on the O(nlog n) algorithm of Hershberger and Suri for shortest paths in the plane [11], and similarly follows the continuous Dijkstra paradigm, which propagates a "wavefront" from s along ∂P. This is effected by generalizing the concept of conforming subdivision of the free space used in [11], and adapting it for the case of a convex polytope in R3, allowing the algorithm to accomplish the propagation in discrete steps, between the "transparent" edges of the subdivision. The algorithm constructs a dynamic version of Mount's data structure [16] that implicitly encodes the shortest paths from s to all other points of the surface. This structure allows us to answer single-source shortest-path queries, where the length of the path, as well as its combinatorial type, can be reported in O(log n) time; the actual path π can be reported in additional O(k) time, where k is the number of polytope edges crossed by π.The algorithm generalizes to the case of m source points to yield an implicit representation of the geodesic Voronoi diagram of m sites on the surface of P, in time O((n+m)log(n+m)), so that the site closest to a query point can be reported in time O(log(n+m)).