The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Tidier Drawings of Trees
Abstract
Various algorithms have been proposed for producing tidy drawings of trees–drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used.
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
Cites
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
Cited by
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
Clustering trees: a visualization for evaluating clusterings at multiple resolutions
Zappia, L., & Oshlack, A. (2018) · GigaScience · doi:10.1093/gigascience/giy083 · Cited by 1,064
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
prefuse: a toolkit for interactive information visualization
Heer, J., Card, S. K., & Landay, J. A. (2005) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1054972.1055031 · Cited by 802
semPlot: Unified Visualizations of Structural Equation Models
Epskamp, S. (2015) · Structural Equation Modeling: A Multidisciplinary Journal · doi:10.1080/10705511.2014.937847 · Cited by 321
Metadata
- Authors
- Reingold, E. M., & Tilford, J. S.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1981-03
- Volume
- SE-7
- Issue
- 2
- Pages
- 223-228
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2045012623
- Cited by
- 505
- References
- 1
- FWCI
- 2.54
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tidier Drawings of Trees. https://app.cochat.ai/papers/10.1109/tse.1981.234519
- The paper
- Reingold, E. M., & Tilford, J. S. (1981). Tidier Drawings of Trees. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.1981.234519
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.