The Number of Shortest Paths on the Surface of a Polyhedron

DOI10.1137/0219040MaRDI QIDQ3474914zbMATH OpenOpenAlexFDO

Authors David M. Mount

Publication date 1990

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

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

zbMATH Keywords

computational geometryshortest pathsconvex polyhedronpseudolines

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx)

Recommendations

• On Shortest Paths Amidst Convex Polyhedra
• scientific article; zbMATH DE number 3907791
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• On Shortest Paths in Polyhedral Spaces
• scientific article; zbMATH DE number 140474

Cited in

(12)

• Computing minimum length paths of a given homotopy class
• Total curvature and spiralling shortest paths
• Accelerated scattering of convex polyhedra
• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
• Near optimal algorithm for the shortest descending path on the surface of a convex terrain
• On the number of shortest descending paths on the surface of a convex terrain
• Shortest Path Problems on a Polyhedral Surface
• Time-minimal paths amidst moving obstacles in three dimensions
• Shortest path problems on a polyhedral surface
• Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
• Minimum Cell Connection in Line Segment Arrangements
• Shortest paths on cubes

This page was built for publication: The Number of Shortest Paths on the Surface of a Polyhedron

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