Abstract
We introduce the question: Given a positive integer N, can any 2D convex polygonal region be partitioned into N convex pieces such that all pieces have the same area and the same perimeter? The answer to this question is easily ‘yes’ for N = 2. We give an elementary proof that the answer is ‘yes’ for N = 4 and generalize it to higher powers of 2.
Similar content being viewed by others
References
Akiyama J, Kaneko A, Kano M, Nakamura G, Rivera-Campo E, Tokunaga S and Urrutia J, Radial perfect partitions of convex sets in the plane, in: Japan Conf. Discrete Comput. Geom., pages 1–13 (1998)
Akiyama Jin, Nakamura Gisaku, Rivera-Campo Eduardo and Urrutia Jorge, Perfect divisions of a cake, in: Proc. Canad. Conf. Comput. Geom. (1998) pp. 114–115
Barany I, Blagojevic P and Szucs A, Equipartitioning by a convex 3-fan, Adv. Math. 223(2) (2010) 579–593
Hubard A and Aronov B, arxiv:1010.4611
Karasev R, http://arxiv.org/abs/1011.4762
Nandakumar R and Ramana Rao N, http://nandacumar.blogspot.com/2006/09/cutting-shapes.html (September 2006)
The Open Problems Project, http://maven.smith.edu/ orourke/TOPP/P67.html (July 2007)
Nandakumar R and Ramana Rao N, http://arxiv.org/abs/0812.2241v2 (December 2008)
Nandakumar R and Ramana Rao N, http://arxiv.org/abs/0812.2241v6
Acknowledgements
Discussions with John Rekesh, Pinaki Majumdar, Arun Sivaramakrishnan and researchers at DAIICT, Gandhinagar were of great help. Thanks to Kingshook Biswas for his guidance and advice.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
NANDAKUMAR, R., RAMANA RAO, N. Fair partitions of polygons: An elementary introduction. Proc Math Sci 122, 459–467 (2012). https://doi.org/10.1007/s12044-012-0076-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12044-012-0076-5