Pages that link to "Item:Q628181"
From MaRDI portal
The following pages link to Efficiently determining a locally exact shortest path on polyhedral surfaces (Q628181):
Displaying 13 items.
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← 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)
- Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← 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)
- Shortest paths on polyhedral surfaces and terrains (Q5259571) (← links)
- Computing the Riemannian center of mass on meshes (Q6098162) (← links)
- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron (Q6552515) (← links)
- Splines on manifolds: a survey (Q6592887) (← links)
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces (Q6655495) (← links)
