'Fair' Partitions of Polygons - an Introduction

Details 'Fair' Partitions of Polygons - an Introduction 'Fair' Partitions of Polygons - an Introduction

2008-12-11

arxiv.org/abs/0812.2241v6

Mathematics

Combinatorics

7 pages. 1 figure. This version (v6) is mostly a formal reworking of the main proof in v2 which was uploaded in December 2008

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

'Fair' Partitions of Polygons - an Introduction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 'Fair' Partitions of Polygons - an Introduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 'Fair' Partitions of Polygons - an Introduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-609094