There's a summary of methods used on Wikipedia > A general scheme of geometric constraint solving consists of modeling a set of geometric elements and constrai

There's a summary of methods used on Wikipedia > A general scheme of geometric constraint solving consists of modeling a set of geometric elements and constraints by a system of equations, and then solving this system by non-linear algebraic solver. For the sake of performance, a number of decomposition techniques could be used in order to decrease the size of an equation set:[8] decomposition-recombination planning algorithms,[9][10] tree decomposition,[11] C-tree decomposition,[12] graph reduction,[13] re-parametrization and reduction,[14] computing fundamental circuits,[15] body-and-cad structure,[16] or the witness configuration method.[17] https://en.wikipedia.org/wiki/Geometric_constraint_solving https://en.wikipedia.org/wiki/Geometric_constraint_solving