scientific article; zbMATH DE number 1305410
From MaRDI portal
Publication:4252291
Recommendations
Cited in
(27)- Computing the geodesic centers of a polygonal domain
- Routing among convex polygonal obstacles in the plane
- Shortest Path Problems on a Polyhedral Surface
- Shortest Path Queries in Polygonal Domains
- Link Distance and Shortest Path Problems in the Plane
- Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
- The geodesic diameter of polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Approximate Euclidean shortest paths amid convex obstacles
- ON GEOMETRIC PATH QUERY PROBLEMS
- Shortest path problems on a polyhedral surface
- scientific article; zbMATH DE number 910885 (Why is no real title available?)
- A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
- On geometric path query problems
- Shortest rectilinear path queries to rectangles in a rectangular domain
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Maximal distortion of geodesic diameters in polygonal domains
- Link distance and shortest path problems in the plane
- Routing among convex polygonal obstacles in the plane
- Towards space efficient two-point shortest path queries in a polygonal domain
- A new algorithm for Euclidean shortest paths in the plane
- Link diameter, radius and 2-point link distance queries in polygonal domains
- 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
- Shortest path planning for a tethered robot
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 Q4252291)
