Circular partitions with applications to visualization and embeddings

• DOI: 10.1145/1377676.1377683
• Publication Date: 2008-06-10T14:13:22Z
• Authors: Krzysztof Onak; Anastasios Sidiro...
• Keywords: Computational Geometry

We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such partition consists hierarchy convex polygons, each having small aspect ratio, and satisfying specified volume constraints. apply these partitions to obtain natural extension popular Treemap visualization method. Our proposed algorithm is not constrained in using only rectangles, can achieve provably better guarantees on ratio constructed polygons.