Pages that link to "Item:Q2391841"
From MaRDI portal
The following pages link to An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841):
Displaying 3 items.
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
