Four results on randomized incremental constructions
- 1 September 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 3 (4) , 185-212
- https://doi.org/10.1016/0925-7721(93)90009-u
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fully dynamic delaunay triangulation in logarithmic expected time per operationComputational Geometry, 1992
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMSInternational Journal of Computational Geometry & Applications, 1992
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygonsComputational Geometry, 1991
- On the construction of abstract voronoi diagramsDiscrete & Computational Geometry, 1991
- Randomized multidimensional search trees (extended abstract): dynamic samplingPublished by Association for Computing Machinery (ACM) ,1991
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976