Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ipl.2012.05.006 | Inf. Process. Lett. |
Keywords | Field | DocType |
worst case bound,minimum angle,distinct preassigned y-coordinates,edges incident,total angle resolution,tree drawing,vertex angle resolution,optimization goal,straight-line drawing,angle resolution,graph drawing | Graph drawing,Combinatorics,Vertex (geometry),Vertex angle,Internal and external angle,Inscribed angle,Angle of parallelism,Geometry,Mathematics | Journal |
Volume | Issue | ISSN |
112 | 16 | 0020-0190 |
Citations | PageRank | References |
3 | 0.45 | 17 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Walter Didimo | 1 | 943 | 76.56 |
| Michael Kaufmann | 2 | 1224 | 107.33 |
| Giuseppe Liotta | 3 | 341 | 30.83 |
| Yoshio Okamoto | 4 | 170 | 28.50 |
| Andreas Spillner | 5 | 207 | 49.13 |