Solve an admitted world-space chain by CCD or FABRIK with a positive safe-integer iteration budget, default 10, and a 1e-6 metre residual early-out. Blend positions and shortest-arc rotations by influence, then recompose the tip subtree. Iterative solvers ignore pole and apply no anatomical ROM; failed later writes may follow earlier mutations.
Solve an admitted world-space chain by CCD or FABRIK with a positive safe-integer iteration budget, default 10, and a 1e-6 metre residual early-out. Blend positions and shortest-arc rotations by influence, then recompose the tip subtree. Iterative solvers ignore pole and apply no anatomical ROM; failed later writes may follow earlier mutations.