Straight-line drawings of binary trees with linear area and arbitrary aspect ratio
From MaRDI portal
Recommendations
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Graph Drawing
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- Straight-Line Orthogonal Drawings of Binary and Ternary Trees
- Area-efficient algorithms for straight-line tree drawings
- On the area requirements of straight-line orthogonal drawings of ternary trees
- scientific article; zbMATH DE number 1305404
- A near-linear area bound for drawing binary trees
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
Cited in
(14)- A near-linear area bound for drawing binary trees
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Drawing trees with perfect angular resolution and polynomial area
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Algorithms for drawing binary trees in the plane.
- Area requirement of visibility representations of trees
- Drawing complete binary trees inside rectilinear polygons
- Drawing Trees with Perfect Angular Resolution and Polynomial Area
- Area-efficient order-preserving planar straight-line drawings of ordered trees
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- scientific article; zbMATH DE number 1305404 (Why is no real title available?)
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Graph Drawing
- Grid Drawings of Binary Trees: An Experimental Study
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 Q4422292)