Treemaps with bounded aspect ratio

DOI10.1007/978-3-642-25591-5_28MaRDI QIDQ3104620zbMATH OpenOpenAlexWikidataFDO

Authors Bettina Speckmann, Vincent van der Weele, Mark de Berg

Publication date 16 December 2011

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.1749

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $ree$ where the weight of each node is the sum of the weights of its children. A treemap for $ree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $ree$ and its area is proportional to the weight of the corresponding node. An important quality criterion for treemaps is the aspect ratio of its regions. One cannot bound the aspect ratio if the regions are restricted to be rectangles. In contrast, emph{polygonal partitions}, that use convex polygons, have bounded aspect ratio. We are the first to obtain convex partitions with optimal aspect ratio $O(depth(ree))$. However, $depth(ree)$ still depends on the input tree. Hence we introduce a new type of treemaps, namely emph{orthoconvex treemaps}, where regions representing leaves are rectangles, L-, and S-shapes, and regions representing internal nodes are orthoconvex polygons. We prove that any input tree, irrespective of the weights of the nodes and the depth of the tree, admits an orthoconvex treemap of constant aspect ratio. We also obtain several specialized results for single-level treemaps, that is, treemaps where the input tree has depth~1.

Recommendations

• Treemaps with bounded aspect ratio
• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
• Fat polygonal partitions with applications to visualization and embeddings
• Adjacency-preserving spatial treemaps
• Adjacency-preserving spatial treemaps

Cited in

(6)

• Treemaps with bounded aspect ratio
• Fat polygonal partitions with applications to visualization and embeddings
• Adjacency-preserving spatial treemaps
• Circular partitions with applications to visualization and embeddings
• Adjacency-preserving spatial treemaps
• A competitive strategy for distance-aware online shape allocation

This page was built for publication: Treemaps with bounded aspect ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104620)