Algorithms for drawing binary trees in the plane.

DOI10.1016/S0020-0190(98)00049-0MaRDI QIDQ2583549zbMATH OpenOpenAlexFDO

Authors Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa, Sung-Ho Kim

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00049-0

zbMATH Keywords

Computational geometryGraph drawingTree drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 1305404
• scientific article; zbMATH DE number 1974131
• A near-linear area bound for drawing binary trees
• Area-efficient algorithms for straight-line tree drawings

Cites work

• Algorithms for drawing graphs: An annotated bibliography
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Universality considerations in VLSI circuits

Cited in

(14)

• Depth-first layout algorithm for trees.
• Tree drawings revisited
• Tree drawings revisited
• scientific article; zbMATH DE number 2104082 (Why is no real title available?)
• Graph Drawing
• Improved Upper and Lower Bounds for LR Drawings of Binary Trees
• Offline drawing of dynamic trees: algorithmics and document integration
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Grid Drawings of Binary Trees: An Experimental Study
• Représentations arborées des classifications
• Drawing trees and animating tree changes
• Drawing complete binary trees inside rectilinear polygons
• How to draw free trees inside bounded rectilinear polygons
• A linear algorithm for compact box-drawings of trees

This page was built for publication: Algorithms for drawing binary trees in the plane.

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