HCIL-2001-06

Shneiderman, B., Wattenberg, M.
April 2001
Proc. IEEE Symposium on Information Visualization 2001, 73-78. IEEE Press, Los Alamitos, CA (October 2001).
HCIL-2001-06, CS-TR-4237, UMIACS-TR-2001-26, ISR-TR-2005-16
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, and fail to preserve an ordering of the underlying data. This paper introduces the ordered treemap, which addresses these two shortcomings. The ordered treemap algorithm ensures 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 low aspect ratios of the constituent rectangles. A second test set uses stock market data.
Return to Main TRs Page