Convex and discrete geometry Definition
Structural rigidity
Builds on GraphEuclidean space
Definition
Let and let be a finite graph. A framework in is a pair where is a map. The framework is rigid if there is with the following property: every map such that
- for every edge , and
- for every
also satisfies for all . A framework that is not rigid is flexible.
Remarks
Example: the triangle placed at three non-collinear points of is rigid. Clause 1 already fixes all three pairwise distances, so the conclusion holds for every .
Non-example: the -cycle placed at the corners of the unit square in is flexible. For every there is a rhombus with sides close to the square, which satisfies clauses 1 and 2, but its diagonals have lengths different from .
Rigidity is equivalent to the absence of a nontrivial flex. A flex is a continuous motion of the points, starting at , that keeps all bar lengths; it is nontrivial if it changes some distance between two vertices.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Graph concept
- Structural rigidity definition
Further reading
About this page
| Tag | 1RZV6TRTPE |
|---|---|
| URI | m2://1RZV6TRTPE |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C25, 05C62, 70B15 |
| Defines | Structural rigidity |
| Uses | Graph, Euclidean space |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.