Treemaps with Bounded Aspect Ratio
Mark de Berg, Bettina Speckmann, Vincent van der Weele

TL;DR
This paper introduces orthoconvex treemaps, a new type of hierarchical visualization that guarantees a constant aspect ratio regardless of tree depth, improving upon traditional rectangular treemaps.
Contribution
The authors present orthoconvex treemaps that ensure bounded aspect ratio for any hierarchical data, regardless of tree depth or node weights, a significant advancement over previous methods.
Findings
Convex partitions achieve optimal aspect ratio of O(depth)
Orthoconvex treemaps have constant aspect ratio for any tree
Specialized results for single-level treemaps
Abstract
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree where the weight of each node is the sum of the weights of its children. A treemap for is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of 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 . However, still depends on the input tree. Hence we introduce a new type of treemaps, namely \emph{orthoconvex treemaps}, where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Visualization and Analytics · Topological and Geometric Data Analysis · Data Management and Algorithms
