Skip to content

Instantly share code, notes, and snippets.

@tmpvar

tmpvar/gist:9938915

Created April 2, 2014 17:29
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save tmpvar/9938915 to your computer and use it in GitHub Desktop.
Save tmpvar/9938915 to your computer and use it in GitHub Desktop.
Download ZIP
constraint notes
Raw
gistfile1.txt
Analysis of systems of equations - Serrano [74]
First step of determining whether a system is
over/under/well constrained.
Can be extended to decompose graphs into independently
solvable graphs
The constraint graph
+ vertex - geometric element
+ describe DOF
+ edge - constraint
+ describe # of DOF they remove
Over/Under/Well constrained global detection
Sum DOF and -edge DOF
"There are theorems which prove that if a constraint
graph can be decomposed in one way, using triangle
decomposition, then every sequence of triangle
decompositions fully decomposes the constraint graph."
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment