2026-07-20T05:06:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2033 2024-03-06T11:08:39Z ddc:004 open_access

Shortest Path Problems on a Polyhedral Surface Wenk, Carola Cook, Atlas F. Shortest paths edge sequences 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Carola Wenk and Atlas F. Cook 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9111, Computational Geometry (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09111.5 urn:nbn:de:0030-drops-20332 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09111.5 eng https://creativecommons.org/licenses/by/4.0/legalcode