Sciweavers

Share
WADS
2009
Springer

Shortest Path Problems on a Polyhedral Surface

10 years 11 months ago
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
Atlas F. Cook, Carola Wenk
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WADS
Authors Atlas F. Cook, Carola Wenk
Comments (0)
books