Shortest Path Problems on a Polyhedral Surface

DOI10.1007/978-3-642-03367-4_14MaRDI QIDQ3183449zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

diameterFréchet distancepolyhedral surfaceshortest path mapVoronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shortest path problems on a polyhedral surface
• The Discrete Geodesic Problem
• scientific article; zbMATH DE number 3907791
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• On Shortest Paths in Polyhedral Spaces

Cites work

• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Geodesic Fréchet distance inside a simple polygon
• Geometric folding algorithms. Linkages, origami, polyhedra
• scientific article; zbMATH DE number 140474 (Why is no real title available?)
• scientific article; zbMATH DE number 1305410 (Why is no real title available?)
• scientific article; zbMATH DE number 1424289 (Why is no real title available?)
• 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
• Shortest path problems on a polyhedral surface
• Shortest Path Problems on a Polyhedral Surface
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Star Unfolding of a Polytope with Applications
• The Discrete Geodesic Problem
• The Number of Shortest Paths on the Surface of a Polyhedron
• Voronoi Diagrams of Moving Points

Cited in

(17)

• Shortest descending paths through given faces
• Facility location on a polyhedral surface
• The shortest path AMID 3-D polyhedral obstacles
• The Discrete Geodesic Problem
• Shortest Path Problems on a Polyhedral Surface
• Link Distance and Shortest Path Problems in the Plane
• The geodesic diameter of polygonal domains
• On the shortest paths between two convex polyhedra
• Querying two boundary points for shortest paths in a polygonal domain
• Star Unfolding of a Polytope with Applications
• Shortest path problems on a polyhedral surface
• Star unfolding of a polytope with applications
• Holiest minimum-cost paths and flows in surface graphs
• Shortest paths on polyhedral surfaces and terrains
• Fréchet distance with speed limits
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• Shortest paths in portalgons

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)