Search for: All records

A 2D rigidity circuit is a minimal graph G = (V , E) supporting a non-trivial stress in any generic placement of its vertices in the Euclidean plane. All 2D rigidity circuits can be constructed from K4 graphs using combinatorial resultant (CR) operations. A combinatorial resultant tree (CR-tree) is a rooted binary tree capturing the structure of such a construction. The CR operation has a specific algebraic interpretation, where an essentially unique circuit polynomial is associated to each circuit graph. Performing Sylvester resultant operations on these polynomials is in one-to-one correspondence with CR operations on circuit graphs. This mixed combinatorial/algebraic approach led recently to an effective algorithm for computing circuit polynomials. Its complexity analysis remains an open problem, but it is known to be influenced by the depth and shape of CR-trees in ways that have only partially been investigated. In this paper, we present an effective algorithm for enumerating all the CR-trees of a given circuit with n vertices. Our algorithm has been fully implemented in Mathematica and allows for computational experimentation with various optimality criteria in the resulting, potentially exponentially large collections of CR-trees. 

We present an educational web app for interactively drawing and editing 2D periodic graphs. The user defines the unit cell and the finite set of vertex and edge representatives, from which a sufficiently large fragment of the periodic graph is created for the visualization. The periodic graph can also be modified by applying several transformations, including isometries and relaxations of the unit cell. A finite representation of the infinite periodic graph can be saved in an external file as a quotient graph with Z²-marked edges. Its geometry is recorded using fractional (crystallographic) coordinates. The facial structure of non-crossing periodic graphs can be revealed by the user interactively selecting face representatives. An accompanying video demonstrates the functionality of the web application. 

The auxetic structures considered in this paper are three-dimensional periodic bar-and-joint frameworks. We start with the specific purpose of obtaining an auxetic design with underlying periodic graph of low valency. Adapting a general methodology, we produce an initial framework with valency seven and one degree of freedom. Then, we describe a saturation process, whereby edge orbits are added up to valency 16, with no alteration of the deformation path. This is reflected in a large dimension for the space of periodic self-stresses. The saturated version has higher crystallographic symmetry and allows a precise description of the deformation trajectory. Reducing saturation by adequate removal of edge orbits results in vast numbers of distinct auxetic designs which obey the same kinematics.