Constructing Approximate Shortest Path Maps in Three Dimensions
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4), 1182-1197
- https://doi.org/10.1137/s0097539797325223
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Approximate Euclidean Shortest Paths in 3-SpaceInternational Journal of Computational Geometry & Applications, 1997
- Approximating shortest paths on a convex polytope in three dimensionsJournal of the ACM, 1997
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHSInternational Journal of Computational Geometry & Applications, 1996
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- Storing the subdivision of a polyhedral surfaceDiscrete & Computational Geometry, 1987
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985