The following pages link to (Q4886059):
Displayed 5 items.
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach (Q2252135) (← links)