Straight-Line Orthogonal Drawings of Binary and Ternary Trees
DOI10.1007/978-3-540-77537-9_11zbMATH Open1137.68487OpenAlexW1575812768MaRDI QIDQ5452213FDOQ5452213
Authors: 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
Recommendations
- On the area requirements of straight-line orthogonal drawings of ternary trees
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Area-efficient algorithms for straight-line tree drawings
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Tree drawings revisited
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (11)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- Vertex angle and crossing angle resolution of leveled tree drawings
- Tree Drawings on the Hexagonal Grid
- On the area requirements of straight-line orthogonal drawings of ternary trees
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio
- Title not available (Why is that?)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees
- Drawing complete binary trees inside rectilinear polygons
- Pinning balloons with perfect angles and optimal area
- Tree drawings revisited
- Tree drawings revisited
This page was built for publication: Straight-Line Orthogonal Drawings of Binary and Ternary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452213)
