Graph Exploration
Visualize graphs as mechanical linkages. Each vertex with degree k requires dimension ≥ k and has DOF = d - k in dimension d. Flexible vertices can move while preserving edge lengths.
3D Linkage View
Interactive visualization with constraint spheres
Graph Analysis
Requires at least 1D (line)
Contains K₂ (edge)
|E| = 2, need 3 for Laman
Vertex Analysis
Dual perspectives: construction (↑) and folding (↓)
Construction view: Each vertex with degree k requires at least dimension k for generic positioning.
Folding view: In dimension d, each vertex with degree k has DOF = d - k. Vertices with DOF > 0 can move.
Folding Metrics
2D Graph Layout
Abstract graph representation with node coordinates
2D Graph Layout
Abstract graph representation with node coordinates
Graph Matrices
Different matrix representations capturing the graph's combinatorial structure
Adjacency Matrix
| v₁ | v₂ | v₃ | |
|---|---|---|---|
| v₁ | 0 | 1 | 0 |
| v₂ | 1 | 0 | 1 |
| v₃ | 0 | 1 | 0 |
The adjacency matrix A has A[i,j] = 1 if vertices i and j are connected by an edge.