Pages that link to "Item:Q1601017"
From MaRDI portal
The following pages link to Computing approximate shortest paths on convex polytopes (Q1601017):
Displaying 9 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)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← 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)
- 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)
- (Q5208219) (← links)
