Line Arrangements

Line Arrangements is a geometric construct in computational geometry that partitions the plane into regions, called faces, by the arrangement of a finite set of lines, where each face represents a maximal connected subset of points with identical incidence relationships to the lines.

156

Publications

6.9K

Citations

222

Authors

162

Institutions

Publications per year

2017–2026

14

Variants

Arrangements Of Lines

Authors

222

  1. HE
    Herbert Edelsbrunner

    University of Illinois Urbana-Champaign, United States

    12 publications · 1.4K citations

    12

    h-index

  2. MS
    Micha Sharir

    Tel Aviv University, Israel

    10 publications · 304 citations

    10

    h-index

  3. LG
    Leonidas Guibas

    Stanford University, United States

    8 publications · 674 citations

    8

    h-index

  4. PK
    Pankaj K. Agarwal

    Duke University, United States

    5 publications · 226 citations

    5

    h-index

  5. BC
    Bernard Chazelle

    Princeton University, United States

    5 publications · 459 citations

    5

    h-index

1–5 of 222

Venues

  1. Discrete & Computational Geometry

    10 publications · 281 citations

    10

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 8 publications · 211 citations

    8

    h-index

  3. Journal of Combinatorial Theory Series A

    5 publications · 99 citations

    5

    h-index

  4. SIAM Journal on Computing

    5 publications · 696 citations

    5

    h-index

  5. 4

    h-index

1–5