I wonder how is it achieved, and how well does it work when positions of points are not connected by reasonably smooth functions.
I wonder how is it achieved, and how well does it work when positions of points are not connected by reasonably smooth functions.
Or you could be lazy and just throw an off-the-shelf optimizer at it.
It is a very nice idea though.
It seems to be based on numeric.js, which is based on the classic Fortran UNCMIN [1] optimizer.
It feels to me like there's also quite a bit of temporal coherence that could be leveraged in order to accelerate the process.
There are many methods of modelling and solving inverse kinematics problems. The most flexible of these methods typically rely on iterative optimization to seek out an approximate solution, due to the difficulty of inverting the forward kinematics equation and the possibility of an empty solution space. The core idea behind several of these methods is to model the forward kinematics equation using a Taylor series expansion, which can be simpler to invert and solve than the original system.