Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Radial Perfect Partitions of Convex Sets in the Plane
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Equipartitions of Measures by 2-Fans
Discrete & Computational Geometry
Minimum-cost load-balancing partitions
Proceedings of the twenty-second annual symposium on Computational geometry
Equitable subdivisions within polygonal regions
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
| Hi-index | 5.23 |
This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon P and a set X of k points positioned arbitrarily inside P, the task is to divide P into k equal-area convex parts, each containing exactly one point of X. The algorithm runs in time O(kn+k^2logk).