Abstract
AbstractA rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint frameworks in a variety of such contexts. The main results are combinatorial characterisations for (i) frameworks restricted to surfaces with both Euclidean and geodesic distance constraints, (ii) frameworks in the plane with Euclidean and non-Euclidean distance constraints, and (iii) direction-length frameworks in the non-Euclidean plane.
Funder
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference18 articles.
1. Asimow, L., Roth, B.: The rigidity of graphs. Trans. Am. Math. Soc. 245, 279–289 (1978)
2. George, S., Ahmed, F.: Rigidity in the one-dimensional projective space. http://www.math.columbia.edu/~dpt/RigidityREU/AG11Rigidity1DProj.pdf
3. Jackson, B., Nixon, A.: Global rigidity of generic frameworks on the cylinder. J. Combin. Theory Ser. B 139, 193–229 (2019)
4. Jordán, T., Kaszanitzky, V.E.: Sparse hypergraphs with applications in combinatorial rigidity. Discrete Appl. Math. 185, 93–101 (2015)
5. Khoo, Y., Singer, A., Cowburn, D.: Integrating NOE and RDC using sum-of-squares relaxation for protein structure determination. J. Biomol. NMR 68(3), 163–185 (2017)