TY - BOOK

T1 - Treemaps with bounded aspect ratio

AU - Berg, de, M.T.

AU - Speckmann, B.

AU - Weele, van der, V.

PY - 2010

Y1 - 2010

N2 - Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $\tree$ and the area of each region is proportional to the weight of the corresponding node. An important quality criterium for treemaps is the aspect ratio of its regions. Unfortunately, one cannot bound the aspect ratio if the regions are restricted to be rectangles. Hence Onak and Sidiropoulos in SoCG 2008 introduced \emph{polygonal partitions}, which use convex polygons. We are the first to obtain convex partitions with optimal aspect ratio $O(\depth(\tree))$. Furthermore, we consider rectilinear partitions, which retain more of the schematized flavor of standard rectangular treemaps. Our rectilinear treemaps have constant aspect ratio, independent of $\depth(\tree)$ or the number and weight of the nodes. The leaves of $\tree$ are represented by rectangles, L-, and S-shapes and internal nodes by orthoconvex polygons.
We also consider the important special case that $\depth(\tree)=1$, that is, single-level treemaps. We prove that it is strongly NP-hard to minimize the aspect ratio of a rectangular single-level treemap. On the positive side we show how to construct rectilinear and convex single-level treemaps with constant aspect ratio. Our rectilinear single-level treemaps use only rectangles and L-shapes and have aspect ratio at most $2 + 2 \sqrt{3}/3$. The convex version uses four different octilinear shapes and has aspect ratio at most 9/2.

AB - Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $\tree$ and the area of each region is proportional to the weight of the corresponding node. An important quality criterium for treemaps is the aspect ratio of its regions. Unfortunately, one cannot bound the aspect ratio if the regions are restricted to be rectangles. Hence Onak and Sidiropoulos in SoCG 2008 introduced \emph{polygonal partitions}, which use convex polygons. We are the first to obtain convex partitions with optimal aspect ratio $O(\depth(\tree))$. Furthermore, we consider rectilinear partitions, which retain more of the schematized flavor of standard rectangular treemaps. Our rectilinear treemaps have constant aspect ratio, independent of $\depth(\tree)$ or the number and weight of the nodes. The leaves of $\tree$ are represented by rectangles, L-, and S-shapes and internal nodes by orthoconvex polygons.
We also consider the important special case that $\depth(\tree)=1$, that is, single-level treemaps. We prove that it is strongly NP-hard to minimize the aspect ratio of a rectangular single-level treemap. On the positive side we show how to construct rectilinear and convex single-level treemaps with constant aspect ratio. Our rectilinear single-level treemaps use only rectangles and L-shapes and have aspect ratio at most $2 + 2 \sqrt{3}/3$. The convex version uses four different octilinear shapes and has aspect ratio at most 9/2.

M3 - Report

T3 - arXiv.org [cs.CG]

BT - Treemaps with bounded aspect ratio

PB - s.n.

ER -