The following pages link to Minimum-link paths revisited (Q2450201):
Displaying 10 items.
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← 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)
- (Q3301019) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
