Computing a single cell in the overlay of two simple polygons

Information Processing Letters

Volumn 63, Issue 4, 1997, Pages 215-219

  De Berg, Mark ^a   Devillers, Olivier ^b   Dobrindt, Katrin ^a   Schwarzkopf, Otfried ^a,c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b INRIA   (France)

^c Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Arrangement; Computational geometry; Randomized algorithms

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

ARRANGEMENT; RANDOMIZED ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0043100137     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00125-7     Document Type: Article

References (9)

1. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry, Discrete Comput. Geom. 8 (1992) 51-71.
2. K.L. Clarkson, R. Cole and R.E. Tarjan, Randomized parallel algorithms for trapezoidal diagrams, Internat. J. Comput. Geom. Appl. 2 (2) (1992) 117-133.
3. K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
4. M. de Berg, K. Dobrindt and O. Schwarzkopf, On lazy randomized incremental construction, in: Proc. 26th Ann. ACM Symp. Theory Comput. (1994) 105-114.
5. O. Devillers, Randomization yields simple O(n log(Black star) n) algorithms for difficult Ω(n) problems, Internat. J. Comput. Geom. Appl. 2 (1) (1992) 97-111.
6. L.J. Guibas, D.E. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992) 381-413.
7. L.J. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom, Discrete Comput. Geom. 4 (1989) 491-521.
8. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms (Prentice Hall, Englewood Cliffs, NJ, 1994).
9. R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Comput. Geom. Theory Appl. 1 (1991) 51-64.