We consider the problem of characterising the generic rigidity of bar-joint frameworks in R d in which each vertex is constrained to lie in a given affine subspace. The special case when d = 2 was previously solved by I. Streinu and L. Theran in 2010. We will extend their characterisation to the case when d ≥ 3 and each vertex is constrained to lie in an affine subspace of dimension t, when t = 1, 2 and also when t ≥ 3 and d ≥ t(t − 1). We then point out that results on body-bar frameworks obtained by N. Katoh and S. Tanigawa in 2013 can be used to characterise when a graph has a rigid realisation as a d-dimensional body-bar framework with a given set of linear constraints.

A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints that fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine subspaces. It is globally rigid if the configuration is uniquely defined by the constraint system. We show that a generic linearly constrained framework in $\mathbb{R}^2$ is globally rigid if and only if it is redundantly rigid and “balanced”. For unbalanced generic frameworks, we determine the precise number of solutions to the constraint system whenever the rigidity matroid of the framework is connected. We obtain a stress matrix sufficient condition and a Hendrickson type necessary condition for a generic linearly constrained framework to be globally rigid in $\mathbb{R}^d$.

A bar-joint framework G p ( , ) in d is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of d . It is known that, when G p ( , ) is generic, its rigidity depends only on the underlying graph G, and is determined by the rank of the edge set of G in the generic d-dimensional rigidity matroid  d . Complete combinatorial descriptions of

Fekete, Jordán and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their characterisation to an arbitrary set T of vertices and verify our conjecture when |T | = 3.