Low Ply Drawings of Trees
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav, Han\v{c}l Jr., Michael Kaufmann, Stephen Kobourov, Antonios Symvonis, Pavel, Valtr

TL;DR
This paper studies low ply graph drawings of trees, showing limitations for constant ply-number and providing polynomial area constructions for trees with degree at most 6 using logarithmic ply-number.
Contribution
It proves exponential area requirements for constant ply-number drawings of trees and introduces polynomial area drawings with logarithmic ply-number for degree-6 trees.
Findings
Constant ply-number drawings may require exponential area.
Such drawings may not exist for bounded-degree trees.
Degree-6 trees admit polynomial area drawings with logarithmic ply-number.
Abstract
We consider the recently introduced model of \emph{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 \emph{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 \emph{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 always admit such drawings in polynomial area.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Topological and Geometric Data Analysis
