Abstract
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree \(\mathcal T\) where the weight of each node is the sum of the weights of its children. A treemap for \(\mathcal T\) is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of \(\mathcal T\) 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, polygonal partitions, that use convex polygons, can have bounded aspect ratio. We are the first to obtain convex partitions with optimal aspect ratio \(O(depth(\mathcal T))\). However, \(depth(\mathcal T)\) still depends on the input tree. Hence we introduce a new type of treemaps, namely 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.
Bettina Speckmann was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.022.707. A full version of this paper can be found at http://arxiv.org/abs/1012.1749.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balzer, M., Deussen, O.: Voronoi treemaps. In: Proc. IEEE Symp. Information Visualization, pp. 7–14 (2005)
Balzer, M., Deussen, O., Lewerentz, C.: Voronoi treemaps for the visualization of software metrics. In: Proc. ACM Symp. Software Vis., pp. 165–172 (2005)
Bederson, B.B., Shneiderman, B., Wattenberg, M.: Ordered and quantum treemaps: Making effective use of 2d space to display hierarchies. ACM Transactions on Graphics 21(4), 833–854 (2002)
Bruls, M., Huizing, K., van Wijk, J.: Squarified Treemaps. In: Proc. Joint Eurographics and IEEE TCVG Symp. Visualization, pp. 33–42. Springer, Heidelberg (2000)
de Berg, M., Onak, K., Sidiropoulos, A.: Fat polygonal partitions with applications to visualization and embeddings (2010) (in preparation), http://arxiv.org/abs/1009.1866v1
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263–269 (1969)
Jin, L., Banks, D.C.: Tennisviewer: A browser for competition trees. IEEE Computer Graphics and Applications 17(4), 63–65 (1997)
Jungmeister, W., Turo, D.: Adapting treemaps to stock portfolio visualization. Technical report UMCP-CSD CS-TR-2996, University of Maryland (1992)
Kong, N., Heer, J., Agrawala, M.: Perceptual guidelines for creating rectangular treemaps. IEEE Trans. Vis. and Comp. Graphics 16(6), 990–998 (2010)
Leung, J.Y.-T., Tam, T.W., Wong, C., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel and Distributed Computing 10, 271–275 (1990)
Onak, K., Sidiropoulos, A.: Circular partitions with applications to visualization and embeddings. In: Proc. 24th Symp. Computational Geometry, pp. 28–37 (2008)
Shneiderman, B.: Treemaps for space-constrained visualization of hierarchies, http://www.cs.umd.edu/hcil/treemap-history/index.shtml
Shneiderman, B.: Tree visualization with tree-maps: 2-d space-filling approach. ACM Transactions on Graphics 11(1), 92–99 (1992)
Vliegen, R., van Wijk, J., van der Linden, E.-J.: Visualizing business data with generalized treemaps. IEEE Trans. Vis. and Comp. Graphics 12(5), 789–796 (2006)
Wattenberg, M.: A note on space-filling visualizations and space-filling curves. In: Proc. IEEE Symp. Information Visualization, pp. 181–185 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M., Speckmann, B., van der Weele, V. (2011). Treemaps with Bounded Aspect Ratio. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)