On the complexity of many faces in arrangements of circles

P. K. Agarwal, B. Aronov, M. Sharir

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    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.

    Original languageEnglish (US)
    Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
    Pages74-83
    Number of pages10
    StatePublished - 2001
    Event42nd Annual Symposium on Foundations of Computer Science - Las Vegas, NV, United States
    Duration: Oct 14 2001Oct 17 2001

    Other

    Other42nd Annual Symposium on Foundations of Computer Science
    CountryUnited States
    CityLas Vegas, NV
    Period10/14/0110/17/01

    ASJC Scopus subject areas

    • Hardware and Architecture

    Cite this

    Agarwal, P. K., Aronov, B., & Sharir, M. (2001). On the complexity of many faces in arrangements of circles. In Annual Symposium on Foundations of Computer Science - Proceedings (pp. 74-83)

    On the complexity of many faces in arrangements of circles. / Agarwal, P. K.; Aronov, B.; Sharir, M.

    Annual Symposium on Foundations of Computer Science - Proceedings. 2001. p. 74-83.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Agarwal, PK, Aronov, B & Sharir, M 2001, On the complexity of many faces in arrangements of circles. in Annual Symposium on Foundations of Computer Science - Proceedings. pp. 74-83, 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, United States, 10/14/01.
    Agarwal PK, Aronov B, Sharir M. On the complexity of many faces in arrangements of circles. In Annual Symposium on Foundations of Computer Science - Proceedings. 2001. p. 74-83
    Agarwal, P. K. ; Aronov, B. ; Sharir, M. / On the complexity of many faces in arrangements of circles. Annual Symposium on Foundations of Computer Science - Proceedings. 2001. pp. 74-83
    @inproceedings{e9af4f3e979f40779df501ce3b902eec,
    title = "On the complexity of many faces in arrangements of circles",
    abstract = "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.",
    author = "Agarwal, {P. K.} and B. Aronov and M. Sharir",
    year = "2001",
    language = "English (US)",
    pages = "74--83",
    booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",

    }

    TY - GEN

    T1 - On the complexity of many faces in arrangements of circles

    AU - Agarwal, P. K.

    AU - Aronov, B.

    AU - Sharir, M.

    PY - 2001

    Y1 - 2001

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0035161812&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0035161812&partnerID=8YFLogxK

    M3 - Conference contribution

    SP - 74

    EP - 83

    BT - Annual Symposium on Foundations of Computer Science - Proceedings

    ER -