An optimal-time algorithm for shortest paths on realistic polyhedra
DOI10.1007/S00454-009-9136-8zbMATH Open1191.68769OpenAlexW2090626328MaRDI QIDQ848859FDOQ848859
Authors: Yevgeny Schreiber 
Publication date: 23 February 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9136-8
Recommendations
- Shortest paths on realistic polyhedra
- 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
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- On Shortest Paths in Polyhedral Spaces
terrainwavefrontshortest path mapconforming subdivisioncontinuous Dijkstrarealistic polyhedral surface
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Approximating shortest paths on weighted polyhedral surfaces
- Realistic input models for geometric algorithms
- Efficient computation of geodesic shortest paths
- On fat partitioning, fat covering and the union size of polygons
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximating shortest paths on a convex polytope in three dimensions
- Motion planning in environments with low obstacle density
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Fundamentals of Computation Theory
- Title not available (Why is that?)
- Storing the subdivision of a polyhedral surface
- Approximating shortest paths on a nonconvex polyhedron
- Shortest paths on realistic polyhedra
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Computing depth orders for fat objects and related problems
- Range searching in low-density environments
- Title not available (Why is that?)
- On Shortest Paths Amidst Convex Polyhedra
Cited In (8)
- Time and space efficient algorithms for shortest paths between convex polygons
- An improved algorithm for the shortest descending path on a convex terrain
- Tracing compressed curves in triangulated surfaces
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Shortest paths on realistic polyhedra
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\)
This page was built for publication: An optimal-time algorithm for shortest paths on realistic polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848859)
