Papers
Topics
Authors
Recent
Search
2000 character limit reached

Universally Rigid Framework Attachments

Published 17 Nov 2010 in math.MG | (1011.4094v2)

Abstract: A framework is a graph and a map from its vertices to Rd. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in Rd' for any d'. A framework attachment is a framework constructed by joining two frameworks on a subset of vertices. We consider an attachment of two universally rigid frameworks that are in general position in Rd. We show that the number of vertices in the overlap between the two frameworks must be sufficiently large in order for the attachment to remain universally rigid. Furthermore, it is shown that universal rigidity of such frameworks is preserved even after removing certain edges. Given positive semidefinite stress matrices for each of the two initial frameworks, we analytically derive the PSD stress matrices for the combined and edge-reduced frameworks. One of the benefits of the results is that they provide a general method for generating new universally rigid frameworks.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.