Trees with Convex Faces and Optimal Angles
From MaRDI portal
Publication:3595489
DOI10.1007/978-3-540-70904-6_9zbMath1185.68464OpenAlexW1639382724WikidataQ56001825 ScholiaQ56001825MaRDI QIDQ3595489
David Eppstein, Josiah Carlson
Publication date: 28 August 2007
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_9
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On Turn-Regular Orthogonal Representations ⋮ Bounds on the complexity of halfspace intersections when the bounded faces have small dimension ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ On the Hardness of Orthogonal-Order Preserving Graph Drawing ⋮ On Turn-Regular Orthogonal Representations