Order-preserving, upward drawing of binary trees using fewer bends

DOI10.1016/j.dam.2004.02.011zbMath1057.05028OpenAlexW2019211358MaRDI QIDQ1887067

Sung Kwon Kim

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.02.011

zbMATH Keywords

BendsOrder-preservingTree drawingUpward drawing

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio

Cites Work

• A note on optimal area algorithms for upward drawings of binary trees
• Area-efficient algorithms for straight-line tree drawings
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA