Low Ply Drawings of Trees
نویسندگان
چکیده
We consider the recently introduced model of low ply graph drawing, a straight-line 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 is the disk centered at it whose radius is half the length of its longest incident edge. We focus our attention on low-ply drawings of trees. We first consider drawings with constant ply; we prove that they may require exponential area, even for stars, and that they may not even exist for trees with bounded degree. Hence, we turn our attention to logarithmic-ply drawings and show that trees with maximum degree 6 always admit this type of drawings in polynomial area.
منابع مشابه
On Vertex- and Empty-Ply Proximity Drawings
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equal to half the length of the longest edge incident to the vertex. The vertex-ply of a drawing is determined by the vertex covered by the maximum number of disks. The main motivation for considering this relaxation is ...
متن کاملAn Experimental Study on the Ply Number of Straight-Line Drawings
The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study tha...
متن کاملAn Interactive Tool to Explore and Improve the Ply Number of Drawings
Given a straight-line drawing Γ of a graph G = (V,E), for every vertex v the ply disk Dv is defined as a disk centered at v where the radius of the disk is half the length of the longest edge incident to v. The ply number of a given drawing is defined as the maximum number of overlapping disks at some point in IR. Here we present a tool to explore and evaluate the ply number for graphs with ins...
متن کاملTree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that co...
متن کاملArea-eecient Upward Tree Drawings
Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
متن کامل