Pages that link to "Item:Q4268702"
From MaRDI portal
The following pages link to Constructing Approximate Shortest Path Maps in Three Dimensions (Q4268702):
Displaying 14 items.
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← 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)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Pseudo approximation algorithms with applications to optimal motion planning (Q1424321) (← links)
- Three-dimensional Euclidean distance transformation and its application to shortest path planning (Q1886624) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- Flying over a polyhedral terrain (Q2380051) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Approximating Minimization Diagrams and Generalized Proximity Search (Q5502175) (← links)
