Pages that link to "Item:Q2957892"
From MaRDI portal
The following pages link to \(L_1\) shortest path queries among polygonal obstacles in the plane (Q2957892):
Displaying 14 items.
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Shortest paths in the plane with convex polygonal obstacles (Q1085615) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Two-point L1 shortest path queries in the plane (Q2970460) (← 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)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (Q5120154) (← links)
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones (Q5370995) (← links)
- Shadoks Approach to Low-Makespan Coordinated Motion Planning (Q6163580) (← links)