Shortest Path Problems on a Polyhedral Surface
Date
2009-02
Authors
Cook, Atlas F. IV
Wenk, Carola
Journal Title
Journal ISSN
Volume Title
Publisher
UTSA Department of Computer Science
Abstract
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.
Description
Keywords
polyhedral surface, Voronoi diagram, shortest path map, Fréchet distance, diameter, link distance, Euclidean shortest path
Citation
Department
Computer Science