Pages that link to "Item:Q5361664"
From MaRDI portal
The following pages link to New results on shortest paths in three dimensions (Q5361664):
Displaying 16 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Shortest descending paths through given faces (Q1025303) (← links)
- Path homotopy invariants and their application to optimal trajectory planning (Q1757449) (← links)
- Computing the trajectories for the development of optimal routes (Q2139150) (← links)
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach (Q2252135) (← links)
- Flying over a polyhedral terrain (Q2380051) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q2664104) (← links)
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes (Q5002757) (← links)
- A Model for Optimal Human Navigation with Stochastic Effects (Q5117979) (← links)
- Some Discrete Properties of the Space of Line Transversals to Disjoint Balls (Q5188768) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
