Pages that link to "Item:Q2482203"
From MaRDI portal
The following pages link to An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203):
Displaying 14 items.
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain (Q450580) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Star unfolding convex polyhedra via quasigeodesic loops (Q977183) (← links)
- Voronoi game on polygons (Q2044961) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- An improved algorithm for the shortest descending path on a convex terrain (Q2434932) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Shortest Path Problems on a Polyhedral Surface (Q3183449) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces (Q6655495) (← links)
