Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies Benjamin B. Bederson Department of Computer Science Human-Computer Interaction Laboratory Insitute for Advanced Computer Studies 3171 A.V. Williams Building University of Maryland College Park, MD 20742 +1 301 405 2764
[email protected] Ben Shneiderman Department of Computer Science Human-Computer Interaction Laboratory Insitute for Advanced Computer Studies Institute for Systems Research University of Maryland
[email protected] Martin Wattenberg Dow Jones / SmartMoney.com
[email protected] Abstract Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, fail to preserve order of the underlying data, and create layouts that are difficult to visually search. In addition, continuous treemap algorithms are not suitable for displaying fixed-sized objects within them, such as images. This paper introduces a new treemap algorithm which addresses these shortcoming, and analyzes other algorithms we recently developed showing the trade-offs between them. The ordered treemap algorithms ensure that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials, we show that compared to other layout algorithms ordered treemaps are more stable while maintaining relatively favorable aspect ratios of the constituent rectangles.