Time-space trade-offs for triangulating a simple polygon
From MaRDI portal
Recommendations
- Time-space trade-offs for triangulating a simple polygon
- A time-space trade-off for triangulations of points in the plane
- Triangulating a simple polygon in linear time
- Time-space trade-offs for triangulations and Voronoi diagrams
- Time-space trade-offs for triangulations and Voronoi diagrams
- scientific article; zbMATH DE number 619546
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Polygon triangulation: Efficiency and minimality
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- A randomized algorithm for triangulating a simple polygon in linear time
Cited in
(13)- Time-space trade-offs for triangulations and Voronoi diagrams
- Memory-constrained algorithms for simple polygons
- A time-space trade-off for triangulations of points in the plane
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- Space-time trade-offs for stack-based algorithms
- Time-space trade-offs for triangulations and Voronoi diagrams
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- Experimental study of compressed stack algorithms in limited memory environments
- Time-space trade-offs for triangulating a simple polygon
- Constant workspace algorithms for computing relative hulls in the plane
- Shortest paths of mutually visible robots
This page was built for publication: Time-space trade-offs for triangulating a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745387)
