Plane Sweep Algorithms is a computational geometry method that systematically processes geometric objects by advancing an imaginary line across the plane and maintaining a dynamic data structure to detect intersections incrementally.
77
Publications
4.4K
Citations
176
Authors
92
Institutions
Publications per year
2017–2026
10
Variants
Sweep Line AlgorithmsSweep-line Algorithms
Parents
Publications
77
Topologically sweeping an arrangement
Herbert Edelsbrunner, Leonidas Guibas · 1986 · 287 citations
Finite-resolution computational geometry
Daniel Greene, F. Frances Yao · 1986 · 163 citations
1–5 of 77
Authors
176
- MT
5
h-index
- RS
3
h-index
- SR
3
h-index
- PG
3
h-index
- PB
3
h-index
1–5 of 176
Institutions
92
Microsoft (United States)
Redmond, United States
4 h-index
6 publications
338 citations
Johns Hopkins University
Baltimore, United States
4 h-index
8 publications
174 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
4 publications
145 citations
Graz University of Technology
Graz, Austria
3 h-index
7 publications
130 citations
Peking University
Beijing, China
2 h-index
2 publications
1.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
3 publications
359 citations
The University of Tokyo
Tokyo, Japan
2 h-index
3 publications
58 citations
KU Leuven
Leuven, Belgium
2 h-index
6 publications
135 citations
1–8 of 92
Venues
- Computer-Aided Design
4 publications · 255 citations
4
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
4 publications · 116 citations
4
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 3 publications · 63 citations
3
h-index
- IEEE Transactions on Image Processing
2 publications · 46 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 101 citations
2
h-index
1–5