Pages that link to "Item:Q2123290"
From MaRDI portal
The following pages link to Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290):
Displaying 9 items.
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- The shortest path in a simple polygon with obstacles (Q2850358) (← links)
- Finding a shortest pair of paths on the plane with obstacles and crossing areas (Q6487944) (← links)