Rigidity Matroid

Visualize Laman graphs and structural rigidity using Laman's Theorem

Nodes: 0 | Edges: 0 | Rigid: No

Laman's Theorem

A graph is generically rigid in 2D if and only if:

  1. It has exactly 2n - 3 edges (where n is the number of vertices)
  2. Every subgraph with n' vertices has at most 2n' - 3 edges

E = 2V - 3

Minimum edges for rigidity

Controls

Graph Info

Vertices: 0
Edges: 0
Required: 0
Status: Not Rigid

Presets