Treevis.net: A Tree Visualization Reference
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Tree visualization is one of the best-studied areas of information visualization; researchers have developed more than 200 visualization and layout techniques for trees. The treevis.net project aims to provide a hand-curated bibliographical reference to this ever-growing wealth of techniques. It offers a visual overview that users can filter to a desired subset along the design criteria of dimensionality, edge representation, and node alignment. Details, including links to the original publications, can be brought up on demand. Treevis.net has become a community effort, with researchers sending in preprints of their tree visualization techniques to be published or pointing out additional information.
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
The Design Space of Implicit Hierarchy Visualization: A Survey
Schulz, H.-J., Hadlak, S., & Schumann, H. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2010.79 · Cited by 161 · cited 1×
“link; (2) implicit, inclusion; (3) implicit, overlap; and (4) implicit, adjacency.”
Self-citationStructural Decomposition Trees
Engel, D., Rosenbaum, R., Bernd Hamann, A., & Hagen, H. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01941.x · Cited by 11 · cited 1×
“link; (2) implicit, inclusion; (3) implicit, overlap; and (4) implicit, adjacency.”
Cited by
Rulematrix: Visualizing and understanding classifiers with rules
Ming, Y., Qu, H., & Bertini, E. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2864812 · Cited by 243
Metadata
- Authors
- Schulz, H.-J.
- Venue
- IEEE Computer Graphics and Applications
- Published
- 2011-11
- Volume
- 31
- Issue
- 6
- Pages
- 11-15
- ISSN
- 0272-1716 (ISSN-L)
- OpenAlex
- W2159367517
- Cited by
- 232
- References
- 2
- FWCI
- 9.66
- 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.