A near-linear area bound for drawing binary trees
From MaRDI portal
Recommendations
Cited in
(28)- Small area drawings of outerplanar graphs
- How to draw a clustered tree
- A note on optimal area algorithms for upward drawings of binary trees
- Order-preserving, upward drawing of binary trees using fewer bends
- Horton-Strahler number, rooted pathwidth and upward drawings of trees
- Optimal-area visibility representations of outer-1-plane graphs
- Tree drawings revisited
- On the edge-length ratio of planar graphs
- Algorithms for drawing binary trees in the plane.
- On the approximability of two tree drawing conventions
- Ideal drawings of rooted trees with approximately optimal width
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Nearly optimal monotone drawing of trees
- Proximity drawings of high-degree trees
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Drawing a tree as a minimum spanning tree approximation
- scientific article; zbMATH DE number 1305404 (Why is no real title available?)
- Straight-line drawings of binary trees with linear area and arbitrary aspect ratio
- A linear algorithm for compact box-drawings of trees
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Tree drawings revisited
- Graph Drawing
- How to fit a tree in a box
- Polynomial area bounds for MST embeddings of trees
- Internally-convex drawings of outerplanar graphs in small area
- Area-efficient planar straight-line drawings of outerplanar graphs
- A note on minimum-area upward drawing of complete and Fibonacci trees
This page was built for publication: A near-linear area bound for drawing binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849677)
