The Number of Shortest Paths on the Surface of a Polyhedron

DOI10.1137/0219040zbMath0697.68100OpenAlexW2090813214MaRDI QIDQ3474914

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

convex polyhedronshortest pathscomputational geometrypseudolines

Mathematics Subject Classification ID

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

Related Items (8)

Computing minimum length paths of a given homotopy class ⋮ Shortest Path Problems on a Polyhedral Surface ⋮ Near optimal algorithm for the shortest descending path on the surface of a convex terrain ⋮ Shortest path problems on a polyhedral surface ⋮ On the number of shortest descending paths on the surface of a convex terrain ⋮ Time-minimal paths amidst moving obstacles in three dimensions ⋮ Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface ⋮ Minimum Cell Connection in Line Segment Arrangements

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