Low ply drawings of trees

Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hančl, Michael Kaufmann, Stephen Kobourov, Antonios Symvonis, Pavel Valtr

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationGraph Drawing and Network Visualization - 24th International Symposium, GD 2016, Revised Selected Papers
EditorsMartin Nollenburg, Yifan Hu
Number of pages13
ISBN (Print)9783319501055
StatePublished - 2016
Event24th International Symposium on Graph Drawing and Network Visualization, GD 2016 - Athens, Greece
Duration: Sep 19 2016Sep 21 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9801 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other24th International Symposium on Graph Drawing and Network Visualization, GD 2016

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Low ply drawings of trees'. Together they form a unique fingerprint.

Cite this