Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions

DOI10.1007/PL00009417zbMath0922.68119OpenAlexW2063071084MaRDI QIDQ1283768

Sariel Har-Peled

Publication date: 30 September 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009417

zbMATH Keywords

approximate shortest-path queries on a convex polytopeapproximate three-dimensional Euclidean shortest-path problemapproximating the geodesic diameter of a convex polytopethree-dimensional Euclidean shortest-path problem

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (4)

Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ A survey of geodesic paths on 3D surfaces ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

This page was built for publication: Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions