Partitioning Regular Polygons into Circular Pieces I: Convex Partitions

Details Partitioning Regular Polygons into Circular Pieces I: Convex Partitions Partitioning Regular Polygons into Circular Pieces I: Convex Partitions

2003-04-17

arxiv.org/abs/cs/0304023v1

Computer Science

Computational Geometry

21 pages, 25 figures

Scientific paper

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of the smallest circumscribing circle to the largest inscribed disk. The problem is rich even for partitioning regular polygons into convex pieces, the focus of this paper. We show that the optimal (most circular) partition for an equilateral triangle has an infinite number of pieces, with the lower bound approachable to any accuracy desired by a particular finite partition. For pentagons and all regular k-gons, k > 5, the unpartitioned polygon is already optimal. The square presents an interesting intermediate case. Here the one-piece partition is not optimal, but nor is the trivial lower bound approachable. We narrow the optimal ratio to an aspect-ratio gap of 0.01082 with several somewhat intricate partitions.

Affiliated with

Also associated with

No associations

Rating

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions 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 Partitioning Regular Polygons into Circular Pieces I: Convex Partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning Regular Polygons into Circular Pieces I: Convex Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-10320