Shortest paths on realistic polyhedra

DOI10.1145/1247069.1247081zbMATH Open1221.68279OpenAlexW1974931598MaRDI QIDQ3602856FDOQ3602856

Authors: Yevgeny Schreiber 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1247069.1247081

Recommendations

• An optimal-time algorithm for shortest paths on realistic polyhedra
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• On Shortest Paths in Polyhedral Spaces

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) (n)-dimensional polytopes (52B11)

Cited In (7)

• A survey of geodesic paths on 3D surfaces
• An optimal-time algorithm for shortest paths on realistic polyhedra
• The shortest path AMID 3-D polyhedral obstacles
• Approximation algorithms for shortest descending paths in terrains
• The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
• Shortest paths on polyhedral surfaces and terrains
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

This page was built for publication: Shortest paths on realistic polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602856)