Randomized Line Arrangement Algorithms
Randomized Line Arrangement Algorithms is a class of randomized geometric algorithms that constructs and analyzes arrangements of lines in the plane by employing random sampling or iterative perturbation to achieve efficient expected complexity and probabilistic guarantees in computational geometry.
9
Publications
322
Citations
14
Authors
13
Institutions
Publications per year
2017–2026
0
9
Rounding arrangements dynamically
Leonidas Guibas, David H. Marimont · 1995 · 39 citations · Full text
Constructing Planar Cuttings in Theory and Practice
Sariel Har-Peled · SIAM Journal on Computing · 2000 · 32 citations
1–5 of 9
14
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 14
13
Stanford University
Stanford, United States
3 h-index
3 publications
102 citations
Palo Alto Research Center
Palo Alto, United States
2 h-index
2 publications
68 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
58 citations
New York University
New York, United States
2 h-index
2 publications
58 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
14 citations

University of Notre Dame
Notre Dame, United States
1 h-index
1 publications
19 citations

Utah State University
Logan, United States
1 h-index
1 publications
19 citations
City College of New York
New York, United States
1 h-index
1 publications
24 citations
1–8 of 13
2 publications · 80 citations
2
h-index
1 publications · 24 citations
1
h-index
1 publications · 19 citations
1
h-index
1 publications · 83 citations
1
h-index
IJCGA · 1 publications · 29 citations
1
h-index
1–5