Four results on randomized incremental constructions
Authors:
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 461-474
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- 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 sampling1991
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- Linear programming and convex hulls made easy1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- A fast planar partition algorithm. I1988
- Algorithms in Combinatorial Geometry1987
- Oriented projective geometry1987
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976