A note on optimal area algorithms for upward drawings of binary trees

DOI10.1016/0925-7721(92)90021-JzbMath0768.68131OpenAlexW1971486096WikidataQ126819213 ScholiaQ126819213MaRDI QIDQ1208428

Giuseppe Di Battista, Pierluigi Crescenzi, Adolfo Piperno

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90021-j

zbMATH Keywords

binary trees area requirement grid drawings Fibonacci trees upward drawing

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Upward Planar Drawings with Three and More Slopes ⋮ Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs ⋮ Logarithmic width, linear area upward drawing of AVL trees ⋮ Proximity drawings in polynomial area and volume ⋮ On the approximability of two tree drawing conventions ⋮ Order-preserving, upward drawing of binary trees using fewer bends ⋮ Drawing Halin-graphs with small height ⋮ A Lower Bound on the Area Requirements of Series-Parallel Graphs ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Upward planar drawings with three and more slopes ⋮ Area requirement of graph drawings with few crossings per edge ⋮ Upward planar drawings with two slopes ⋮ The realization problem for Euclidean minimum spanning trees is NP-hard ⋮ Linear area upward drawings of AVL trees ⋮ A note on parallel algorithms for optimal h-v drawings of binary trees ⋮ Pinning Balloons with Perfect Angles and Optimal Area ⋮ Tree drawings revisited ⋮ Area-efficient algorithms for upward straight-line tree drawings ⋮ Drawing trees in a streaming model ⋮ ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS ⋮ Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area ⋮ Ideal Drawings of Rooted Trees With Approximately Optimal Width ⋮ On the area requirements of planar straight-line orthogonal drawings of ternary trees ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ Pole dancing: 3D morphs for tree drawings ⋮ Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree ⋮ A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Three-dimensional graph drawing ⋮ AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES ⋮ A note on minimum-area upward drawing of complete and Fibonacci trees ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ How to fit a tree in a box ⋮ Tree Drawings on the Hexagonal Grid ⋮ How to fit a tree in a box ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Unnamed Item ⋮ Minimum-width grid drawings of plane graphs ⋮ Grid straight-line embeddings of trees with a minimum number of bends per path ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees ⋮ Strictly-upward drawings of ordered search trees ⋮ Pole Dancing: 3D Morphs for Tree Drawings ⋮ Advances in the theory and practice of graph drawing ⋮ How to draw a clustered tree ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees ⋮ Optimizing area and aspect ratio in straight-line orthogonal tree drawings

Cites Work