Computing approximate shortest paths on convex polytopes
From MaRDI portal
Publication:1601017
DOI10.1007/S00453-001-0111-XzbMATH Open0994.68176OpenAlexW2017117017MaRDI QIDQ1601017FDOQ1601017
Authors: M. Karia, Pankaj K. Agarwal, Sariel Har-Peled 
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
Recommendations
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Publication:4886077
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Approximating shortest paths on a convex polytope in three dimensions
- Approximating shortest paths on a nonconvex polyhedron
Cited In (20)
- Approximate Shortest Path Queries Using Voronoi Duals
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- Time and space efficient algorithms for shortest paths between convex polygons
- Approximate Shortest Paths in Polygons with Violations
- Title not available (Why is that?)
- Approximating shortest paths on a nonconvex polyhedron
- On the shortest paths between two convex polyhedra
- Shortest monotone descent path problem in polyhedral terrain
- Approximate shortest path on a polyhedral surface and its applications
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Constructing a minimum path on a polyhedral surface in \(\mathbb R^3\)
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Approximation algorithms for geometric shortest path problems
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Title not available (Why is that?)
- Fundamentals of Computation Theory
- Computing approximately shortest descending paths on convex terrains via multiple shooting
This page was built for publication: Computing approximate shortest paths on convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601017)
