Shortest Path Problems on a Polyhedral Surface

Wenk, Carola; Cook, Atlas F.

doi:10.4230/DagSemProc.09111.5

Document

Shortest Path Problems on a Polyhedral Surface

Authors Carola Wenk, Atlas F. Cook

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 9111
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2009-06-23

PDF

File

PDF

DagSemProc.09111.5.pdf

Filesize: 369 kB
30 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09111.5
URN: urn:nbn:de:0030-drops-20332

Subject Classification

Keywords

Shortest paths
edge sequences

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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. Our main result is a linear-factor speedup for computing all shortest path edge sequences on a convex polyhedral surface.

Cite As Get BibTex

Carola Wenk and Atlas F. Cook. Shortest Path Problems on a Polyhedral Surface. In Computational Geometry. Dagstuhl Seminar Proceedings, Volume 9111, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.09111.5

Author Details

Carola Wenk

Atlas F. Cook

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail