Four results on randomized incremental constructions

Computational Geometry: Theory and Applications

Volumn 3, Issue 4, 1993, Pages 185-212

  Clarkson, Kenneth L ^a   Mehlhorn, Kurt ^b   Seidel, Raimund ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b SAARLAND UNIVERSITY   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 43949166410     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(93)90009-U     Document Type: Article

References (21)

1. Applications of random sampling to on-line algorithms in computational geometry
2. Computing a face in an arrangement of line segments
3. Applications of random sampling in computational geometry II
4. *n) algorithms for difficult ω(n) problems
5. Dynamic perfect hashing - upper and lower bounds
6. Fully dynamic Delaunay triangulation in logarithmic expected time per operation
7. Randomized incremental construction of Delaunay and Voronoi diagrams
8. On the construction of abstract Voronoi diagrams
9. Bounded ordered dictionaries in O(log log n) time and O(n) space
10. A fast planar partition algorithm
11. Randomized multidimensional search trees: dynamic sampling
12. Randomized multidimensional search trees: further results in dynamic sampling
13. Randomized multidimensional search trees: Lazy balancing and dynamic shuffling
14. Dynamic maintenance of geometric structures made easy
15. Linear programming and convex hulls made easy
16. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
17. Oriented projective geometry
18. Design and implementation of an efficient priority queue