Improved Upper and Lower Bounds for LR Drawings of Binary Trees

DOI10.1007/978-3-030-68766-3_6OpenAlexW3134615206MaRDI QIDQ5014106

Timothy M. Chan, Zhengcheng Huang

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.10148

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Area-efficient planar straight-line drawings of outerplanar graphs
• A note on minimum-area upward drawing of complete and Fibonacci trees
• Small area drawings of outerplanar graphs
• A note on optimal area algorithms for upward drawings of binary trees
• Strictly-upward drawings of ordered search trees
• A near-linear area bound for drawing binary trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Area-efficient algorithms for straight-line tree drawings
• LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
• Tree drawings revisited
• Algorithms for drawing binary trees in the plane.
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• Ideal Drawings of Rooted Trees With Approximately Optimal Width
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• Tree Drawings on the Hexagonal Grid
• Universality considerations in VLSI circuits
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA