Tree Layout Algorithms
Tree Layout Algorithms is a computational method that systematically arranges hierarchical tree structures in visual space by determining node positions and edge routing to optimize readability, minimize crossings, and preserve structural relationships.
104
Publications
5.9K
Citations
216
Authors
121
Institutions
Publications per year
2017–2026
7
Parents
104
Benjamin B. Bederson, Ben Shneiderman, Martin Wattenberg · ACM Transactions on Graphics · 2002 · 425 citations
H3: laying out large directed graphs in 3D hyperbolic space
Tamara Munzner · 2002 · 287 citations
Donald L. Adolphson, T. C. Hu · SIAM Journal on Applied Mathematics · 1973 · 278 citations
1–5 of 104
216
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 216
121

University of Rostock
Rostock, Germany
3 h-index
7 publications
184 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
3 h-index
6 publications
374 citations
University of Maryland, College Park
College Park, United States
3 h-index
4 publications
986 citations
University of Konstanz
Konstanz, Germany
3 h-index
5 publications
275 citations
Northwestern University
Evanston, United States
3 h-index
3 publications
81 citations

University of Waterloo
Waterloo, Canada
3 h-index
3 publications
98 citations

Johns Hopkins University
Baltimore, United States
3 h-index
6 publications
255 citations

National Taiwan University
Taipei, Taiwan
3 h-index
6 publications
110 citations
1–8 of 121
TVCG · 7 publications · 522 citations
7
h-index
4 publications · 231 citations
4
h-index
4 publications · 186 citations
4
h-index
3 publications · 153 citations
3
h-index
3 publications · 191 citations
3
h-index
1–5