A near-linear area bound for drawing binary trees

DOI10.1007/s00453-002-0937-xzbMath1041.68124MaRDI QIDQ1849677

Yanyan Li

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0937-x

zbMATH Keywords

Trees; Graph drawing

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

Related Items

AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES, Unnamed Item, Improved Upper and Lower Bounds for LR Drawings of Binary Trees, How to fit a tree in a box, Drawing a tree as a minimum spanning tree approximation, Polynomial area bounds for MST embeddings of trees, Area-efficient planar straight-line drawings of outerplanar graphs, Small area drawings of outerplanar graphs, How to draw a clustered tree, LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs, 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, Ideal Drawings of Rooted Trees With Approximately Optimal Width, PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS