Corpus ID: 81326

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions

  title={Partitioning Regular Polygons into Circular Pieces I: Convex Partitions},
  author={M. Damian and J. O'Rourke},
  • M. Damian, J. O'Rourke
  • Published in CCCG 2003
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    3 Citations

    Figures and Tables from this paper

    Towards an evolved lower bound for the most circular partition of a square
    • PDF
    • PDF


    Decomposing a Polygon into Simpler Components
    • J. Keil
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1985
    • 190
    • Highly Influential
    Optimal Convex Decompositions
    • 138
    Exact and approximation algorithms for computing optimal fat decompositions
    • M. Damian
    • Computer Science, Mathematics
    • Comput. Geom.
    • 2004
    • 9
    • PDF
    Mathematics: From the Birth of Numbers
    • 137
    • PDF
    Range Searching and Point Location among Fat Objects
    • 103
    • PDF
    Motion planning amidst fat obstacles
    • 116
    Computer graphics—principles and practice
    • 2,036
    • PDF
    Open problems from cccg 2001
    • 49
    • PDF
    • 53
    • PDF
    Comput. Geom
    • Comput. Geom
    • 2003