Grid Drawings of Binary Trees: An Experimental Study
From MaRDI portal
Publication:5301433
DOI10.7155/JGAA.00163zbMATH Open1161.68697OpenAlexW2132266009MaRDI QIDQ5301433FDOQ5301433
Confesor Santiago, Adrian Rusu
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2008/RusuSantiago2008.12.2.pdf
Recommendations
Sizedrawing algorithmsAreaAngular ResolutionAspect RatioAverage Edge LengthClosest LeafFarthest LeafMaximum Edge LengthTotal Edge LengthUniform Edge Length
Cited In (6)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Tree Drawings on the Hexagonal Grid
- Drawing Ordered (k − 1)–Ary Trees on k–Grids
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- Title not available (Why is that?)
- Représentations arborées des classifications
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)