Polygon Partitioning
Polygon Partitioning is a computational geometry method that decomposes a polygon into a set of simpler, non-overlapping sub-polygons such that their union equals the original polygon, typically to facilitate efficient algorithmic processing in spatial reasoning tasks.
61
Publications
2.7K
Citations
115
Authors
76
Institutions
Publications per year
2017–2026
5
Parents
61
A theorem on polygon cutting with applications
Bernard Chazelle · 1982 · 268 citations
Decomposing a Polygon into Simpler Components
Julian Keil · SIAM Journal on Computing · 1985 · 188 citations
Th. Motzkin · Bulletin of the American Mathematical Society · 1948 · 143 citations · Full text
1–5 of 61
115
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 115
76
The University of Texas at Dallas
Richardson, United States
3 h-index
4 publications
55 citations
National Tsing Hua University
Hsinchu, Taiwan
2 h-index
3 publications
73 citations
Harvard University
Cambridge, United States
2 h-index
3 publications
285 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
3 publications
133 citations

Northwestern Polytechnical University
Xi'an, China
2 h-index
6 publications
482 citations

Carleton University
Ottawa, Canada
2 h-index
2 publications
28 citations

McGill University
Montreal, Canada
2 h-index
3 publications
277 citations

The University of Queensland
Brisbane, Australia
2 h-index
3 publications
41 citations
1–8 of 76
4 publications · 122 citations
4
h-index
IJCGA · 2 publications · 115 citations
2
h-index
2 publications · 52 citations
2
h-index
2 publications · 31 citations
2
h-index
2 publications · 65 citations
2
h-index
1–5