This Article 
 Bibliographic References 
 Add to: 
Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm
May/June 2004 (vol. 10 no. 3)
pp. 302-313

Abstract—This paper presents a technique for the representation of large-scale hierarchical data which aims to provide good overviews of complete structures and the content of the data in one display space. The technique represents the data by using nested rectangles. It first packs icons or thumbnails of the lowest-level data and then generates rectangular borders that enclose the packed data. It repeats the process of generating rectangles that enclose the lower-level rectangles until the highest-level rectangles are packed. This paper presents two rectangle-packing algorithms for placing items of hierarchical data onto display spaces. The algorithms refer to Delaunay triangular meshes connecting the centers of rectangles to find gaps where rectangles can be placed. The first algorithm places rectangles where they do not overlap each other and where the extension of the layout area is minimal. The second algorithm places rectangles by referring to templates describing the ideal positions for nodes of input data. It places rectangles where they do not overlap each other and where the combination of the layout area and the distances between the positions described in the template and the actual positions is minimal. It can smoothly represent time-varying data by referring to templates that describe previous layout results. It is also suitable for semantics-based or design-based data layout by generating templates according to the semantics or design.

[1] B. Bederson, PhotoMesa: A Zoomable Image Browser Using Quantum Treemaps and Bubblemaps Proc. UIST 2001, pp. 71-80, 2001.
[2] B. Bederson and B. Schneiderman, Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies ACM Trans. Graphics, vol. 21, no. 4, pp. 833-854, 2002.
[3] B.A. Bell and S.K. Feiner, Dynamic Space Management for User Interfaces Proc. UIST 2000, pp. 238-248, 2000.
[4] D.M. Bruls, K. Huizing, and J.J. Wijk, Squarified Treemaps Proc. Data Visualization 2000 (Joint Eurographics and IEEE TCVG Symp. Visualization), pp. 33-42, 2000.
[5] J. Carrière and R. Kazman, “Research Report: Interacting with Huge Hierarchies: Beyond Cone Trees,” Proc. IEEE Conf. Information Visualization '95, pp. 74-81, 1995.
[6] M. Chuah, “Dynamic Aggregation with Circular Visual Designs,” Proc. IEEE Symp. Information Visualization, pp. 35-43, 1998.
[7] K. Freivalds, U. Dogrusoz, and P. Kikusts, Disconnected Graph Layout and the Polyomino Packing Approach Proc. Graph Drawing 2001, pp. 378-391, 2001.
[8] E. Gansner et al., Improved Force-Directed Layouts Proc. Graph Drawing '98, pp. 364-373, 1998.
[9] M.L. Huang et al., A Fully Animated Interactive System for Clustering and Navigating Huge Graphs Proc. Graph Drawing '98, pp. 374-383, 1998.
[10] T. Igarashi et al., Adaptive Unwrapping for Interactive Texture Painting Proc. Symp. Interactive 3D Graphics 2001, pp. 209-216, 2001.
[11] B. Johnson and B. Shneiderman, “Treemaps: A Space-Filling Approach to the Visualization of Hierarchical Information,” Proc. Visualization '91 Conf., pp. 284-291, 1991.
[12] H. Koike, Fractal Views: A Fractal-Based Method for Controlling Information Display ACM Trans. Information Systems, vol. 13, no. 3, pp. 305-323, 1995.
[13] J. Lamping, R. Rao, and P. Pirolli, The Hyperbolic Browser: A Focus+Context Technique for Visualizing Large Hierarchies J. Visual Languages and Computing, vol. 7, no. 1, pp. 33-55, 1996.
[14] J. Marks et al., Design Galleries: A General Approach to Setting Parameters for Computer Graphics and Animation Proc. ACM SIGGRAPH '97, pp. 389-400, 1997.
[15] D. Harel and M. Politi, Modeling Reactive Systems with Statecharts: The STATEMATE Approach, McGraw-Hill, New York, 1998.
[16] A.J. Quigley et al., FADE: Graph Drawing, Clustering and Visual Abstraction Proc. Graph Drawing 2000, pp. 197-210, 2000.
[17] J. Rekimoto, The Information Cube: Using Transparency in 3D Information Visualization Proc. Third Ann. Workshop Information Technologies&Systems, pp. 125-132, 1993.
[18] B. Shneiderman and M. Wattenberg, Ordered Treemap Layouts Proc. IEEE Information Visualization Symp. 2001, pp. 73-78, 2001.
[19] S.W. Sloan, A Fast Algorithm for Constructing Delaunay Triangulation in the Plane Advances in Eng. Software, vol. 9, pp. 34-55, 1987.
[20] T. Sprenger, R. Brunella, and M. Gross, “H-BLOB: A Hierarchical Visual Clustering Method Using Implicit Surfaces,” Proc. IEEE Visualization, T. Ertl, B. Hamann, and A. Varshney, eds., 2000.
[21] J. Stasko and E. Zhang, Focus+Context Display and Navigation Techniques for Enhancing Radial, Space-Filling Hierarchy Visualizations Proc. IEEE Information Visualization Symp. 2000, pp. 57-65, 2000.
[22] G.J. Wills, NicheWorks Interactive Visualization of Very Large Graphs J. Computational and Graphical Statistics, vol. 8, pp 190-212, 1999.
[23] Y. Yamaguchi, T. Itoh, Y. Ikehata, and Y. Kajinaga, Interactive Poster: Web Site Visualization Using a Hierarchical Rectangle Packing Technique Proc. IEEE Symp. Information Visualization 2002 Interactive Poster Session, 2002.
[24] Y. Yamaguchi and T. Itoh, Visualization of Distributed Processes Using 'Data Jewelry Box II' Algorithm Proc. Computer Graphics Int'l 2003, 2003.

Index Terms:
Hierarchical data, Delaunay triangular mesh, rectangle packing.
Takayuki Itoh, Yumi Yamaguchi, Yuko Ikehata, Yasumasa Kajinaga, "Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm," IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 3, pp. 302-313, May-June 2004, doi:10.1109/TVCG.2004.1272729
Usage of this product signifies your acceptance of the Terms of Use.