towards an homogeneous handling of under-constrained and well-constrained systems of geometric constraints
Most of the geometric constraints solvers consider systems of constraints well-constrained modulo the rigid motions group, and either halt on error when they encounter under-constrained sub-systems, or attempt to add parameterized constraints so as to get rid of the under-constriction. We studied transformations groups making well-constrained some problems that are usually considered as under-constrained. This leads to new algorithms which allow an homogeneous handling of systems of geometric constraints and thus a better adaptation to the needs of the user.
invariance under transformations groups geometric constraints solving under-constraint