Pairwise Segment Intersection
Pairwise Segment Intersection is a computational geometry construct that identifies and characterizes the intersection points between every pair of line segments within a given set, distinguished by its focus on binary segment interactions as the fundamental unit of analysis.
8
Publications
315
Citations
15
Authors
12
Institutions
Publications per year
2017–2026
0
Parents
8
An optimal algorithm for finding segments intersections
Ivan J. Balaban · 1995 · 154 citations · Full text
1–5 of 8
15
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
12
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
14 citations
Centre d'Analyse et de Mathématique Sociales
Paris, France
1 h-index
2 publications
70 citations
TU Dortmund University
Dortmund, Germany
1 h-index
1 publications
19 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
19 citations
Keldysh Institute of Applied Mathematics
Moscow, Russia
1 h-index
1 publications
154 citations
Duke University
Durham, United States
1 h-index
2 publications
98 citations

University of KwaZulu-Natal
Durban, South Africa
1 h-index
1 publications
14 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
1 publications
14 citations
1–8 of 12
2 publications · 46 citations
2
h-index
1 publications · 14 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 23 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5