Approximating Shortest Paths on a Nonconvex Polyhedron
From MaRDI portal
Publication:2706111
DOI10.1137/S0097539799352759zbMath0969.68163MaRDI QIDQ2706111
Pankaj K. Agarwal, Kasturi R. Varadarajan
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces ⋮ Unnamed Item ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ A survey of geodesic paths on 3D surfaces
This page was built for publication: Approximating Shortest Paths on a Nonconvex Polyhedron
