Flavors of Rigidity Flavor III - Universal Rigidity and Tensegrities

Similar documents
The basics of rigidity

Tensegrities and Global Rigidity

DRAFT: Analysis of Skew Tensegrity Prisms

Straight Line motion with rigid sets

61 RIGIDITY AND SCENE ANALYSIS

Cluster algebras and infinite associahedra

INFINITESIMALLY RIGID POLYHEDRA. I. STATICS OF FRAMEWORKS

GEOMETRY OF POINT-HYPERPLANE AND SPHERICAL FRAMEWORKS

Applications of combinatorial optimization in statics (rigidity of frameworks)

On the Generic Rigidity of Bar-Frameworks

INFINITESIMALLY RIGID POLYHEDRA. II: MODIFIED SPHERICAL FRAMEWORKS

Merging Globally Rigid Formations of Mobile Autonomous Agents

Automorphism Groups of Cyclic Polytopes

Directed Graphs, Decompositions, and Spatial Linkages

MECHANICS OF TENSEGRITY PRISMS

Geometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1.

Realizing Planar Graphs as Convex Polytopes. Günter Rote Freie Universität Berlin

Heat Kernels and Diffusion Processes

Symmetry Adapted Assur Decompositions

Tutte s Theorem: How to draw a graph

The simplex method and the diameter of a 0-1 polytope

Equipartite polytopes and graphs

Rigidity, connectivity and graph decompositions

Rigidity of ball-polyhedra via truncated Voronoi and Delaunay complexes

PERFECT FOLDING OF THE PLANE

A Study of the Rigidity of Regular Polytopes

Tensegrity Frameworks in the One-Dimensional Space. 1 Abstract. 2 Introduction. András RECSKI and Oer SHAI. October 31, 2007

Glossary of dictionary terms in the AP geometry units

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( )

Universal Rigidity of Generic Frameworks. Steven Gortler joint with Dylan Thurston

Convexity: an introduction

Lecture 3: Art Gallery Problems and Polygon Triangulation

Subspace Clustering with Global Dimension Minimization And Application to Motion Segmentation

Course Introduction / Review of Fundamentals of Graph Theory

Equipartite polytopes and graphs

Graph Theory II. Po-Shen Loh. June edges each. Solution: Spread the n vertices around a circle. Take parallel classes.

A THREE AND FIVE COLOR THEOREM

arxiv: v2 [math.co] 13 Aug 2013

Which n-venn diagrams can be drawn with convex k-gons?

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs

6.2 Classification of Closed Surfaces

Unit Activity Correlations to Common Core State Standards. Geometry. Table of Contents. Geometry 1 Statistics and Probability 8

Auto-calibration. Computer Vision II CSE 252B

SPERNER S LEMMA MOOR XU

The Graphs of Triangulations of Polygons

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem

THE DIMENSION OF POSETS WITH PLANAR COVER GRAPHS

Ray shooting from convex ranges

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

Ma/CS 6b Class 26: Art Galleries and Politicians

INSTITUTE of COMBINATORICS and its APPLICATIONS

Chordal Graphs: Theory and Algorithms

Graphs, Trees. Pebbles, Robots

NODE LOCALIZATION IN WSN: USING EUCLIDEAN DISTANCE POWER GRAPHS

Rigid Ball-Polyhedra in Euclidean 3-Space

Classification of All Crescent Configurations on Four and Five Points

4. Simplicial Complexes and Simplicial Homology

Computational Discrete Mathematics

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

Base size and separation number

Unlabeled equivalence for matroids representable over finite fields

Graph Theory Problem Ideas

On the Rigidity of Ramanujan Graphs

Computer Vision. 2. Projective Geometry in 3D. Lars Schmidt-Thieme

Chapter 4. square sum graphs. 4.1 Introduction

CLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE

6 Randomized rounding of semidefinite programs

Curriki Geometry Glossary

5 Graphs

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD

Information Structures to Secure Control of Rigid Formations with Leader-Follower Architecture

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

Conic Duality. yyye

Tensegrity frameworks: Static analysis review.

Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry

GEOMETRY Graded Course of Study

Graceful and odd graceful labeling of graphs

The Full Survey on The Euclidean Steiner Tree Problem

Dissections of polygons into convex polygons

Two-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014

Triple lines on curves

Exercise set 2 Solutions

Endomorphisms and synchronization, 2: Graphs and transformation monoids

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra

On the number of distinct directions of planes determined by n points in R 3

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

Crossing Families. Abstract

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

An Investigation of Closed Geodesics on Regular Polyhedra

Tomaz Pisanski, University of Ljubljana, Slovenia. Thomas W. Tucker, Colgate University. Arjana Zitnik, University of Ljubljana, Slovenia

Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017

Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem

Planar Point Sets With Large Minimum Convex Decompositions

c 2004 Society for Industrial and Applied Mathematics

Planar Minimally Rigid Graphs and Pseudotriangulations. November 21, 2003

Dirac-type characterizations of graphs without long chordless cycles

Isometric Diamond Subgraphs

Transcription:

Flavors of Rigidity Flavor III - Universal Rigidity and Tensegrities Discrete Networks University of Pittsburgh Bob Connelly Cornell University October 2014 1/1

Stress-Energy Form Recall that a tensegrity framework (G, p) is universally rigid if when (G, q) satisfies the constraints of (G, p), where q is a configuration in any R D,thenp is congruent to q. That is, cables don t get longer, struts don t get shorter, and bars stay the same length. If! =(...,! ij,...) is a stress assigned to the edges of a graph G, the following quadratic form is defined for all configurations p =(p 1,...,p n )forallp i in any Euclidean space R d R d+1 R d+2..., E! (p) = X i<j! ij (p i p j ) 2. 2/1

Stress-Energy Basics With respect to the standard basis for R d, the matrix of E! is I d. But with a permutation of the indices we see that 0 1 0... 0 0... 0 B @. 0 0.. C 0 A = I d. 0 0... So E! is positive semi-definite (PSD) if and only if is PSD. 3/1

The Fundamental Criterion For a tensegrity graph G, wesaythatastress! is proper if! ij 0 for {i, j} acable,and! ij apple 0for{i, j} astrut. Theorem (Stress-Energy) Let (G, p) be configuration with n vertices in Euclidean space with d-dimensional a ne span, a proper equilibrium stress! and corresponding stress matrix such that 1 rank =n d 1, 2 is PSD, and 3 the member directions with non-zero stress and bar directions do not lie on a conic at infinity in the a ne span of p. Then (G, p) is universally rigid. Notice that there is no hedging about the configuration being generic. I call a tensegrity that satisfies the conditions above super stable. 4/1

Tensegrity Examples K(3,3) on a conic Cauchy Polygon Grunbaum Polygon A Desargues' Framework Cube with Long Diagonals, K(4,4) Kenneth Snelson's Original Tensegrity Complete Bipartite Graph K(6,5) 5/1

Snelson Tower The artist Kenneth Snelson has several tensegrity sculptures worldwide. This 60 ft. tensegrity Needle Tower is at the Hirshhorn Museum in Washington, D.C. 6/1

Principle of Least Energy The proof of the Fundamental Theorem uses the principle of least work (my favorite). Suppose that (G, q) isaframework,inany dimension, that has cables no longer, struts no shorter, and bars the same length as (G, p), which has a proper PSD equilibrium stress! of rank n d 1. Then E! (q) = X i<j! ij (q i q j ) 2 apple X i<j! ij (p i p j ) 2 =0. Since and thus E! is PSD, q is in the kernel of E! and (G, q) is in equilibrium with respect to!. Sincep is universal with respect to!, q is an a ne image of p, and since the stressed directions do not lie on a conic at infinity, q is congruent to p. 7/1

Planar Examples The planar planar tensegrities above are examples of the following: Theorem If (G, p) is obtained from a convex planar polygon with cables on the external edges, struts along some of the internal diagonals, and a proper non-zero equilibrium stress, then it is super stable. Any tensegrity in this class must have a kernel of rank at most 3. So the signature of any linear combination of stress matrices must remain constant, and any PSD example implies they all are PSD of maximal rank. Problem: For a convex polygon find one example, with any arrangement of strut diagonals, that is super stable. 8/1

3D Examples A prysmic tensigrid is obtained from two regular polygons in parallel planes, both centered on the z-axis. Cables join adjacent vertices of the polygons, and each vertex is connected by a cable to a vertex in the other polygon and by a strut to one other vertex in the other polygon, maintaining symmetric (dihedral) symmetry. Theorem (RC and Maria Terrell 1995) For a prysmic tensigrid, when one polygon is rotated so that there is a non-zero proper equilibrium stress, then the tensegrity is super stable. DS s n 9/1

Symmetric Examples-Form Finding Many of the examples used by artists are highly symmetric. One example of that is when the point group of symmetries acts transitively on the vertices and there are exactly two transitivity classes of cables and one for struts. In this case, the stress matrix is simply an element of the group algebra for the representations of the abstract group of symmetries. Each irreducible representation corresponds to vectors in the kernel of the stress matrix. When it is 3-dimensional it provides a configuration that is super stable. The ratio Robert Connelly <rc46@cornell.edu> Re: new CAM website - graphics needed August 21, 2008 9:52 AM between the cable stresses is a parameter that the user can choose. Dear Delores, http://www.math.cornell.edu/~tens/ Here is graphic. A highly symmetric tensegrity Bob Connelly 10 / 1

Spiderwebs There are many other examples of universally rigid tensegrity frameworks where there is no single stress that rigidifies the structure. It is easy to construct examples with spiderwebs, which are tensegrity frameworks where some nodes are pinned or rigidified, while all the members are cables, as in the examples below. Any positive equilibrium stress will rigidify the tensegrity. The red cables are unstressed but they are attached to a universally rigid subframework. The black nodes are pinned. The process of successively attaching more nodes is iterated. The projection of any convex polytope into one of its faces creates an equilibrium spiderweb. 11 / 1

Dimensional Rigidity A (tensegrity) framework (G, p) iscalled(byalfakih) dimensionally rigid if its a ne span is d dimensional and any equivalent framework (G, q) (with bars the same length, cables no longer, struts no shorter) has an a ne span of dimension at most d. Note that a framework may be dimensionally rigid, and yet not be even locally rigid, as in the examples below. (Dimensionally maximal would be a better name.) A ruled hyperboloid 12 / 1

Dimensional Rigidity and Universal Rigidity Clearly dimensional rigidity is weaker than universal rigidity, but they are very closely related. Theorem (Alfakih 2007) If (G, p) has n vertices, with a ne span d dimensional, and is dimensionally rigid, then d =(n 1) or it has a (proper) PSD equilibrium stress. Furthermore, any equivalent framework is an a ne image of p. If (G, q) isequivalentto(g, p) placep and q in R d 0and0 R d respectively. Then p i (t) =((cost)p i, (sin t)q i ) for each vertex i of G, for 0 apple t apple /2, is a monotone flex of p to q. Thatis,thedistance p i (t) p j (t) changes monotonically in t. (E.g. it stays constant for bars.) The configuration p i ( /4) lies in a d-dimensional a graph of the map from p to q lies in a d-dimensional a R d R d,andthecorrespondenceextendstoana ne space, by the dimensional rigidity, so the nemap. ne subspace of 13 / 1

Iterated Universal Rigidity Corollary Aframework(G, p) is universally rigid if and only if it is dimensionally rigid and the member directions with a non-zero stress and bars do not lie on a conic at infinity. The question remains as to what about frameworks (G, p) thatare universally rigid, but whose stress matrices have too low a rank. It turns out that in that case there is a sequence of stresses with stress matrices 1, 2,..., k,whereeach i is defined on those configurations in the kernel of the previous j for j < i. Ifthefinal space of configurations is d-dimensional, then (G, p) is d-dimensionally rigid. This is essentially an application of facial reduction in convexity theory. See Connelly-Gortler. 14 / 1

Example of Iterated Universal Rigidity 1 2 4 4-2 1 1 This shows an example of a framework that is dimensionally rigid in the plane, with a 3-step iteration. The second-level stresses are shown, which turn out to be lever arm balancing forces. The first and second level stresses are in the vertical members. A computation shows that the sequence of stress matrices, when restricted to the kernel of the previous stresses, are each PSD, but after the first level these higher-level stresses are not PSD on the whole space of configurations. 15 / 1

Projective Invariance A projective map on real projective space can be regarded as a map as follows: For each point p i 2 R d define (p i )=A ˆp i /z i 2 R d 1, where z i 6= 0 is the last coordinate of A ˆp i,anda is a (d + 1)-by-(d + 1) matrix. If p =(p 1,...,p n )isa configuration in R d,and isanequilibriumstressmatrixforthe stress! for p, then AˆPD 1 D D =0 shows that D D is another equilibrium stress matrix for (p), where D is the diagonal matrix with entries z i.thenewstress matrix D D has the same signature for the configuration as, where each stress! ij is replaced with z i! ij z j. Note that the sign of! ij changes if the (projective) image of the member crosses the line/space at infinity. This shows that infinitesimal rigidity is a projective invariant, and using this we can show that dimensional rigidity is projectively invariant. However... 16 / 1

Universal Rigidity is not Projectively Invariant The ladder on the left is not universally rigid, since it has an a ne flex. Whereas the orchard ladder, a projective image of the straight ladder, on the right is universally rigid since there are 3 distinct stressed directions. 17 / 1

Averaging-deaveraging Method Amethodofrelatinginfinitesimalrigiditytoglobalrigiditygoingbackmany years is the following: Suppose that (G, p) and(g, q) aretwoequivalent frameworks, i.e. corresponding bars have the same lengths. Then p 0 i = p i q i, i =1,...,n defines an infinitesimal flex on (G, p), where p i =(p i + q i )/2 istheaverageofpand q. If p and q are not congruent, then p 0 is not trivial, and if they are congruent and have d-dimensional a ne span in R d,thenp 0 is trivial. Conversely, if p 0 is an infinitesimal flex of (G, p), then (G, p + p 0 )isequivalentto(g, p p 0 ). Problem: Find an example of congruent frameworks (G, p + p 0 ), (G, p p 0 )eventhoughp 0 is a non-trivial infinitesimal flex of (G, p). 18 / 1

Bipartite Frameworks Averyextensiveanalysisoftheequilibriumstressesofacompletebipartite graph in any dimension was given in Bolker-Roth. For example: Theorem (Bolker-Roth 1980) AcompletebipartitegraphK m,n(p, q) in R d for which the a ne span of p and q are both d-dimensional and m = d +1,n= d(d +1)/2, isinfinitesimally rigid unless its m + n =(d +1)(d +2)/2 vertices lie on a quadric surface. Walter Whiteley showed how the infinitesimal flexes can be found from the quadric surface. K(3,3) on a conic 19 / 1

Universally Rigid Bipartite Frameworks A natural question is to find a characterization of when a bipartite framework is universally rigid. The following is partial information. Theorem (Connelly-Gortler) If (K(m, n), (p, q)) is a bipartite framework in R d,with m + n d +2, such that the partition vertices (p, q) are strictly separated by a quadric, then it is not universally rigid. Conversely, if (K(m, n), (p, q)) cannot have its vertices p and q separated by a quadric, then there is an equilibrium stress with stress matrix with positive diagonal entries. In R d the existence of apsdmaximalrankstressmatrixreducestothecasewhen m + n =(d + 1)(d + 2)/2. Conjecture For all d 1, (K(m, n), (p, q)) in R d is universally rigid if and only if p and q cannot be strictly separated by a quadric. 20 / 1

Universally Rigid Bipartite Frameworks The conjecture is true for d = 1, by T. Jordan and V-H Nguyen, and for d = 2. For d = 3, calculations strongly suggest that it is true for K(6, 5), the critical case. The tensegrity on the left is centrally symmetric and so any strictly separating conic has to be a circle centered at the red center point, and it is easy to see that there is no such circle. For the tensegrity on the right the red and blue points are separated by the degenerate conic consisting of two lines. 21 / 1

References Abdo Alfakih, On dimensional rigidity of bar-and-joint frameworks, Discrete Appl. Math., The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, 155,no.10,1-59,2007. E. D. Bolker and B. Roth, When is a Bipartite Graph a Rigid Framework?, Pacific Journal of Mathemstics, Vol.90,No.1,27 44,1980. Robert Connelly and Steven Gortler, Iterative Universal Rigidity, arxiv:1401.7029, 1-41,2014. Robert Connelly and Maria Terrell, Globally Rigid Symmetric Tensegrities, Structural Topology, No.21,59 78,(1995). Tibor Jordán and Viet-Hng Nguyen, On universally rigid frameworks on the line., Technical Report TR-2012-10, Egerv?ary Research Group on Combinatorial Optimization, Budapest Hungary, pages 1-13, July 14, 2012., No. 21, 59 78, (1995). Walter Whiteley, Infinitesimal motions of a bipartite framework., Pacific Journal of Mathemstics, Vol.110,No.1,233-255,1984. 22 / 1