Tree Drawings on the Hexagonal Grid

DOI10.1007/978-3-642-00219-9_36zbMath1213.68426OpenAlexW1524009077MaRDI QIDQ3611873

Christian Bachmaier, Andreas Hofmeier, Wolfgang Brunner, Marco Matzeder, Thomas Unfried, Franz-Josef Brandenburg

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_36

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Upward Planar Drawings with Three and More Slopes, Upward planar drawings with three and more slopes, Upward planar drawings with two slopes, Pinning Balloons with Perfect Angles and Optimal Area, Tree drawings revisited, Unnamed Item, Improved Upper and Lower Bounds for LR Drawings of Binary Trees

Cites Work

• The complexity of minimizing wire lengths in VLSI layouts
• A note on optimal area algorithms for upward drawings of binary trees
• Optimizing area and aspect ratio in straight-line orthogonal tree drawings
• Area-efficient algorithms for straight-line tree drawings
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• Universality considerations in VLSI circuits
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item