Grid Drawings of Binary Trees: An Experimental Study

DOI10.7155/JGAA.00163MaRDI QIDQ5301433zbMATH OpenOpenAlexFDO

Authors Adrian Rusu, Confesor Santiago

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2008/RusuSantiago2008.12.2.pdf

zbMATH Keywords

Angular ResolutionAreaAspect RatioAverage Edge LengthClosest Leafdrawing algorithmsFarthest LeafMaximum Edge LengthSizeTotal Edge LengthUniform Edge Length

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms for drawing binary trees in the plane.
• Graph Drawing
• scientific article; zbMATH DE number 1974131
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• scientific article; zbMATH DE number 1305404

Cited in

(6)

• On the area requirements of planar straight-line orthogonal drawings of ternary trees
• Drawing Ordered (k − 1)–Ary Trees on k–Grids
• Tree Drawings on the Hexagonal Grid
• scientific article; zbMATH DE number 1555968 (Why is no real title available?)
• Représentations arborées des classifications
• A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio

This page was built for publication: Grid Drawings of Binary Trees: An Experimental Study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301433)