Angle and Distance Constraints on Tree Drawings

DOI10.1007/978-3-540-70904-6_7zbMATH Open1185.68462OpenAlexW2155687955MaRDI QIDQ3595467FDOQ3595467

Authors: Ulrik Brandes, Barbara Schlieper 

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_7

Recommendations

• Trees with Convex Faces and Optimal Angles
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Algorithms and Computation
• Drawing trees with perfect angular resolution and polynomial area
• Minimum-width drawings of phylogenetic trees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (9)

• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
• Trees with Convex Faces and Optimal Angles
• Vertex angle and crossing angle resolution of leveled tree drawings
• Planar straight-line realizations of 2-trees with prescribed edge lengths
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Drawing trees with perfect angular resolution and polynomial area
• Algorithms and Computation
• Force-directed Lombardi-style graph drawing
• A \(75\degree\) angle constraint for plane minimal T1 trees

This page was built for publication: Angle and Distance Constraints on Tree Drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595467)