Convex and discrete geometry Definition
Rigidity of frameworks
Builds on GraphEuclidean distance
Definition
Let and let be a finite graph. A framework in is a pair with . Write for the Euclidean distance. The framework is rigid if there is with the following property. Every that satisfies both conditions below also satisfies for all .
- for every .
- for every edge .
A framework that is not rigid is called flexible.
Remarks
So a framework is rigid when every nearby placement with the same bar lengths is congruent to it. Example: a triangle placed at three non-collinear points of is rigid. Its three bar lengths are all the pairwise distances, so condition 2 already gives the conclusion.
Non-example: the cycle on four vertices placed at the corners of a unit square in is flexible. For small , the rhombus with corners , , and keeps all four bar lengths equal to . Its diagonal from to has length different from .
An equivalent form: every continuous motion of the vertices that keeps all bar lengths is the restriction of a family of isometries of .
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Graph definition
- Length of a vector concept
- Euclidean distance definition
- Rigidity of frameworks definition
Further reading
About this page
| Tag | 3D1J3AXS69 |
|---|---|
| URI | m2://3D1J3AXS69 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C25, 51K99 |
| Defines | Rigidity of frameworks |
| Uses | Graph, Euclidean distance |
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.