Vertex angle and crossing angle resolution of leveled tree drawings☆
Highlights
► We study the angular resolution of leveled tree drawings. ► The minimum crossing angle can always be almost a right angle. ► The total angular resolution decreases with the maximum degree.
References (18)
- et al.
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
(2012) - et al.
A characterization of complete bipartite RAC graphs
Information Processing Letters
(2010) - et al.
Drawing graphs with right angle crossings
Theoretical Computer Science
(2011) - et al.
Characterization of unlabeled level planar trees
Computational Geometry
(2009) - et al.
On the size of graphs that admit polyline drawings with few bends and crossing angles
- et al.
On the perspectives opened by right angle crossing drawings
Journal of Graph Algorithms and Applications
(2011) - et al.
Maximizing the total resolution of graphs
- et al.
The straight-line RAC drawing problem is NP-hard
- et al.
Graphs that admit right angle crossing drawings
There are more references available in the full text version of this article.
Cited by (8)
Larger crossing angles make graphs easier to read
2014, Journal of Visual Languages and ComputingThe stub resolution of 1-planar graphs
2021, Journal of Graph Algorithms and ApplicationsAngular Resolutions: Around Vertices and Crossings
2020, Beyond Planar Graphs: Communications of NII Shonan MeetingsThe stub resolution of 1-planar graphs
2020, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)The QuaSEFE problem
2019, arXivThe QuaSEFE Problem
2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
Work supported in part by MIUR of Italy under project AlgoDEEP prot. 2008TFBWL4. The research in this work started at the Dagstuhl Seminar 10461 — “Schematization in Cartography, Visualization, and Computational Geometry”, November 2010.
Copyright © 2012 Elsevier B.V. All rights reserved.