The DOI matches its Crossref record.
Ordered treemap layouts
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Bederson, B. B., Shneiderman, B., & Wattenberg, M. (2002) · ACM Transactions on Graphics · doi:10.1145/571647.571649 · Cited by 424
Self-citationA Visualization System for Space-Time and Multivariate Patterns (VIS-STAMP)
Guo, D., Chen, J., MacEachren, A. M., & Liao, K. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.84 · Cited by 302
Mapping circuit dynamics during function and dysfunction
Gorur-Shandilya, S., Cronin, E. M., Schneider, A. C., Haddad, S. A., Rosenbaum, P., Bucher, D., Nadim, F., & Marder, E. (2022) · eLife · doi:10.7554/elife.76579 · Cited by 27
Metadata
- Authors
- Shneiderman, B., & Wattenberg, M.
- Venue
- IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.
- Publisher
- IEEE
- Published
- 2005-08-29
- Pages
- 73-78
- OpenAlex
- W395227168
- Cited by
- 231
- References
- 0
- FWCI
- 11.46
- Type
- conference paper
- Language
- en
- Open access
- green
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.