Concepedia

Combinatorial Complexity Of Arrangements

Combinatorial Complexity of Arrangements is a theoretical measure in computational geometry that quantifies the asymptotic growth rate of the number of faces, edges, or vertices in an arrangement of curves as a function of the number of curves, capturing the intrinsic combinatorial structure imposed by their intersections.

334

Publications

12.8K

Citations

545

Authors

305

Institutions

Publications per year

2017–2026

14

Parents

Publications

334

On a combinatorial problem in geometry

H. L. Abbott, D. Hanson · Discrete Mathematics · 1975 · 462 citations

, , +8

Constructing Arrangements of Lines and Hyperplanes with Applications

Herbert Edelsbrunner, Joseph O’Rourke, Raimund Seidel · SIAM Journal on Computing · 1986 · 446 citations

, , +17

Combinatorial complexity bounds for arrangements of curves and spheres

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas Guibas et al. · Discrete & Computational Geometry · 1990 · 324 citations · Full text

, , +12

Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

Erik D. Demaine, Martin L. Demaine · Graphs and Combinatorics · 2007 · 218 citations

, , +16

Surveys in combinatorics 1987

Discrete Mathematics · 1989 · 209 citations

, , +10

1–5 of 334

Authors

545

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    31 publications · 1.6K citations

    21

    h-index

  2. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    11 publications · 1.2K citations

    11

    h-index

  3. LG
    Leonidas Guibas

    Stanford University, United States

    6 publications · 545 citations

    6

    h-index

  4. EW
    Emo Welzl

    Freie Universität Berlin, Germany

    6 publications · 566 citations

    6

    h-index

  5. RP
    Richard Pollack

    Courant Institute of Mathematical Sciences, United States

    5 publications · 242 citations

    5

    h-index

1–5 of 545

Institutions

305

  1. Tel Aviv University

    Tel Aviv, Israel

    22 h-index

    45 publications

    2.2K citations

  2. Courant Institute of Mathematical Sciences

    New York, United States

    18 h-index

    23 publications

    1.4K citations

  3. New York University

    New York, United States

    18 h-index

    31 publications

    1.6K citations

  4. Stanford University

    Stanford, United States

    13 h-index

    16 publications

    825 citations

  5. University of Illinois Urbana-Champaign

    Urbana, United States

    11 h-index

    13 publications

    847 citations

  6. University of California, Berkeley

    Berkeley, United States

    6 h-index

    6 publications

    353 citations

  7. Hungarian Academy of Sciences

    Budapest, Hungary

    6 h-index

    8 publications

    405 citations

  8. Centre National de la Recherche Scientifique

    Paris, France

    6 h-index

    13 publications

    473 citations

1–8 of 305

Venues

  1. Discrete Mathematics

    23 publications · 1.4K citations

    16

    h-index

  2. Discrete & Computational Geometry

    23 publications · 912 citations

    16

    h-index

  3. Journal of Combinatorial Theory Series A

    17 publications · 745 citations

    14

    h-index

  4. The Electronic Journal of Combinatorics

    12 publications · 221 citations

    11

    h-index

  5. Discrete Applied Mathematics

    11 publications · 309 citations

    10

    h-index

1–5