Pages that link to "Item:Q1755791"
From MaRDI portal
The following pages link to An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791):
Displaying 11 items.
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← 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)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (Q2898068) (← links)
- (Q3448851) (redirect page) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)