Pages that link to "Item:Q5060142"
From MaRDI portal
The following pages link to Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142):
Displaying 12 items.
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153) (← links)
- Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles (Q4209268) (← links)
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane (Q4943866) (← links)
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones (Q5370995) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)