Segment-Intersection Algorithms is a computational geometry method that systematically determines the intersection points between pairs of line segments in a plane by combining geometric predicates with efficient spatial data structures to reduce the time complexity relative to brute-force pairwise testing.
118
Publications
6K
Citations
169
Authors
98
Institutions
Publications per year
2017–2026
4
Parents
Publications
118
Estimating the transition between two intersecting straight lines
D. W. Bacon, Donald G. Watts · Biometrika · 1971 · 490 citations
A theorem on polygon cutting with applications
Bernard Chazelle · 1982 · 268 citations
1–5 of 118
Authors
169
- LG
7
h-index
- PK
6
h-index
- MT
6
h-index
- MS
6
h-index
- BC
5
h-index
1–5 of 169
Institutions
98
Stanford University
Stanford, United States
9 h-index
12 publications
723 citations
Tel Aviv University
Tel Aviv, Israel
7 h-index
13 publications
500 citations
Courant Institute of Mathematical Sciences
New York, United States
7 h-index
12 publications
1K citations
Max Planck Society
Munich, Germany
6 h-index
9 publications
149 citations
Utrecht University
Utrecht, The Netherlands
5 h-index
12 publications
326 citations
Johns Hopkins University
Baltimore, United States
4 h-index
4 publications
147 citations
Princeton University
Princeton, United States
4 h-index
4 publications
628 citations
Brown University
Providence, United States
3 h-index
3 publications
364 citations
1–8 of 98
Venues
- SIAM Journal on Computing
7 publications · 259 citations
7
h-index
- Computational Geometry
6 publications · 190 citations
6
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 5 publications · 191 citations
5
h-index
- Journal of Algorithms
4 publications · 328 citations
4
h-index
- Information Processing Letters
3 publications · 421 citations
3
h-index
1–5