A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio

DOI10.1016/j.comgeo.2014.10.001zbMath1305.05162OpenAlexW2051323042MaRDI QIDQ482353

Adrian Rusu, Andrew J. Fabian

Publication date: 23 December 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.10.001

zbMATH Keywords

areabinary treeorder-preservingaspect ratioplanar straight-line grid drawing

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• A note on optimal area algorithms for upward drawings of binary trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Order-preserving, upward drawing of binary trees using fewer bends
• Area-efficient algorithms for straight-line tree drawings
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• Universality considerations in VLSI circuits
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Grid Drawings of Binary Trees: An Experimental Study
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA