Handbook of discrete and computational geometry
Balanced partitions of two sets of points in the plane
Computational Geometry: Theory and Applications
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Equal-area locus-based convex polygon decomposition
Theoretical Computer Science
Finding equitable convex partitions of points in a polygon efficiently
ACM Transactions on Algorithms (TALG)
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Dividing a Territory Among Several Vehicles
INFORMS Journal on Computing
| Hi-index | 0.00 |
We prove a generalization of the Ham-Sandwich Theorem. Specifically, let P be a simple polygonal region containing |R|=kn red points and |B|=km blue points in its interior with k=2. We show that P can be partitioned into k relatively-convex regions each of which contains exactly n red and m blue points. A region of P is relatively-convex if it is closed under geodesic (shortest) paths in P. We outline an O(kN^2log^2N) time algorithm for computing such a k-partition, where N=|R|+|B|+|P|.