PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
From MaRDI portal
Publication:5687653
DOI10.1142/S0218195996000228zbMath0865.68125MaRDI QIDQ5687653
Ashim Garg, Roberto Tamassia, Michael T. Goodrich
Publication date: 30 June 1997
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Area requirement of visibility representations of trees, On the approximability of two tree drawing conventions, Order-preserving, upward drawing of binary trees using fewer bends, Drawing Halin-graphs with small height, The realization problem for Euclidean minimum spanning trees is NP-hard, Tree drawings revisited, Drawing trees with perfect angular resolution and polynomial area, On-line convex planarity testing, 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, Tree Drawings on the Hexagonal Grid, How to fit a tree in a box, Unnamed Item, 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
