A new balanced subdivision of a simple polygon for time-space trade-off algorithms
From MaRDI portal
Publication:5136282
Recommendations
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- Time-space trade-offs for triangulating a simple polygon
- Time-space trade-offs for triangulating a simple polygon
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- Memory-constrained algorithms for simple polygons
Cites work
- A time-space trade-off for triangulations of points in the plane
- Computational geometry. Algorithms and applications.
- 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 trade-offs for triangulating a simple polygon
- Time-space tradeoffs for all-nearest-larger-neighbors problems
- Triangulating a simple polygon in linear time
- Upper bounds for time-space trade-offs in sorting and selection
Cited in
(5)- Shortest path in a polygon using sublinear space
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
- scientific article; zbMATH DE number 2080267 (Why is no real title available?)
- Time-space trade-offs for triangulating a simple polygon
This page was built for publication: A new balanced subdivision of a simple polygon for time-space trade-off algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136282)
