Abstract: A strategy for geometric constraint satisfaction is presented with the application of the concept of case graphics, sparse matrix triangular blocking and nonlinear numerical iteration technologies. The strategy includes several constraint satisfaction technologies, such as representation, identification, decomposition and solution. Furthermore, this strategy supports the decomposition and solution of underconstrained geometric constraints.