Algorithms for drawing binary trees in the plane.

DOI10.1016/S0020-0190(98)00049-0zbMATH Open1078.68810OpenAlexW2077377041MaRDI QIDQ2583549FDOQ2583549

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

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

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)

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)

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

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)