Sweep Line Algorithms is a computational geometry method that systematically processes geometric events in a sorted order by simulating a line sweeping across the plane, thereby efficiently detecting intersections among line segments.
56
Publications
2.4K
Citations
144
Authors
75
Institutions
Publications per year
2017–2026
6
Parents
Publications
56
An Optimal-Time Algorithm for Slope Selection
Richard Cole, Jeffrey S. Salowe, William Steiger et al. · SIAM Journal on Computing · 1989 · 139 citations
PARALLEL IMPLEMENTATIONS OF THE FAST SWEEPING METHOD
1–5 of 56
Authors
144
- KTKai Tang
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 137 citations
3
h-index
- BŽ
2
h-index
- WN
2
h-index
- SN
2
h-index
- NS
2
h-index
1–5 of 144
Institutions
75
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
7 publications
298 citations
University of Maribor
Maribor, Slovenia
2 h-index
3 publications
88 citations
Synopsys (United States)
Mountain View, United States
2 h-index
5 publications
212 citations
Max Planck Society
Munich, Germany
2 h-index
4 publications
114 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
2 publications
54 citations
Pohang University of Science and Technology
Pohang, South Korea
2 h-index
3 publications
70 citations
Stanford University
Stanford, United States
2 h-index
4 publications
52 citations
ETH Zurich
Zurich, Switzerland
2 h-index
3 publications
283 citations
1–8 of 75
Venues
- Computer-Aided Design
7 publications · 276 citations
7
h-index
- Information Processing Letters
3 publications · 113 citations
3
h-index
- Journal of Parallel and Distributed Computing
2 publications · 39 citations
2
h-index
- Engineering With Computers
2 publications · 108 citations
2
h-index
- Robotics and Computer-Integrated Manufacturing
2 publications · 84 citations
2
h-index
1–5