A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
From MaRDI portal
Publication:4640339
Recommendations
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- Optimal shortest path queries in a simple polygon
- A new data structure for shortest path queries in a simple polygon
- Time and space efficient algorithms for shortest paths between convex polygons
- Constant-work-space algorithm for a shortest path in a simple polygon
- AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
- Time-space trade-offs for triangulating a simple polygon
- Time-space trade-offs for triangulating a simple polygon
- \(L_{1}\) shortest path queries in simple polygons
Cites work
- Computational Geometry in C
- Computing a visibility polygon using few variables
- Constant-work-space algorithms for geometric problems
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Memory-constrained algorithms for simple polygons
- Shortest Path in a Polygon using Sublinear Space.
- Space-time trade-offs for stack-based algorithms
- Time-space tradeoffs for all-nearest-larger-neighbors problems
Cited in
(6)- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
- Time and space efficient algorithms for shortest paths between convex polygons
- Constant-work-space algorithm for a shortest path in a simple polygon
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
This page was built for publication: A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640339)
