scientific article; zbMATH DE number 910885
From MaRDI portal
Publication:4886059
Recommendations
Cited in
(19)- On the Euclidean two paths problem
- Rectilinear short path queries among rectangular obstacles
- All pairs shortest paths for graphs with small integer length edges
- Fast optimal and bounded suboptimal Euclidean pathfinding
- Routing among convex polygonal obstacles in the plane
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
- All pairs lightest shortest paths
- On bounded leg shortest paths problems
- Querying two boundary points for shortest paths in a polygonal domain
- scientific article; zbMATH DE number 1305410 (Why is no real title available?)
- Approximate Euclidean shortest paths amid convex obstacles
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- On bounded leg shortest paths problems
- Routing among convex polygonal obstacles in the plane
- Towards space efficient two-point shortest path queries in a polygonal domain
- A divide-and-conquer based preprocessing for routing in a simple polygon
- Routing among convex polygonal obstacles in the plane using a simplified domain
- Towards space efficient two-point shortest path queries in a polygonal domain
- Approximate distance oracles for graphs with dense clusters
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886059)
