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
156
Topologically sweeping an arrangement
Herbert Edelsbrunner, Leonidas Guibas · 1986 · 287 citations
The power of geometric duality
Bernard Chazelle, Leo J. Guibas, D. T. Lee · BIT Numerical Mathematics · 1985 · 260 citations
Measurement of Length in Random Arrangements of Lines
Bradley Marsh · Journal of Applied Ecology · 1971 · 247 citations
Engineering, Mathematics, Metrology +11
1–5 of 156
222
University of Illinois Urbana-Champaign, United States
12 publications · 1.4K citations
12
h-index
10
h-index
8
h-index
5
h-index
5
h-index
1–5 of 222
162
New York University
New York, United States
11 h-index
12 publications
378 citations
Courant Institute of Mathematical Sciences
New York, United States
10 h-index
10 publications
323 citations
Stanford University
Stanford, United States
7 h-index
7 publications
612 citations

Tel Aviv University
Tel Aviv, Israel
7 h-index
9 publications
211 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
7 publications
523 citations

Sorbonne Université
Paris, France
6 h-index
6 publications
79 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
54 citations
Palo Alto Research Center
Palo Alto, United States
4 h-index
4 publications
399 citations
1–8 of 162
10 publications · 281 citations
10
h-index
PROC · 8 publications · 211 citations
8
h-index
5 publications · 99 citations
5
h-index
5 publications · 696 citations
5
h-index
IJCGA · 4 publications · 156 citations
4
h-index
1–5