An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

MaRDI QIDQ3619956zbMATH OpenFDO

Authors Yevgeny Schreiber, Micha Sharir

Publication date 14 April 2009

zbMATH Keywords

continuous Dijkstrageodesicspolytope surface

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Approximating shortest paths on a convex polytope in three dimensions
• An optimal-time algorithm for shortest paths on realistic polyhedra
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Publication:4886077

Cited in

(5)

• Time and space efficient algorithms for shortest paths between convex polygons
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Shortest paths on realistic polyhedra
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces
• An optimal-time algorithm for shortest paths on realistic polyhedra

This page was built for publication: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

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