Tree drawings revisited
From MaRDI portal
Publication:5115791
Recommendations
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- A near-linear area bound for drawing binary trees
- A note on minimum-area upward drawing of complete and Fibonacci trees
- A note on optimal area algorithms for upward drawings of binary trees
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
- Algorithms for drawing binary trees in the plane.
- Applications of approximation algorithms to cooperative games
- Approximating extent measures of points.
- Area-efficient algorithms for straight-line tree drawings
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- How to draw a planar graph on a grid
- Ideal drawings of rooted trees with approximately optimal width
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
- Range searching with efficient hierarchical cuttings
- Straight-Line Orthogonal Drawings of Binary and Ternary Trees
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Strictly-upward drawings of ordered search trees
- Tree Drawings on the Hexagonal Grid
- Universality considerations in VLSI circuits
Cited in
(22)- Pole dancing: 3D morphs for tree drawings
- Area-efficient algorithms for upward straight-line tree drawings
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Rooted tree maps
- Visualizing evolving trees
- Functional Pearls
- On upward drawings of trees on a given grid
- Pole dancing: 3D morphs for tree drawings
- How to fit a tree in a box
- Drawing unordered trees on \(k\)-grids
- Low Ply Drawings of Trees
- Tree Drawings on the Hexagonal Grid
- Voronoi drawings of trees
- Renorming James tree space
- On the area requirements of straight-line orthogonal drawings of ternary trees
- How to fit a tree in a box
- Order-preserving drawings of trees with approximately optimal height (and small width)
- How to draw a clustered tree
- Drawing unordered trees on \(k\)-grids
- A note on minimum-area upward drawing of complete and Fibonacci trees
- Tree drawings revisited
- And/Or Trees Revisited
This page was built for publication: Tree drawings revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115791)
