Pages that link to "Item:Q1601017"
From MaRDI portal
The following pages link to Computing approximate shortest paths on convex polytopes (Q1601017):
Displaying 20 items.
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Approximate shortest path on a polyhedral surface and its applications (Q628041) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions (Q1283768) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Computing approximately shortest descending paths on convex terrains via multiple shooting (Q1715706) (← links)
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
- Approximating shortest paths on a nonconvex polyhedron (Q2706111) (← links)
- Constructing a minimum path on a polyhedral surface in \(\mathbb R^3\) (Q2850299) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- On the shortest paths between two convex polyhedra (Q3798231) (← links)
- Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- (Q5208219) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
