Efficient approximate shortest-path queries among isothetic rectangular obstacles
From MaRDI portal
Recommendations
- Rectilinear short path queries among rectangular obstacles
- scientific article; zbMATH DE number 512835
- Rectilinear shortest paths in the presence of rectangular barriers
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Parallel rectilinear shortest paths with rectangular obstacles
Cites work
- A faster approximation algorithm for the Steiner problem in graphs
- A note on two problems in connexion with graphs
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- Optimal Search in Planar Subdivisions
- Rectilinear shortest paths in the presence of rectangular barriers
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(10)- Shortest rectilinear path queries to rectangles in a rectangular domain
- Rectilinear short path queries among rectangular obstacles
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
- Querying Approximate Shortest Paths in Anisotropic Regions
- Applications of a numbering scheme for polygonal obstacles in the plane
- Parallel rectilinear shortest paths with rectangular obstacles
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Planar rectilinear shortest path computation using corridors
- Rectilinear shortest paths in the presence of rectangular barriers
This page was built for publication: Efficient approximate shortest-path queries among isothetic rectangular obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060142)
