Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions

Details Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions

2004-12-21

arxiv.org/abs/cs/0412095v1

Computer Science

Computational Geometry

13 pages, 11 figures

Scientific paper

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal circular partition minimizes the maximum ratio over all pieces in the partition. We show that the equilateral triangle has an optimal 4-piece nonconvex partition, the square an optimal 13-piece nonconvex partition, and the pentagon has an optimal nonconvex partition with more than 20 thousand pieces. For hexagons and beyond, we provide a general algorithm that approaches optimality, but does not achieve it.

Affiliated with

Also associated with

No associations

Rating

Partitioning Regular Polygons into Circular Pieces II:Nonconvex 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 II:Nonconvex 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 II:Nonconvex Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-121287