Detailed guide to making IK systems: github.com/SpehleonLP/IK-Guide Procedural sound effects for games: github.com/pdJeeves/Chiptune-... Animate Full body IK: spehleon.gumroad.com/l/ylxsd
so first method: inverse of J seocnd: inverse of J*J^T J*J^T is a 3x3 matrix or a 6x6 or otherwise a square matrix. J is not a square matrix. the inverse only exists for square matrices; you can get a pseudoinverse which is similar and will kinda work though. regardless, inverse is also slower the bigger the matrix is; 3x3 is better than 4x4 is better than 5x5 etc. so because the inverse in the second method is for a 3x3 thats kinda fine; for the first method it may be for like 3 rows by 100 columns; this is going to be super slow, its just too big. so its fine in the second method because we bounded the size of the matrix to a realistic size which is also known at compile time, meaning we can optimize the inverse function to hell. is that understandable?
Keep up the good work!
Detailed guide to making IK systems: github.com/SpehleonLP/IK-Guide
Procedural sound effects for games: github.com/pdJeeves/Chiptune-...
Animate Full body IK: spehleon.gumroad.com/l/ylxsd
Why the inverse is okay in the second method but not in the first?
so first method:
inverse of J
seocnd: inverse of J*J^T
J*J^T is a 3x3 matrix or a 6x6 or otherwise a square matrix.
J is not a square matrix.
the inverse only exists for square matrices; you can get a pseudoinverse which is similar and will kinda work though.
regardless, inverse is also slower the bigger the matrix is; 3x3 is better than 4x4 is better than 5x5 etc.
so because the inverse in the second method is for a 3x3 thats kinda fine; for the first method it may be for like 3 rows by 100 columns; this is going to be super slow, its just too big.
so its fine in the second method because we bounded the size of the matrix to a realistic size which is also known at compile time, meaning we can optimize the inverse function to hell.
is that understandable?
@@GeatMasta yes, thank you, much more understandable now. Thanks