3 search results - page 1 / 1 » Partitioning Regular Polygons into Circular Pieces I: Convex... |
CCCG
2003
13 years 6 months ago
2003
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
CORR
2004
Springer
13 years 4 months ago
2004
Springer
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
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 ...