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

DOI10.1016/J.DAM.2004.02.011MaRDI QIDQ1887067zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A near-linear area bound for drawing binary trees
• scientific article; zbMATH DE number 1305404
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Tree drawings revisited
• A note on optimal area algorithms for upward drawings of binary trees

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

Cited in

(3)

• Strictly-upward drawings of ordered search trees
• A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
• Proximity drawings of high-degree trees

This page was built for publication: Order-preserving, upward drawing of binary trees using fewer bends

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887067)