Pages that link to "Item:Q5900801"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900801):
Displaying 5 items.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)