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 $\sqrt{n}$ cells in an arrangement of n lines.

[1]  Bernard Chazelle,et al.  A deterministic view of random sampling and its use in geometry , 1990, Comb..

[2]  Herbert Edelsbrunner,et al.  On the maximal number of edges of many faces in an arrangement , 1986, J. Comb. Theory, Ser. A.

[3]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[4]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[5]  Mark de Berg,et al.  On lazy randomized incremental construction , 1995, Discret. Comput. Geom..

[6]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[7]  M. Sharir,et al.  Improved bounds on the complexity of many faces in arrangements of segments , 1992 .

[8]  Ketan Mulmuley,et al.  A fast planar partition algorithm. I , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[10]  R. Canham.  A theorem on arrangements of lines in the plane , 1969 .

[11]  Leonidas J. Guibas,et al.  Computing a face in an arrangement of line segments , 1991, SODA '91.

[12]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[13]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[14]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[15]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.