A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
From MaRDI portal
Publication:5088992
Recommendations
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains
- \(L_{1}\) shortest path queries in simple polygons
- Two-point \(L_1\) shortest path queries in the plane
- Two-point \(L_1\) shortest path queries in the plane
- \(L_1\) shortest path queries among polygonal obstacles in the plane
Cites work
- scientific article; zbMATH DE number 1305410 (Why is no real title available?)
- A new data structure for shortest path queries in a simple polygon
- An Almost Linear Time Algorithm for Generalized Matrix Searching
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Better tradeoffs for exact distance oracles in planar graphs
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Computing minimum length paths of a given homotopy class
- Exact distance oracles for planar graphs
- Geometric applications of a matrix-searching algorithm
- ON GEOMETRIC PATH QUERY PROBLEMS
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- Optimal shortest path queries in a simple polygon
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Planar rectilinear shortest path computation using corridors
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Shortest Path Queries in Polygonal Domains
- Shortest path queries in planar graphs
- TRIANGULATING DISJOINT JORDAN CHAINS
- Triangulating a simple polygon in linear time
- Two-point \(L_1\) shortest path queries in the plane
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(2)
This page was built for publication: A divide-and-conquer algorithm for two-point \(L_1\) shortest path queries in polygonal domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088992)
