The common exterior of convex polygons in the plane

Boris Aronov, Micha Sharir

    Research output: Contribution to journalArticle

    Abstract

    We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: (1) The maximum complexity of the entire common exterior is Θ(na(k) + k2). 2 (2) The maximum complexity of a single cell of the common exterior is Θ(na(k)). (3) The complexity of m distinct cells in the common exterior is O(m2/3k2/3log1/3(k2/m) + n log k) and can be Ω(m2/3k2/3 + na(k)) in the worst case.

    Original languageEnglish (US)
    Pages (from-to)139-149
    Number of pages11
    JournalComputational Geometry: Theory and Applications
    Volume8
    Issue number3
    StatePublished - Aug 1997

    Fingerprint

    Convex polygon
    Cell
    Union
    Complement
    Entire
    Distinct

    Keywords

    • Arrangements
    • Combinatorial complexity
    • Common exterior
    • Convex polygons

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Discrete Mathematics and Combinatorics
    • Geometry and Topology

    Cite this

    The common exterior of convex polygons in the plane. / Aronov, Boris; Sharir, Micha.

    In: Computational Geometry: Theory and Applications, Vol. 8, No. 3, 08.1997, p. 139-149.

    Research output: Contribution to journalArticle

    Aronov, Boris ; Sharir, Micha. / The common exterior of convex polygons in the plane. In: Computational Geometry: Theory and Applications. 1997 ; Vol. 8, No. 3. pp. 139-149.
    @article{ee96a7c7693048398dc7e2633030a4a6,
    title = "The common exterior of convex polygons in the plane",
    abstract = "We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: (1) The maximum complexity of the entire common exterior is Θ(na(k) + k2). 2 (2) The maximum complexity of a single cell of the common exterior is Θ(na(k)). (3) The complexity of m distinct cells in the common exterior is O(m2/3k2/3log1/3(k2/m) + n log k) and can be Ω(m2/3k2/3 + na(k)) in the worst case.",
    keywords = "Arrangements, Combinatorial complexity, Common exterior, Convex polygons",
    author = "Boris Aronov and Micha Sharir",
    year = "1997",
    month = "8",
    language = "English (US)",
    volume = "8",
    pages = "139--149",
    journal = "Computational Geometry: Theory and Applications",
    issn = "0925-7721",
    publisher = "Elsevier",
    number = "3",

    }

    TY - JOUR

    T1 - The common exterior of convex polygons in the plane

    AU - Aronov, Boris

    AU - Sharir, Micha

    PY - 1997/8

    Y1 - 1997/8

    N2 - We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: (1) The maximum complexity of the entire common exterior is Θ(na(k) + k2). 2 (2) The maximum complexity of a single cell of the common exterior is Θ(na(k)). (3) The complexity of m distinct cells in the common exterior is O(m2/3k2/3log1/3(k2/m) + n log k) and can be Ω(m2/3k2/3 + na(k)) in the worst case.

    AB - We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: (1) The maximum complexity of the entire common exterior is Θ(na(k) + k2). 2 (2) The maximum complexity of a single cell of the common exterior is Θ(na(k)). (3) The complexity of m distinct cells in the common exterior is O(m2/3k2/3log1/3(k2/m) + n log k) and can be Ω(m2/3k2/3 + na(k)) in the worst case.

    KW - Arrangements

    KW - Combinatorial complexity

    KW - Common exterior

    KW - Convex polygons

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

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

    M3 - Article

    VL - 8

    SP - 139

    EP - 149

    JO - Computational Geometry: Theory and Applications

    JF - Computational Geometry: Theory and Applications

    SN - 0925-7721

    IS - 3

    ER -