Time-space trade-offs for triangulations and Voronoi diagrams
- 1 August 2018
- journal article
- conference paper
- Published by Elsevier in Computational Geometry
- Vol. 73, 35-45
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- MEXT (12H00855, 15H02665)
- DFG (MU 3501/1, MU 3501/2)
- DFG (GRK 1408)
This publication has 13 references indexed in Scilit:
- Computing a visibility polygon using few variablesComputational Geometry, 2014
- Space–Time Trade-offs for Stack-Based AlgorithmsAlgorithmica, 2014
- Memory-constrained algorithms for simple polygonsComputational Geometry, 2013
- Multi-Pass Geometric AlgorithmsDiscrete & Computational Geometry, 2006
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETSInternational Journal of Computational Geometry & Applications, 1995
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationSIAM Journal on Computing, 1982
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973