Vertex angle and crossing angle resolution of leveled tree drawings

https://doi.org/10.1016/j.ipl.2012.05.006Get rights and content

Abstract

We study the problem of computing leveled tree drawings, i.e., straight-line drawings of trees where the vertices have distinct preassigned y-coordinates. Our optimization goal is to maximize the crossing angle resolution (i.e., the minimum angle formed by any two crossing edges) and/or the vertex angle resolution (i.e., the minimum angle formed by two edges incident to the same vertex) of the drawing. We provide tight and almost tight worst case bounds for the crossing angle resolution and for the total angle resolution (i.e., the minimum of crossing and vertex angle resolution), respectively.

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)

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 Computing
  • The stub resolution of 1-planar graphs

    2021, Journal of Graph Algorithms and Applications
  • Angular Resolutions: Around Vertices and Crossings

    2020, Beyond Planar Graphs: Communications of NII Shonan Meetings
  • The 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View all citing articles on Scopus

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.

View full text