Straight-Line Orthogonal Drawings of Binary and Ternary Trees

DOI10.1007/978-3-540-77537-9_11zbMath1137.68487OpenAlexW1575812768MaRDI QIDQ5452213

Fabrizio Frati

Publication date: 25 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Pinning Balloons with Perfect Angles and Optimal Area, Tree drawings revisited, On the area requirements of planar straight-line orthogonal drawings of ternary trees, A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio, Tree Drawings on the Hexagonal Grid, Unnamed Item, Improved Upper and Lower Bounds for LR Drawings of Binary Trees