Pages that link to "Item:Q1188116"
From MaRDI portal
The following pages link to \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116):
Displaying 14 items.
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones (Q5370995) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- Saturation of Multidimensional 0-1 Matrices (Q5889965) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
- Removing Connected Obstacles in the Plane is FPT (Q6059988) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles (Q6567758) (← links)
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices (Q6646422) (← links)
- Sequence saturation (Q6648279) (← links)
