The Discrete Geodesic Problem

Abstract

We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and requires O(n2) space, where n is the number of edges of the surface. After we run our algorithm, the distance from the source to any other destination may be determined using standard techniques in time O(log n) by locating the destination in the subdivision created by the algorithm. The actual shortest path from the source to a destination can be reported in time O(k + log n), where k is the number of faces crossed by the path. The algorithm generalizes to the case of multiple source points to build the Voronoi diagram on the surface, where n is now the maximum of the number of vertices and the number of sources. Key words, shortest paths, computational geometry, geodesics, Dijkstra’s algorithm AMS(MOS) subject classification. 68E99

DOI: 10.1137/0216045

Extracted Key Phrases

02040'88'91'94'97'00'03'06'09'12'15
Citations per Year

504 Citations

Semantic Scholar estimates that this publication has 504 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Mitchell1987TheDG, title={The Discrete Geodesic Problem}, author={Joseph S. B. Mitchell and David M. Mount and Christos H. Papadimitriou}, journal={SIAM J. Comput.}, year={1987}, volume={16}, pages={647-668} }