Computing Many Faces in Arrangements of Lines and Segments

We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previously known ones. The main new idea is a simple randomized O(n log n) expected time algorithm for computing n cells in an arrangement of n lines. Key words. arrangements, random sampling, duality AMS subject classifications. 68Q20, 68R05, 68U05 PII. S009753979426616X

• Type: Conference
• Year: 1994
• Where: COMPGEOM
• Authors: Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
• Keywords: AMS Subject Classifications, COMPGEOM 1994, Discrete Geometry, Randomized Algorithms, Time Algorithm