Two-point L₁ shortest path queries in the plane
From MaRDI portal
Two-point \(L 1\) shortest path queries in the plane
Recommendations
- Two-point \(L_1\) shortest path queries in the plane
- L₁ shortest path queries among polygonal obstacles in the plane
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
Cited in
(15)- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- \(L_{1}\) shortest path queries in simple polygons
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- L₁ shortest path queries among polygonal obstacles in the plane
- Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
- scientific article; zbMATH DE number 1305410 (Why is no real title available?)
- Two-point \(L_1\) shortest path queries in the plane
- A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
- Shadoks Approach to Low-Makespan Coordinated Motion Planning
- Towards space efficient two-point shortest path queries in a polygonal domain
- A new algorithm for Euclidean shortest paths in the plane
- Towards space efficient two-point shortest path queries in a polygonal domain
This page was built for publication: Two-point \(L_1\) shortest path queries in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970460)