Math @ Duke

Publications [#235606] of Pankaj K. Agarwal
Papers Published
 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. 7483
(last updated on 2017/12/17)
Abstract: The manyfaces 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 threedimensional 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.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

