Computing many faces in arrangements of lines and segments


Journal Article

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.

Duke Authors

Cited Authors

  • Agarwal, PK; Matousek, J; Schwarzkopf, O

Published Date

  • January 1, 1994

Published In

  • Proceedings of the Annual Symposium on Computational Geometry

Start / End Page

  • 76 - 84

Citation Source

  • Scopus