Abstract
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2π/d(v). We show: 1 Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and polynomial area. 2 There are ordered trees that require exponential area for any crossing-free straight-line drawing having perfect angular resolution. 3 Any ordered tree has a crossing-free Lombardi-style drawing (where each edge is represented by a circular arc) with perfect angular resolution and polynomial area. Thus, our results explore what is achievable with straight-line drawings and what more is achievable with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Nöllenburg, M. (2011). Drawing trees with perfect angular resolution and polynomial area. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 183–194). https://doi.org/10.1007/978-3-642-18469-7_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
