Shortest Path Problems on a Polyhedral Surface

We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance. Key words: Polyhedral Surface, Voronoi Diagram, Shortest Path Map, Fréchet distance, Diameter, Link Distance, Euclidean Shortest Path

• Type: Conference
• Year: 2009
• Where: WADS
• Authors: Atlas F. Cook, Carola Wenk
• Keywords: Algorithms, Euclidean Shortest Path, Shortest Path, Shortest Path Map, WADS 2009