Convex Partitioning is a spatial partitioning method that divides a geometric space into non-overlapping convex regions such that their union exactly covers the original space.
122
Publications
5.2K
Citations
233
Authors
153
Institutions
Publications per year
2017–2026
10
Parents
Publications
122
On the division of space with minimum partitional area
William Thomson · Acta Mathematica · 1887 · 296 citations · Full text
A theorem on polygon cutting with applications
Bernard Chazelle · 1982 · 268 citations
A Convex Approach to Minimal Partitions
Antonin Chambolle, Daniel Cremers, Thomas Pock · SIAM Journal on Imaging Sciences · 2012 · 170 citations
1–5 of 122
Authors
233
- HJ
5
h-index
- CW
4
h-index
- UG
4
h-index
- BC
4
h-index
- FK
3
h-index
1–5 of 233
Institutions
153
Huazhong University of Science and Technology
Wuhan, China
5 h-index
14 publications
236 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
5 publications
188 citations
InterDigital (United States)
Wilmington, United States
4 h-index
4 publications
72 citations
Chinese Academy of Sciences
Beijing, China
4 h-index
4 publications
57 citations
University of British Columbia
Vancouver, Canada
3 h-index
9 publications
327 citations
Graz University of Technology
Graz, Austria
3 h-index
3 publications
256 citations
University of Bonn
Bonn, Germany
3 h-index
3 publications
111 citations
Stanford University
Stanford, United States
3 h-index
6 publications
204 citations
1–8 of 153
Venues
- Discrete & Computational Geometry
4 publications · 146 citations
4
h-index
- International Journal for Numerical Methods in Engineering
4 publications · 203 citations
4
h-index
- Computational Geometry
4 publications · 143 citations
4
h-index
- Discrete Applied Mathematics
4 publications · 88 citations
4
h-index
- Algorithmica
3 publications · 133 citations
3
h-index
1–5