Polygon Intersection
Polygon Intersection is a computational geometry method that determines the overlapping region or regions formed by the intersection of two or more polygonal areas in a plane, distinguished by its reliance on edge-to-edge and vertex-to-edge spatial relationships to precisely delineate boundary interactions.
74
Publications
3.4K
Citations
141
Authors
79
Institutions
Publications per year
2017–2026
7
Parents
74
Efficient clipping of arbitrary polygons
Günther Greiner, Kai Hormann · ACM Transactions on Graphics · 1998 · 174 citations · Full text
Touring a sequence of polygons
Moshe Dror, Alon Efrat, Anna Lubiw et al. · 2003 · 135 citations
A new linear algorithm for intersecting convex polygons
Joseph O’Rourke, Chi-Bin Chien, Thomas Olson et al. · Computer Graphics and Image Processing · 1982 · 121 citations
1–5 of 74
141
University of North Carolina at Chapel Hill, United States
3 publications · 135 citations
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 141
79
Courant Institute of Mathematical Sciences
New York, United States
5 h-index
9 publications
416 citations
New York University
New York, United States
5 h-index
9 publications
416 citations
University of Arizona
Tucson, United States
3 h-index
5 publications
352 citations
Princeton University
Princeton, United States
3 h-index
4 publications
192 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
7 publications
340 citations

University of Maribor
Maribor, Slovenia
3 h-index
5 publications
190 citations

Johns Hopkins University
Baltimore, United States
3 h-index
6 publications
618 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
3 h-index
4 publications
131 citations
1–8 of 79
CAGEO · 4 publications · 122 citations
4
h-index
3 publications · 158 citations
3
h-index
2 publications · 80 citations
2
h-index
2 publications · 370 citations
2
h-index
2 publications · 153 citations
2
h-index
1–5