On vertex-degree restricted subgraphs in polyhedral graphs

AbstractFirst a brief survey of known facts is given. Main result of this paper: every polyhedral (i.e. 3-connected planar) graph G with minimum degree at least 4 and order at least k (k⩾4) contains a connected subgraph on k vertices having degrees (in G) at most 4k−1, the bound 4k−1 being best possible

Liftings and stresses for planar periodic frameworks

We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic properties for planar periodic pseudo-triangulations, generalizing features known for their finite counterparts. These properties are then applied to questions originating in mathematical crystallography and materials science, concerning planar periodic auxetic structures and ultrarigid periodic frameworks.Comment: An extended abstract of this paper has appeared in Proc. 30th annual Symposium on Computational Geometry (SOCG'14), Kyoto, Japan, June 201

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to $360^\circ$, and every face of the graph must itself be flat foldable. This characterization leads to a linear-time algorithm for testing flat foldability of plane graphs with prescribed edge lengths and angles, and a polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure

Polynomial continuation in the design of deployable structures

Polynomial continuation, a branch of numerical continuation, has been applied to several primary problems in kinematic geometry. The objective of the research presented in this document was to explore the possible extensions of the application of polynomial continuation, especially in the field of deployable structure design. The power of polynomial continuation as a design tool lies in its ability to find all solutions of a system of polynomial equations (even positive dimensional solution sets). A linkage design problem posed in polynomial form can be made to yield every possible feasible outcome, many of which may never otherwise have been found. Methods of polynomial continuation based design are illustrated here by way of various examples. In particular, the types of deployable structures which form planar rings, or frames, in their deployed configurations are used as design cases. Polynomial continuation is shown to be a powerful component of an equation-based design process. A polyhedral homotopy method, particularly suited to solving problems in kinematics, was synthesised from several researchers’ published continuation techniques, and augmented with modern, freely available mathematical computing algorithms. Special adaptations were made in the areas of level-k subface identification, lifting value balancing, and path-following. Techniques of forming closure/compatibility equations by direct use of symmetry, or by use of transfer matrices to enforce loop closure, were developed as appropriate for each example. The geometry of a plane symmetric (rectangular) 6R foldable frame was examined and classified in terms of Denavit-Hartenberg Parameters. Its design parameters were then grouped into feasible and non-feasible regions, before continuation was used as a design tool; generating the design parameters required to build a foldable frame which meets certain configurational specifications. iv Two further deployable ring/frame classes were then used as design cases: (a) rings which form (planar) regular polygons when deployed, and (b) rings which are doubly plane symmetric and planar when deployed. The governing equations used in the continuation design process are based on symmetry compatibility and transfer matrices respectively. Finally, the 6, 7 and 8-link versions of N-loops were subjected to a witness set analysis, illustrating the way in which continuation can reveal the nature of the mobility of an unknown linkage. Key features of the results are that polynomial continuation was able to provide complete sets of feasible options to a number of practical design problems, and also to reveal the nature of the mobility of a real overconstrained linkage

Beyond developable: computational design and fabrication with auxetic materials

We present a computational method for interactive 3D design and rationalization of surfaces via auxetic materials, i.e., flat flexible material that can stretch uniformly up to a certain extent. A key motivation for studying such material is that one can approximate doubly-curved surfaces (such as the sphere) using only flat pieces, making it attractive for fabrication. We physically realize surfaces by introducing cuts into approximately inextensible material such as sheet metal, plastic, or leather. The cutting pattern is modeled as a regular triangular linkage that yields hexagonal openings of spatially-varying radius when stretched. In the same way that isometry is fundamental to modeling developable surfaces, we leverage conformal geometry to understand auxetic design. In particular, we compute a global conformal map with bounded scale factor to initialize an otherwise intractable non-linear optimization. We demonstrate that this global approach can handle non-trivial topology and non-local dependencies inherent in auxetic material. Design studies and physical prototypes are used to illustrate a wide range of possible applications

Gonality of metric graphs and Catalan-many tropical morphisms to trees

This thesis consists of two points of view to regard degree-(g′+1) tropical morphisms Φ : (Γ,w) → Δ from a genus-(2g′) weighted metric graph (Γ,w) to a metric tree Δ, where g′ is a positive integer. The first point of view, developed in Part I, is purely combinatorial and constructive. It culminates with an application to bound the gonality of (Γ,w). The second point of view, developed in Part II, incorporates category theory to construct a unified framework under which both Φ and higher dimensional analogues can be understood. These higher dimensional analogues appear in the construction of a moduli space Gtrop/g→0,d parametrizing the tropical morphisms Φ, and a moduli spaceMtrop/g parametrizing the (Γ,w). There is a natural projection map Π : Gtrop/g→0,d →Mtrop/g that sends Φ : (Γ,w) → Δ to (Γ,w). The strikingly beautiful result is that when g = 2g′ and d = g′+1, the projection Π itself is an indexed branched cover, thus having the same nature as the maps Φ that are being parametrized. Moreover, fibres of Π have Catalan-many points. Each part has its own introduction that motivates and describes the problem from its own perspective. Part I and its introduction are based on two articles which are joint work with Jan Draisma. Part II contains material intended to be published as two articles. There is also a layman summary available at the beginning

DISTORTION-CONTROLLED ISOTROPIC SWELLING AND SELF-ASSEMBLY OF TRIPLY-PERIODIC MINIMAL SURFACES

In the first part of this thesis, I propose a method that allows us to construct optimal swelling patterns that are compatible with experimental constraints. This is done using a greedy algorithm that systematically increases the perimeter of the target surface with the help of minimum length cuts. This reduces the areal distortion that comes from the changing Gaussian curvature of the sheet. The results of our greedy cutting algorithm are tested on surfaces of constant and varying Gaussian curvature, and are additionally validated with finite thickness simulations using a modified Seung-Nelson model. In the second part of the thesis, we focus on self-assembly methods as an alternate approach to program specific desired structures. More specifically, we develop theoretical design rules for triply-periodic minimal surfaces (TPMS) and show how their symmetry properties can be used to program a minimum number triangular particle-types that successfully coalesce into the TPMS shape. We finally simulate our design rules with Monte Carlo methods and study the robustness of the self-assembled structures upon changing different system parameters like elastic moduli