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
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...