pith. sign in

arxiv: 1009.0581 · v2 · pith:CAR6JPL6new · submitted 2010-09-03 · 💻 cs.CG

Drawing Trees with Perfect Angular Resolution and Polynomial Area

classification 💻 cs.CG
keywords angularperfectresolutiondrawingareatreescrossing-freedrawings
0
0 comments X
read the original abstract

We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2{\pi}/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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.