Featured Application The material in this article draws on, and has applications across a
range of applications in civil and structural engineering, mechanical engineering, computer …

This introduction to the theory of rigid structures explains how to analyze the performance of
built and natural structures under loads, paying special attention to the role of geometry. The …

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …

Chapter 61 described the basic theory of infinitesimal rigidity of bar and joint structures and
a number of related structures. In this chapter, we consider the stronger properties of: Global …

A d-dimensional framework is a pair (G, p), where G=(V, E) is a graph and p is a map from V
to R d. The length of an edge xy∈ E in (G, p) is the distance between p (x) and p (y). A vertex …

We investigate how to find generic and globally rigid realizations of graphs in R d based on
elementary geometric observations. Our arguments lead to new proofs of a combinatorial …

AL Cauchy proved that if the vertex-edge graphs of two convex polyhedra are isomorphic
and corresponding faces are congruent then the two polyhedra are the same. This result …

We consider the global rigidity problem for bar-joint frameworks where each vertex is
constrained to lie on a particular line in. In our setting, we allow multiple vertices to be …

A-dimensional framework is a pair, where is a graph and maps the vertices of to points in.
The edges of are mapped to the corresponding line segments. A graph is said to be globally …

A d-dimensional framework is a pair vertices, then the d-dimensional generic rigidity matroid
of G is connected. Finally, we provide new families of fully reconstructible graphs and use …