Low Ply Drawings of Trees

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 $6$ always admit such drawings in polynomial area.Comment: This is a complete access version of a paper that will appear in the proceedings of GD201

An Interactive Tool to Explore and Improve the Ply Number of Drawings

Given a straight-line drawing $\Gamma$ of a graph $G=(V,E)$, for every vertex $v$ the ply disk $D_v$ 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 $\mathbb{R}^2$. Here we present a tool to explore and evaluate the ply number for graphs with instant visual feedback for the user. We evaluate our methods in comparison to an existing ply computation by De Luca et al. [WALCOM'17]. We are able to reduce the computation time from seconds to milliseconds for given drawings and thereby contribute to further research on the ply topic by providing an efficient tool to examine graphs extensively by user interaction as well as some automatic features to reduce the ply number.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

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 to relate the concept of ply to proximity drawings. In fact, if we interpret the set of disks as proximity regions, a drawing with vertex-ply number 1 can be seen as a weak proximity drawing, which we call empty-ply drawing. We show non-trivial relationships between the ply number and the vertex-ply number. Then, we focus on empty-ply drawings, proving some properties and studying what classes of graphs admit such drawings. Finally, we prove a lower bound on the ply and the vertex-ply of planar drawings.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Composite passive damping struts for large precision structures

In the field of viscoelastic dampers, a new strut design comprises a viscoelastic material sandwiched between multiple layers, some of which layers bear and dampen load force. In one embodiment, the layers are composite plies of opposing orientation. In another embodiment, the strut utilizes a viscoelastic layer sandwiched between V-shaped composite plies. In a third embodiment, a viscoelastic layer is sandwiched between sine-shaped plies. Strut strength is equal to or greater than conventional aluminum struts due to the unique high interlaminar shear ply design

Impact tolerant material

A material is protected from acoustic shock waves generated by impacting projectiles by means of a backing. The backing has an acoustic impedance that efficiently couples the acoustic energy out of the material

Composite sandwich lattice structure

A lattice type structural panel is described. The panel utilizes the unidirectional character of filamentary epoxy impregnated composites. The panels are stiff lightweight structures for use in constructing space satellites and the like

Recognizing Weighted Disk Contact Graphs

Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a vertex-weighted planar graph can be realized such that the disks' radii coincide with the vertex weights is known to be NP-hard. In this work, we reduce the gap between hardness and tractability by analyzing the problem for special graph classes. We show that it remains NP-hard for outerplanar graphs with unit weights and for stars with arbitrary weights, strengthening the previous hardness results. On the positive side, we present constructive linear-time recognition algorithms for caterpillars with unit weights and for embedded stars with arbitrary weights.Comment: 24 pages, 21 figures, extended version of a paper to appear at the International Symposium on Graph Drawing and Network Visualization (GD) 201

Reduction of Spin Glasses applied to the Migdal-Kadanoff Hierarchical Lattice

A reduction procedure to obtain ground states of spin glasses on sparse graphs is developed and tested on the hierarchical lattice associated with the Migdal-Kadanoff approximation for low-dimensional lattices. While more generally applicable, these rules here lead to a complete reduction of the lattice. The stiffness exponent governing the scaling of the defect energy $\Delta E$ with system size $L$, $\sigma(\Delta E)\sim L^y$, is obtained as $y_3=0.25546(3)$ by reducing the equivalent of lattices up to $L=2^{100}$ in $d=3$, and as $y_4=0.76382(4)$ for up to $L=2^{35}$ in $d=4$. The reduction rules allow the exact determination of the ground state energy, entropy, and also provide an approximation to the overlap distribution. With these methods, some well-know and some new features of diluted hierarchical lattices are calculated.Comment: 7 pages, RevTex, 6 figures (postscript), added results for d=4, some corrections; final version, as to appear in EPJ