Cayley configuration space explained

F , called Cayley parameters, is the set of distances attained by F over all its frameworks, under some l _{p} -norm. In other words, each framework of the linkage prescribes a unique set of distances to the non-edges of G , so the set of all frameworks can be described by the set of distances attained by any subset of these non-edges. Note that this description may not be a bijection. The motivation for using distance parameters is to define a continuous quadratic branched covering from the configuration space of a linkage to a simpler, often convex, space. Hence, obtaining a framework from a Cayley configuration space of a linkage over some set of non-edges is often a matter of solving quadratic equations.

Cayley configuration spaces have a close relationship to the flattenability and combinatorial rigidity of graphs.

Definitions

Cayley configuration space

Definition via linkages.^[1] Consider a linkage

(G,\delta) , with graph G and l ^{p} _{p} -edge-length vector \delta (i.e., l _{p} -distances raised to the p ^{th} power, for some l _{p} -norm) and a set of non-edges F of G . The Cayley configuration space of (G,\delta) over F in R ^{d} under the for some l _{p} -norm, denoted by \Phi ^{d} _{F,l _{p}} (G,\delta _{G)} , is the set of l ^{p} _{p} -distance vectors \delta _{F} attained by the non-edges F over all frameworks of (G,\delta) in R ^{d} . In the presence of inequality l ^{p} _{p} -distance constraints, i.e., an interval [\delta _{l,\delta} _{r]} , the Cayley configuration space \Phi ^{d} _{F,l _{p}} \left(G,[\delta ^{r} _{G]\right)} is defined analogously. In other words, \Phi ^{d} _{F,l _{p}} (G,\delta _{G)} is the projection of the Cayley-Menger semialgebraic set, with fixed (G,\delta) or \left(G,[\delta ^{r} _{G]\right)} , onto the non-edges F , called the Cayley parameters.

Definition via projections of the distance cone.^[2] Consider the cone

\Phi _{n,l _{p}} of vectors of pairwise l ^{p} _{p} -distances between n points. Also consider the d -stratum of this cone \Phi ^{d} _{n,l _{p}} , i.e., the subset of vectors of l ^{p} _{p} -distances between n points in R ^{d} . For any graph G , consider the projection \Phi ^{d} _{G,l _{p}} of \Phi ^{d} _{n,l _{p}} onto the edges of G , i.e., the set of all vectors \delta _{G} of l ^{p} _{p} -distances for which the linkage (G,\delta _{G)} has a framework in R ^{d} . Next, for any point \delta _{G} in \Phi ^{d} _{G,l _{p}} and any set of non-edges F of G , consider the fiber of \delta _{G} in \Phi ^{d} _{n,l _{p}} along the coordinates of F , i.e., the set of vectors \delta _{G} of l ^{p} _{p} -distances for which the linkage (G \cup F,\delta _{G} ) has a framework in R ^{d} .

The Cayley configuration space

\Phi ^{d} _{F,l _{p}} (G,\delta _{G)} is the projection of this fiber onto the set of non-edges F , i.e., the set of l ^{p} _{p} -distances attained by the non-edges in F over all frameworks of (G,\delta _{G)} in R ^{d} . In the presence of inequality l ^{p} _{p} -distance constraints, i.e., an interval [\delta _{l,G} ,\delta _{r,G} ] , the Cayley configuration space \Phi ^{d} _{F,l _{p}} (G,[\delta _{l,G} ,\delta _{r,G} ]) is the projection of a set of fibers onto the set of non-edges F .

Definition via branching covers. A Cayley configuration space of a linkage in

R ^{d} is the base space of a branching cover whose total space is the configuration space of the linkage in R ^{d} .

Oriented Cayley configuration space

G with base non-edge f , each point of a framework of a linkage (G,\delta) in R ^{d} under the l _{2} -norm can be placed iteratively according to an orientation vector \sigma , also called a realization type. The entries of \sigma are local orientations of triples of points for all construction steps of the framework. A \sigma -oriented Cayley configuration space of (G,\delta) over f , denoted by \Phi ^{2} _{f,\sigma} (G,\delta) is the Cayley configuration space of (G,\delta) over f restricted to frameworks respecting \sigma .^[3] In other words, for any value of f in \Phi ^{2} _{f,\sigma} (G,\delta) , corresponding of frameworks of (G,\delta) respect \sigma and are a subset of the frameworks in \Phi ^{2} _{f} (G,\delta) .

Minimal complete Cayley vector

For a 1-dof tree-decomposable graph

G = (V,E) with low Cayley complexity on a base non-edge f , a minimal Cayley vector F is a list of O(|V|) non-edges of G such that the graph G \cup F is generically globally rigid.^{[4] [5]}

Properties

Single interval property

A pair

(G,f) , consisting of a graph G and a non-edge f , has the single interval property in R ^{d} under some l _{p} -norm if, for every linkage (G,\delta) , the Cayley configuration space \Phi ^{d} _{f,l _{p}} (G,\delta) is a single interval.

Inherent convexity

A graph

G has an inherent convex Cayley configuration space in R ^{d} under some l _{p} norm if, for every partition of the edges of G into H and F and every linkage (H,\delta) , the Cayley configuration space \Phi ^{d} _{F,l _{p}} (H,\delta) is convex.

Genericity with respect to convexity

Let

G = (V,E) be a graph and F be a nonempty set of non-edges of G . Also let r be a framework in R ^{d} of any linkage whose constraint graph is G and consider its corresponding l ^{p} _{p} -edge-length vector \delta _{r} in the cone \Phi _{n,l _{p}} , where n = |V| . As defined in Sitharam & Willoughby, the framework r is generic with respect to the property of convex Cayley configuration spaces if

• There is an open neighborhood

\Omega of \delta _{r} in the d -stratum \Phi ^{d} _{n,l _{p}} (corresponding to a neighborhood around r of frameworks in R ^{d} ); and\Phi ^{d} _{F,l _{p}} (G,\delta _{r)} is convex if and only if, for all \delta _{q} \in \Omega , \Phi ^{d} _{F,l _{p}} (G,\delta _{q)} is convex.

Theorem. Every generic framework of a graph

G in R ^{d} has a convex Cayley configuration space over a set of non-edges F if and only if every linkage (G,\delta) does.

Theorem. Convexity of Cayley configuration spaces is not a generic property of frameworks.

Proof. Consider the graph in Figure 1. Also consider the framework

p in R ^{2} whose pairwise l _{2} -distance vector \delta _{p} assigns distance 3 to the unlabeled edges, 4 to x , and 1 to y and the 2-dimensional framework q whose pairwise l _{2} -distance vector \delta _{q} assigns distance 3 to the unlabeled edges, 4 to x , and 4 to y . The Cayley configuration space \Phi ^{2} _{f} (G,\delta _{p)} is 2 intervals: one interval represents frameworks with vertex B on the right side of the line defined by vertices C and D and the other interval represents frameworks with vertex B on the left side of this line. The intervals are disjoint due to the triangle inequalities induced by the distances assigned to the edges x and y . Furthermore, p is a generic framework with respect to convex Cayley configuration spaces over f in R ^{2} : there is a neighborhood of frameworks around p whose Cayley configuration spaces \Phi ^{2} _{f} (G,\delta) are 2 intervals.

On the other hand, the Cayley configuration space

\Phi ^{2} _{f} (G,\delta _{q)} is a single interval: the triangle-inequalities induced by the quadrilateral containing f define a single interval that is contained in the interval defined by the triangle inequalities induced by the distances assigned to the edges x and y . Furthermore, q is a generic framework with respect to convex Cayley configuration spaces over f in R ^{2} : there is a neighborhood of frameworks around q whose Cayley configuration spaces over f in R ^{2} are a single interval. Thus, one generic framework has a convex Cayley configuration space while another does not.

Generic completeness

A generically complete, or just complete, Cayley configuration space is a Cayley configuration of a linkage

(G,\delta) over a set of non-edges F such that each point in this space generically corresponds to finitely many frameworks of (G,\delta) and the space has full measure. Equivalently, the graph G \cup F is generically minimally-rigid.

Results for the Euclidean norm

The following results are for Cayley configuration spaces of linkages over non-edges under the

l _{2} -norm, also called the Euclidean norm.

Single interval theorems

Let

G be a graph. Consider a 2-sum decomposition of G , i.e., recursively decomposing G into its 2-sum components. The minimal elements of this decomposition are called the minimal 2-sum components of G .

Theorem. For

d \leq 2 , the pair (G,f) , consisting of a graph G and a non-edge f , has the single interval property in R ^{d} if and only if all minimal 2-sum components of G \cup f that contain f are partial 2-trees.

The latter condition is equivalent to requiring that all minimal 2-sum components of

G \cup f that contain f are 2-flattenable, as partial 2-trees are exactly the class of 2-flattenable graphs (see results on 2-flattenability). This result does not generalize for dimensions d \geq 3 . The forbidden minors for 3-flattenability are the complete graph K _{5} and the 1-skeleton of the octahedron K _{2,2,2} (see results on 3-flattenability). Figure 2 shows counterexamples for d =3 . Denote the graph on the left by G and the graph on the right by H . Both pairs (G,f) and (H,f) have the single interval property in R ^{3} : the vertices of f can rotate in 3-dimensions around a plane. Also, both G \cup f and H \cup f are themselves minimal 2-sum components containing f . However, neither G \cup f nor H \cup f is 3-flattenable: contracting f in G \cup f yields K _{5} and contracting f in H \cup f yields K _{2,2,2} .

Example. Consider the graph

G in Figure 3 whose non-edges are d _{1} and d _{2} . The graph G is its own and only minimal 2-sum component containing either non-edge. Additionally, the graph G \cup d _{1} \cup d _{2} is a 2-tree, so G is a partial 2-tree. Hence, by the theorem above both pairs (G,d _{1)} and (G,d _{2)} have the single interval property in R ^{2} .

The following conjecture characterizes pairs

(G,f) with the single interval property in R ^{d} for arbitrary d .

Conjecture. The pair

(G,f) , consisting of a graph G and a non-edge f , has the single interval property in R ^{d} if and only if for any minimal 2-sum component of G \cup f that contains f and is not d -flattenable, f must be either removed, duplicated, or contracted to obtain a forbidden minor for d -flattenability from G .

1-dof tree-decomposable linkages in R²

The following results concern oriented Cayley configuration spaces of 1-dof tree-decomposable linkages over some base non-edge in

R ^{2} . Refer to tree-decomposable graphs for the definition of generic linkages used below.

Theorem. For a generic 1-dof tree-decomposable linkage

(G,\delta) with base non-edge f the following hold:

• An oriented Cayley configuration space

\Phi ^{2} _{f,\sigma} (G,\delta) is a set of disjoint closed real intervals or empty;

• Any endpoint of these closed intervals corresponds to the length of

f in a framework of an extreme linkage; and

• For any vertex

v or any non-edge g of G , the maps from \Phi ^{2} _{f,\sigma} (G,\delta) to the coordinates of v or the length of g in the frameworks of (G,\delta) are continuous functions on each of these closed intervals.

This theorem yields an algorithm to compute (oriented) Cayley configuration spaces of 1-dof tree-decomposable linkages over a base non-edge by simply constructing oriented frameworks of all extreme linkages. This algorithm can take time exponential in the size of the linkage and in the output Cayley configuration space. For a 1-dof tree-decomposable graph

G , three complexity measures of its oriented Cayley configuration spaces are:

• Cayley size: the maximum number of disjoint closed real intervals in the Cayley configuration space over all linkages

(G,\delta) ;

• Cayley computational complexity: the maximum time complexity to obtain these intervals over all linkages

(G,\delta) ; and

• Cayley algebraic complexity: the maximum algebraic complexity of describing each endpoint of these intervals over all linkages

(G,\delta) .

Bounds on these complexity measures are given in Sitharam, Wang & Gao. Another algorithm to compute these oriented Cayley configuration spaces achieves linear Cayley complexity in the size of the underlying graph.

Theorem.^[6] For a generic 1-dof tree-decomposable linkage

(G,\delta) , where the graph G has low Cayley complexity on a base non-edge f , the following hold:

• There exist at most two continuous motion paths between any two frameworks of

(G,\delta) ,

• • and the time complexity to find such a path, if it exists, is linear in the number of interval endpoints of the oriented Cayley configuration space over

f that the path contains; and

• There is an algorithm that generates the entire set of connected components of the configuration space of frameworks of

(G,\delta) ,

• • and the time complexity of generating each such component is linear in the number of interval endpoints of the oriented Cayley configuration space over

f that the component contains.

An algorithm is given in Sitharam, Wang & Gao to find these motion paths. The idea is to start from one framework located in one interval of the Cayley configuration space, travel along the interval to its endpoint, and jump to another interval, repeating these last two steps until the target framework is reached. This algorithm utilizes the following facts: (i) there is a continuous motion path between any two frameworks in the same interval, (ii) extreme linkages only exist at the endpoints of an interval, and (iii) during the motion, the low Cayley complexity linkage only changes its realization type when jumping to a new interval and exactly one local orientation changes sign during this jump.

Example. Figure 4 shows an oriented framework of a 1-dof tree-decomposable linkage with base non-edge

(v _{0,v'} _{0)} , located in an interval of the Cayley configuration space, and two other frameworks whose orientations are about to change. The vertices corresponding to construction steps are labelled in order of construction. More specifically, the first framework has the realization type ( 1 , -1 , -1 , 1 ) . There is a continuous motion path to the second framework, which has the realization type ( 0 , -1 , -1 , 1 ) . Hence, this framework corresponds to an interval endpoint and jumping to a new interval results in the realization type ( -1 , -1 , -1 , 1 ) . Likewise, the third framework is corresponds to an interval endpoint with the realization type ( -1 , -1 , 0 , 1 ) and jumping to a new interval results in the realization type ( -1 , -1 , 1 , 1 ) .

Theorem. (1) For a generic 1-path, 1-dof tree-decomposable linkage

(G,\delta) with low Cayley complexity, there exists a bijective correspondence between the set of frameworks of (G,\delta) and points on a 2-dimensional curve, whose points are the minimum complete Cayley distance vectors. (2) For a generic 1-dof tree-decomposable linkage (G,\delta) with low Cayley complexity, there exists a bijective correspondence between the set of frameworks of (G,\delta) and points on an n -dimensional curve, whose points are the minimum complete Cayley distance vectors, where n is the number of last level vertices of the graph G .

Results for general p-norms

These results are extended to general

l _{p} -norms.

Theorem. For general

l _{p} -norms, a graph G has an inherent convex Cayley configuration space in R ^{d} if and only if G is d -flattenable.

The "only if" direction was proved in Sitharam & Gao using the fact that the

l ^{2} _{2} distance cone \Phi _{n,l _{2}} is convex. As a direct consequence, d -flattenable graphs and graphs with inherent convex Cayley configuration spaces in R ^{d} have the same forbidden minor characterization. See Graph flattenability for results on these characterizations, as well as a more detailed discussion on the connection between Cayley configuration spaces and flattenability.

Example. Consider the graph in Figure 3 with both non-edges added as edges. The resulting graph is a 2-tree, which is 2-flattenable under the

l _{1} and l _{2} norms, see Graph flattenability. Hence, the theorem above indicates that the graph has an inherent convex Cayley configuration space in R ^{2} under the l _{1} and l _{2} norms. In particular, the Cayley configuration space over one or both of the non-edges d _{1} and d _{2} is convex.

Applications

The EASAL algorithm^[7] makes use of the techniques developed in Sitharam & Gao for dealing with convex Cayley configuration spaces to describe the dimensional, topological, and geometric structure of Euclidean configuration spaces in

R ^{3} . More precisely, for two sets of n points A and B in R ^{3} with interval distance constraints between pairs of points coming from different sets, EASAL outputs all the frameworks of this linkage such that no pair of constrained points is too close together and at least one pair of constrained points is sufficiently close together. This algorithm has applications in molecular self-assembly.

References

1. Sitharam. Meera. Gao. Heping. 2010-04-01. Characterizing Graphs with Convex and Connected Cayley Configuration Spaces. Discrete & Computational Geometry. en. 43. 3. 594–625. 10.1007/s00454-009-9160-8. 35819450. 1432-0444. free.
2. Sitharam. Meera. Willoughby. Joel. 2015. Botana. Francisco. Quaresma. Pedro. On Flattenability of Graphs. Automated Deduction in Geometry. Lecture Notes in Computer Science. 9201. en. Cham. Springer International Publishing. 129–148. 10.1007/978-3-319-21362-0_9. 1503.01489. 978-3-319-21362-0. 23208.
3. Book: Gao. Heping. Sitharam. Meera. Proceedings of the 2009 ACM symposium on Applied Computing . Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces . 2009-03-08. https://doi.org/10.1145/1529282.1529529. SAC '09. Honolulu, Hawaii. Association for Computing Machinery. 1122–1126. 10.1145/1529282.1529529. 978-1-60558-166-8. 14117144.
4. Sitharam. Meera. Wang. Menghan. Gao. Heping. 2011. Cayley configuration spaces of 2D mechanisms, Part I: extreme points, continuous motion paths and minimal representations. Preprint. 1112.6008.
5. Sitharam. Meera. Wang. Menghan. Gao. Heping. 2011. Cayley Configuration Spaces of 1-dof Tree-decomposable Linkages, Part II: Combinatorial Characterization of Complexity. Preprint. 1112.6009.
6. 2014-01-01. How the Beast really moves: Cayley analysis of mechanism realization spaces using CayMos. Computer-Aided Design. en. 46. 205–210. 10.1016/j.cad.2013.08.033. 0010-4485. Sitharam. Meera. Wang. Menghan.
7. Ozkan. Aysegul. Prabhu. Rahul. Baker. Troy. Pence. James. Peters. Jorg. Sitharam. Meera. 2018-07-26. Algorithm 990: Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals. ACM Transactions on Mathematical Software. 44. 4. 48:1–48:30. 10.1145/3204472. 29156131. 0098-3500.