Approximating shortest paths on a nonconvex polyhedron

DOI10.1137/S0097539799352759MaRDI QIDQ2706111zbMATH OpenFDO

Authors Kasturi Varadarajan, Pankaj K. Agarwal

Publication date 19 March 2001

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539799352759

zbMATH Keywords

approximation algorithmscomputational geometryEuclidean shortest paths

Mathematics Subject Classification ID

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

Recommendations

• Computing approximate shortest paths on convex polytopes
• On Shortest Paths Amidst Convex Polyhedra
• Approximate shortest paths in simple polyhedra
• Approximate shortest path on a polyhedral surface and its applications
• Approximating shortest paths on a convex polytope in three dimensions
• Publication:4886077
• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
• Approximating shortest paths on weighted polyhedral surfaces
• Shortest path on a non-convex polyhedron
• On the shortest paths between two convex polyhedra

Cited in

(18)

• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
• Shortest path on a non-convex polyhedron
• Computing approximate shortest paths on convex polytopes
• Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
• scientific article; zbMATH DE number 1670669 (Why is no real title available?)
• scientific article; zbMATH DE number 3907791 (Why is no real title available?)
• On the shortest paths between two convex polyhedra
• scientific article; zbMATH DE number 910902 (Why is no real title available?)
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Approximate Shortest Paths in Polygons with Violations
• scientific article; zbMATH DE number 7151640 (Why is no real title available?)
• Finding closed quasigeodesics on convex polyhedra
• Approximate shortest path on a polyhedral surface and its applications
• A survey of geodesic paths on 3D surfaces
• Efficient exact enumeration of single-source geodesics on a non-convex polyhedron
• An optimal-time algorithm for shortest paths on realistic polyhedra
• Shortest monotone descent path problem in polyhedral terrain

This page was built for publication: Approximating shortest paths on a nonconvex polyhedron

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