Shortest Path Problems on a Polyhedral Surface
From MaRDI portal
Publication:3183449
DOI10.1007/978-3-642-03367-4_14zbMath1253.68330OpenAlexW2151530724MaRDI QIDQ3183449
Carola Wenk, Atlas F. IV. Cook
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2033/
Related Items
Shortest Path Problems on a Polyhedral Surface ⋮ The geodesic diameter of polygonal domains ⋮ Fréchet distance with speed limits ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Shortest path problems on a polyhedral surface
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest path problems on a polyhedral surface
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Nonoverlap of the star unfolding
- Queries on Voronoi diagrams on moving points
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- The Discrete Geodesic Problem
- Shortest Path Problems on a Polyhedral Surface
- The Number of Shortest Paths on the Surface of a Polyhedron
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Star Unfolding of a Polytope with Applications
- Voronoi Diagrams of Moving Points
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
