A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
DOI10.1016/J.COMGEO.2014.10.001zbMATH Open1305.05162OpenAlexW2051323042MaRDI QIDQ482353FDOQ482353
Authors: 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
Recommendations
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Area-efficient order-preserving planar straight-line drawings of ordered trees
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Graph Drawing
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
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
- Universality considerations in VLSI circuits
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Straight-Line Orthogonal Drawings of Binary and Ternary Trees
- Order-preserving, upward drawing of binary trees using fewer bends
- Area-efficient algorithms for straight-line tree drawings
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Grid Drawings of Binary Trees: An Experimental Study
Cited In (2)
This page was built for publication: A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482353)
