| Computing a Single Cell in the Overlay of two Simple Polygons? (2008) | |||||||||||||||
Abstract | |||||||||||||||
| This note combines the lazy randomized incremental construction scheme with the technique of \connectivity acceleration " to obtain an O(n(log? n) 2) time randomized algorithm to compute a single face in the overlay oftwo simple polygons in the plane. Key words: computational geometry, randomized algorithms, arrangement. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||