Improved bound for the union of fat triangles

Esther Ezra, Boris Aronov, Micha Sharir

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

    Abstract

    We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2 α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].

    Original languageEnglish (US)
    Title of host publicationProceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
    Pages1778-1785
    Number of pages8
    StatePublished - 2011
    Event22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 - San Francisco, CA, United States
    Duration: Jan 23 2011Jan 25 2011

    Other

    Other22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
    CountryUnited States
    CitySan Francisco, CA
    Period1/23/111/25/11

    Fingerprint

    Combinatorial Complexity
    Oils and fats
    Triangle
    Union
    Angle
    Oils

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Ezra, E., Aronov, B., & Sharir, M. (2011). Improved bound for the union of fat triangles. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011 (pp. 1778-1785)

    Improved bound for the union of fat triangles. / Ezra, Esther; Aronov, Boris; Sharir, Micha.

    Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. 2011. p. 1778-1785.

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

    Ezra, E, Aronov, B & Sharir, M 2011, Improved bound for the union of fat triangles. in Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. pp. 1778-1785, 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, CA, United States, 1/23/11.
    Ezra E, Aronov B, Sharir M. Improved bound for the union of fat triangles. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. 2011. p. 1778-1785
    Ezra, Esther ; Aronov, Boris ; Sharir, Micha. / Improved bound for the union of fat triangles. Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. 2011. pp. 1778-1785
    @inproceedings{3826a4705e714c5d9415e5ab9caf9281,
    title = "Improved bound for the union of fat triangles",
    abstract = "We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2 α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].",
    author = "Esther Ezra and Boris Aronov and Micha Sharir",
    year = "2011",
    language = "English (US)",
    isbn = "9780898719932",
    pages = "1778--1785",
    booktitle = "Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011",

    }

    TY - GEN

    T1 - Improved bound for the union of fat triangles

    AU - Ezra, Esther

    AU - Aronov, Boris

    AU - Sharir, Micha

    PY - 2011

    Y1 - 2011

    N2 - We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2 α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].

    AB - We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2 α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].

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

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

    M3 - Conference contribution

    SN - 9780898719932

    SP - 1778

    EP - 1785

    BT - Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011

    ER -