Pages that link to "Item:Q833714"
From MaRDI portal
The following pages link to Planar rectilinear shortest path computation using corridors (Q833714):
Displaying 16 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- Finding a region with the minimum total \(L_1\) distance from prescribed terminals (Q1400886) (← links)
- Characterizing the shortest path of an object among obstacles (Q1823707) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Shortest rectilinear paths among weighted rectangles (Q3985348) (← links)
- (Q5088992) (← links)
- Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
- Finding a shortest pair of paths on the plane with obstacles and crossing areas (Q6487944) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)
