Combinatorics / CONCEPT
PlanarForward
Every finite Laman graph has a real planar rigid placement, including the two-vertex case.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
From Laman counts to a rigid placement
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Frameworkstructural-affinity · Closed
- Henneberg preservation and reconstructionstructural-affinity · Closed
- HennebergRigiditystructural-affinity · Closed
- PlanarRowsstructural-affinity · Closed
- Real planar rigidity and spanning Laman graphsstructural-affinity · Closed
- Safe nonedge repair by tight blockersstructural-affinity · Closed
- Sparsity and tight-set closurestructural-affinity · Closed
- The complete finite Henneberg characterizationstructural-affinity · Closed
- TrivialMotionsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance