Publications [#235606] of Pankaj K. Agarwal

Papers Published

  1. Agarwal, PK; Aronov, B; Sharir, M, On the complexity of many faces in arrangements of circles, in Forty Second Annual Symposium on Foundations of Computer Science, Annual Symposium on Foundations of Computer Science (Proceedings) (2001), pp. 74-83, IEEE Comput. Soc
    (last updated on 2019/02/23)

    The many-faces problem for arrangements of circles in the plane was studied. The complexity of many faces and the algorithmic problem arised in a variety of problems including three-dimensional arrangements. The improved bounds on the complexity of m distinct faces in an arrangement of n circles were obtained. The bounds coincide with the best known bounds for the number of incidences between m points and n circles.