Shortest Path Problems on a Polyhedral Surface
From MaRDI portal
Publication:3183449
DOI10.1007/978-3-642-03367-4_14zbMATH Open1253.68330OpenAlexW2151530724MaRDI QIDQ3183449FDOQ3183449
Authors: 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/
Recommendations
Cites Work
- Geometric folding algorithms. Linkages, origami, polyhedra
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- The Discrete Geodesic Problem
- Shortest Path Problems on a Polyhedral Surface
- Title not available (Why is that?)
- Star Unfolding of a Polytope with Applications
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Title not available (Why is that?)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- The Number of Shortest Paths on the Surface of a Polyhedron
- Nonoverlap of the star unfolding
- Queries on Voronoi diagrams on moving points
- Title not available (Why is that?)
- Voronoi Diagrams of Moving Points
- Shortest path problems on a polyhedral surface
- Geodesic Fréchet distance inside a simple polygon
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Cited In (17)
- The Discrete Geodesic Problem
- Holiest minimum-cost paths and flows in surface graphs
- The shortest path AMID 3-D polyhedral obstacles
- On the shortest paths between two convex polyhedra
- Link Distance and Shortest Path Problems in the Plane
- Shortest Path Problems on a Polyhedral Surface
- Facility location on a polyhedral surface
- Star unfolding of a polytope with applications
- Shortest paths in portalgons
- Shortest descending paths through given faces
- Shortest path problems on a polyhedral surface
- Star Unfolding of a Polytope with Applications
- Fréchet distance with speed limits
- Shortest paths on polyhedral surfaces and terrains
- The geodesic diameter of polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain
- Efficiently determining a locally exact shortest path on polyhedral surfaces
This page was built for publication: Shortest Path Problems on a Polyhedral Surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183449)
