The following pages link to Tree drawings revisited (Q2189731):
Displaying 26 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- A note on minimum-area upward drawing of complete and Fibonacci trees (Q970209) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- On the area requirements of straight-line orthogonal drawings of ternary trees (Q1670991) (← links)
- A near-linear area bound for drawing binary trees (Q1849677) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Order-preserving, upward drawing of binary trees using fewer bends (Q1887067) (← links)
- Area-efficient algorithms for straight-line tree drawings (Q1975960) (← links)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees (Q2220843) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- Rooted tree maps (Q2332003) (← links)
- Low Ply Drawings of Trees (Q2961519) (← links)
- Tree Drawings on the Hexagonal Grid (Q3611873) (← links)
- And/Or Trees Revisited (Q4670353) (← links)
- Renorming James tree space (Q4679393) (← links)
- Drawing Unordered Trees on k-Grids (Q4910555) (← links)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees (Q5014106) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- Tree drawings revisited (Q5115791) (← links)
- Functional Pearls (Q5687913) (← links)
- Visualizing evolving trees (Q6172206) (← links)
