@inproceedings{959326d21720430fa17ae73754894e47,

title = "Low ply drawings of trees",

abstract = "We consider the recently introduced model of low ply graph drawing, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The ply-disk of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the ply-number of the drawing. We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, even for stars, and that they may not even exist for bounded-degree trees. Then, we turn our attention to drawings with logarithmic ply-number and show that trees with maximum degree 6 always admit such drawings in polynomial area.",

author = "Patrizio Angelini and Bekos, {Michael A.} and Till Bruckdorfer and Jaroslav Han{\v c}l and Michael Kaufmann and Stephen Kobourov and Antonios Symvonis and Pavel Valtr",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 24th International Symposium on Graph Drawing and Network Visualization, GD 2016 ; Conference date: 19-09-2016 Through 21-09-2016",

year = "2016",

doi = "10.1007/978-3-319-50106-2_19",

language = "English (US)",

isbn = "9783319501055",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "236--248",

editor = "Martin Nollenburg and Yifan Hu",

booktitle = "Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Revised Selected Papers",

}