Pages that link to "Item:Q1351630"
From MaRDI portal
The following pages link to Rectilinear short path queries among rectangular obstacles (Q1351630):
Displaying 15 items.
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE (Q3986396) (← links)
- Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles (Q4209268) (← links)
- ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane (Q4943866) (← links)
- Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← 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)