'Fair' Partitions of Polygons - an Introduction
arXiv:0812.2241 · doi:10.1007/s12044-012-0076-5
Abstract
We address the question: Given a positive integer , can any 2D convex polygonal region be partitioned into convex pieces such that all pieces have the same area and same perimeter? The answer to this question is easily `yes' for =2. We prove the answer to be `yes' for =4 and also discuss higher powers of 2.
7 pages. 1 figure. This version (v6) is mostly a formal reworking of the main proof in v2 which was uploaded in December 2008