Fair partitions of polygons: an elementary introduction

From MaRDI portal
Publication:692544

DOI10.1007/S12044-012-0076-5zbMATH Open1260.52013arXiv0812.2241OpenAlexW3100386740MaRDI QIDQ692544FDOQ692544


Authors: R. Nandakumar, N. Ramana Rao Edit this on Wikidata


Publication date: 6 December 2012

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Abstract: We address 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 same perimeter? The answer to this question is easily `yes' for N=2. We prove the answer to be `yes' for N=4 and also discuss higher powers of 2.


Full work available at URL: https://arxiv.org/abs/0812.2241




Recommendations




Cites Work


Cited In (23)





This page was built for publication: Fair partitions of polygons: an elementary introduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692544)