Straight-Line Orthogonal Drawings of Binary and Ternary Trees
From MaRDI portal
Publication:5452213
Recommendations
- On the area requirements of straight-line orthogonal drawings of ternary trees
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Area-efficient algorithms for straight-line tree drawings
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Tree drawings revisited
Cited in
(11)- Tree drawings revisited
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Vertex angle and crossing angle resolution of leveled tree drawings
- Tree Drawings on the Hexagonal Grid
- On the area requirements of straight-line orthogonal drawings of ternary trees
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- scientific article; zbMATH DE number 1974131 (Why is no real title available?)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Drawing complete binary trees inside rectilinear polygons
- Pinning balloons with perfect angles and optimal area
- Tree drawings revisited
This page was built for publication: Straight-Line Orthogonal Drawings of Binary and Ternary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452213)