Computing approximate shortest paths on convex polytopes
From MaRDI portal
Publication:1601017
DOI10.1007/s00453-001-0111-xzbMath0994.68176MaRDI QIDQ1601017
M. Karia, Sariel Har-Peled, Pankaj K. Agarwal
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0111-x
68W05: Nonnumerical algorithms
Related Items
Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding, Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves, Unnamed Item, Multiple shooting approach for computing approximately shortest paths on convex polytopes, Algorithms for approximate shortest path queries on weighted polyhedral surfaces, A survey of geodesic paths on 3D surfaces, Shortest monotone descent path problem in polyhedral terrain, Computing approximately shortest descending paths on convex terrains via multiple shooting