Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Treemaps, a space-filling method for visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been previously 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 "strip" treemap algorithm which addresses these shortcomings, and analyzes other "pivot" algorithms we recently developed showing the trade-offs between them. These 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 and from actual stock market data, we show that, compared to other layout algorithms, ordered treemaps are more stable, while maintaining relatively favorable aspect ratios of the constituent rectangles. A user study with 20 participants clarifies the human performance benefits of the new algorithms. Finally, we present quantum treemap algorithms, which modify the layout of the continuous treemap algorithms to generate rectangles that are integral multiples of an input object size. The quantum treemap algorithm has been applied to PhotoMesa, an application that supports browsing of large numbers of images.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A First Course in Probability.
Sherman, M. J., & Ross, S. (1984) · Journal of the American Statistical Association · doi:10.2307/2288753 · Cited by 1,344
Tree visualization with tree-maps: 2-d space-filling approach
Shneiderman, B. (1992) · ACM Transactions on Graphics · doi:10.1145/102377.115768 · Cited by 1,328
Self-citationMeasure, topology, and fractal geometry
Edgar, G. A. (1991) · Choice Reviews Online · doi:10.5860/choice.28-5119 · Cited by 648
Ziegel, E. R., & Ross, S. (1998) · Technometrics · doi:10.2307/1271207 · Cited by 275
Shneiderman, B., & Wattenberg, M. (2005) · IEEE Symposium on Information Visualization, 2001. INFOVIS 2001. · doi:10.1109/infvis.2001.963283 · Cited by 231
Self-citationWATTENBERG, M. P. (1999) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/632716.632834 · Cited by 166
Self-citationSpace-filling Software Visualization
Baker, M. J., & Eick, S. G. (1995) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1995.1007 · Cited by 77
Visual search and mouse-pointing in labeled versus unlabeled two-dimensional visual hierarchies
Hornof, A. J. (2001) · ACM Transactions on Computer-Human Interaction · doi:10.1145/502907.502908 · Cited by 70
Cited by
Empirical Studies in Information Visualization: Seven Scenarios
Lam, H., Bertini, E., Isenberg, P., Plaisant, C., & Carpendale, S. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.279 · Cited by 623
The challenge of information visualization evaluation
Plaisant, C. (2004) · Proceedings of the working conference on Advanced visual interfaces · doi:10.1145/989863.989880 · Cited by 590
A Survey of Explanations in Recommender Systems
Tintarev, N., & Masthoff, J. (2007) · 2007 IEEE 23rd International Conference on Data Engineering Workshop · doi:10.1109/icdew.2007.4401070 · Cited by 566
Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
Drivers for global agricultural land use change: The nexus of diet, population, yield and bioenergy
Alexander, P., Rounsevell, M. D. A., Dislich, C., Dodson, J. R., Engström, K., & Moran, D. (2015) · Global Environmental Change · doi:10.1016/j.gloenvcha.2015.08.011 · Cited by 410
Metadata
- Authors
- Bederson, B. B., Shneiderman, B., & Wattenberg, M.
- Venue
- ACM Transactions on Graphics
- Published
- 2002-10
- Volume
- 21
- Issue
- 4
- Pages
- 833-854
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2089463122
- Cited by
- 424
- References
- 8
- FWCI
- 19.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.