The Community for Technology Leaders
Information Visualization, IEEE Symposium on (2001)
San Diego, CA
Oct. 22, 2001 to Oct. 23, 2001
ISSN: 1522-404X
ISBN: 0-7695-1342-5
pp: 73
Martin Wattenberg , Columbia University
Ben Shneiderman , University of Maryland
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, 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 favorable aspect ratios of the constituent rectangles. A second test set uses stock market data.
INDEX TERMS
treemaps, ordered treemaps, trees, hierarchies, information visualization
CITATION
Martin Wattenberg, Ben Shneiderman, "Ordered Treemap Layouts", Information Visualization, IEEE Symposium on, vol. 00, no. , pp. 73, 2001, doi:10.1109/INFVIS.2001.963283
89 ms
(Ver 3.3 (11022016))