Shortest Path Problems on a Polyhedral Surface
Cook, Atlas F.
MetadataShow full item record
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Frechet 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.