AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES

DOI10.1142/S021819590300130XzbMath1062.68089OpenAlexW2137862244MaRDI QIDQ4661881

Adrian Rusu, Ashim Garg

Publication date: 30 March 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590300130x

zbMATH Keywords

binary trees

Mathematics Subject Classification ID

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

Related Items (12)

Drawing Halin-graphs with small height ⋮ Tree drawings revisited ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS ⋮ Ideal Drawings of Rooted Trees With Approximately Optimal Width ⋮ Polynomial area bounds for MST embeddings of trees ⋮ A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Unnamed Item ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees

Cites Work

• A note on minimum-area upward drawing of complete and Fibonacci trees
• A note on optimal area algorithms for upward drawings of binary trees
• Strictly-upward drawings of ordered search trees
• A near-linear area bound for drawing binary trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Area-efficient algorithms for straight-line tree drawings
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA

This page was built for publication: AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES