Abstract.
We prove a generalization of the famous Ham Sandwich Theorem for the plane. Given gn red points and gm blue points in the plane in general position, there exists an equitable subdivision of the plane into g disjoint convex polygons, each of which contains n red points and m blue points. For g=2 this problem is equivalent to the Ham Sandwich Theorem in the plane. We also present an efficient algorithm for constructing an equitable subdivision.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 19, 1999, and in revised form June 3, 1999. {\it Online publication August\/} 18, 2000.
Rights and permissions
About this article
Cite this article
Bespamyatnikh, S., Kirkpatrick, D. & Snoeyink, J. Generalizing Ham Sandwich Cuts to Equitable Subdivisions . Discrete Comput Geom 24, 605–622 (2000). https://doi.org/10.1007/s004540010065
Issue Date:
DOI: https://doi.org/10.1007/s004540010065