PROXIMITY DRAWINGS OF HIGH-DEGREE TREES
From MaRDI portal
Publication:3459369
DOI10.1142/S0218195913500088zbMath1327.68317arXiv1008.3193OpenAlexW1796837214WikidataQ62042437 ScholiaQ62042437MaRDI QIDQ3459369
David R. Wood, Ferran Hurtado, Giuseppe Liotta
Publication date: 22 December 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.3193
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Logarithmic width, linear area upward drawing of AVL trees
- Witness (Delaunay) graphs
- On graph thickness, geometric thickness, and separator theorems
- Polynomial area bounds for MST embeddings of trees
- The strength of weak proximity
- A note on minimum-area upward drawing of complete and Fibonacci trees
- The relative neighbourhood graph of a finite planar set
- Transitions in geometric minimum spanning trees
- A note on optimal area algorithms for upward drawings of binary trees
- Drawing trees symmetrically in three dimensions
- A near-linear area bound for drawing binary trees
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings
- Voronoi drawings of trees
- Proximity drawings in polynomial area and volume
- Order-preserving, upward drawing of binary trees using fewer bends
- Minimal graphs that fold onto \(K_ n\)
- The realization problem for Euclidean minimum spanning trees is NP-hard
- Characterizing proximity trees
- On representations of some thickness-two graphs
- Area-efficient algorithms for straight-line tree drawings
- Graph treewidth and geometric thickness parameters
- Drawings of planar graphs with few slopes and segments
- Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
- Absolutely 3-chromatic graphs
- Geometric Thickness of Complete Graphs
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
