Pages that link to "Item:Q5900801"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900801):
Displaying 11 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)
- Efficient computation of geodesic shortest paths (Q2819608) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901265) (← links)
- Approximating shortest paths on weighted polyhedral surfaces (Q5940611) (← links)