, Volume 5, Issue 1, pp 161-196

The complexity and construction of many faces in arrangements of lines and of segments

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3−δ n 2/3+2δ +n) for anyδ>0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3−δ n 2/3+2δ logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3−δ n 2/3+2δ + (n) logm) for anyδ>0, whereα(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3−δ n 2/3+2δ log+(n) log2 n logm).

The first author is pleased to acknowledge partial support by the Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the National Science Foundation under Grant CCR-8714565. Work on this paper by the third author has been supported by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation Grant DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD-the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 44–55.