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

From MaRDI portal
Publication:1208428

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




Related Items

Upward Planar Drawings with Three and More SlopesPossible and Impossible Attempts to Solve the Treewidth Problem via ILPsLogarithmic width, linear area upward drawing of AVL treesProximity drawings in polynomial area and volumeOn the approximability of two tree drawing conventionsOrder-preserving, upward drawing of binary trees using fewer bendsDrawing Halin-graphs with small heightA Lower Bound on the Area Requirements of Series-Parallel GraphsPROXIMITY DRAWINGS OF HIGH-DEGREE TREESUpward planar drawings with three and more slopesArea requirement of graph drawings with few crossings per edgeUpward planar drawings with two slopesThe realization problem for Euclidean minimum spanning trees is NP-hardLinear area upward drawings of AVL treesA note on parallel algorithms for optimal h-v drawings of binary treesPinning Balloons with Perfect Angles and Optimal AreaTree drawings revisitedArea-efficient algorithms for upward straight-line tree drawingsDrawing trees in a streaming modelON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHSStraight-line drawings of outerplanar graphs in \(O(dn \log n)\) areaIdeal Drawings of Rooted Trees With Approximately Optimal WidthOn the area requirements of planar straight-line orthogonal drawings of ternary treesGrid-Obstacle Representations with Connections to Staircase GuardingPole dancing: 3D morphs for tree drawingsDrawing a rooted tree as a rooted \(y\)-monotone minimum spanning treeA straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratioMaximum upward planar subgraphs of embedded planar digraphsThree-dimensional graph drawingAREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREESA note on minimum-area upward drawing of complete and Fibonacci treesLR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphsHow to fit a tree in a boxTree Drawings on the Hexagonal GridHow to fit a tree in a boxOrder-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)Unnamed ItemMinimum-width grid drawings of plane graphsGrid straight-line embeddings of trees with a minimum number of bends per pathHorton-Strahler number, rooted pathwidth and upward drawings of treesStrictly-upward drawings of ordered search treesPole Dancing: 3D Morphs for Tree DrawingsAdvances in the theory and practice of graph drawingHow to draw a clustered treeImproved Upper and Lower Bounds for LR Drawings of Binary TreesOptimizing area and aspect ratio in straight-line orthogonal tree drawings



Cites Work