Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
From MaRDI portal
Publication:3378489
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
Cited in
(19)- Tree drawings revisited
- Drawing trees in a streaming model
- Area-efficient order-preserving planar straight-line drawings of ordered trees
- How to fit a tree in a box
- Small area drawings of outerplanar graphs
- Tree Drawings on the Hexagonal Grid
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- How to fit a tree in a box
- A near-linear area bound for drawing binary trees
- Grid Drawings of Binary Trees: An Experimental Study
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- How to draw a clustered tree
- scientific article; zbMATH DE number 1974131 (Why is no real title available?)
- Graph Drawing
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Drawing Trees with Perfect Angular Resolution and Polynomial Area
- Proximity drawings of high-degree trees
- Drawing trees with perfect angular resolution and polynomial area
- Tree drawings revisited
This page was built for publication: Straight-line Drawings of Binary Trees 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 Q3378489)
