Iterative Universal Rigidity
Connelly, Robert · Gortler, Steven
Original · EN
A bar framework determined by a finite graph G and configuration p in d space is universally rigid if it is rigid in any Rᵈ ⊃ Rᵈ. We provide a characterization of universally rigidity for any graph G and any configuration p in terms of a sequence of affine subsets of the space of configurations. This corresponds to a facial reduction process for closed finite dimensional convex cones.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.