An introduction to randomization in computational geometry
From MaRDI portal
Publication:1351693
DOI10.1016/0304-3975(95)00174-3zbMath0871.68166OpenAlexW1988237900MaRDI QIDQ1351693
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00174-3
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four results on randomized incremental constructions
- On levels in arrangements and Voronoi diagrams
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Maintenance of configurations in the plane
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Applications of random sampling to on-line algorithms in computational geometry
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- On the randomized construction of the Delaunay tree
- Towards dynamic randomized algorithms in computational geometry
- An optimal convex hull algorithm in any fixed dimension
- New applications of random sampling in computational geometry
- Applications of random sampling in computational geometry. II
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
- Computing a Face in an Arrangement of Line Segments and Related Problems
- An optimal algorithm for intersecting line segments in the plane
- Dog Bites Postman
- On lazy randomized incremental construction
This page was built for publication: An introduction to randomization in computational geometry
