Pages that link to "Item:Q2970464"
From MaRDI portal
The following pages link to Shortest path in a polygon using sublinear space (Q2970464):
Displaying 14 items.
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Time and space efficient algorithms for shortest paths between convex polygons (Q1098634) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Constant-work-space algorithms for shortest paths in trees and simple polygons (Q2865044) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q5136282) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Shortest Path in a Polygon using Sublinear Space. (Q5368680) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Cospanning characterizations of violator and co-violator spaces (Q6616810) (← links)
