The following pages link to Minimum-link paths revisited (Q2450201):
Displaying 22 items.
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Finding paths with minimum shared edges (Q386426) (← links)
- Minimum cost path problems with relays (Q709122) (← links)
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472) (← links)
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges (Q1693321) (← 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)
- (Q2978407) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- On the complexity of minimum-link path problems (Q3132885) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- (Q3321860) (← links)
- The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- Link-Length Minimization in Networks (Q5378793) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
