Area-efficient algorithms for straight-line tree drawings
From MaRDI portal
Publication:1975960
DOI10.1016/S0925-7721(99)00053-XzbMath0953.68139OpenAlexW1991435149MaRDI QIDQ1975960
Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
Publication date: 29 January 2001
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00053-x
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (12)
Order-preserving, upward drawing of binary trees using fewer bends ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Tree drawings revisited ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ 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 ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES ⋮ Tree Drawings on the Hexagonal Grid ⋮ Unnamed Item ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees ⋮ Optimizing area and aspect ratio in straight-line orthogonal tree drawings
This page was built for publication: Area-efficient algorithms for straight-line tree drawings
