Two Spatial Constraint Solving Algorithms

Analytic solution of a constraint template composed of three points and three planes is presented to enrich the graph-based algorithm. Genetic simulated annealing algorithm (SAGA) is integrated with spatial constraint solving further that not only overcomes the shortcomings of poor extensibility of the graph-based algorithm, but also handles over- and under-constrained systems. In the end, we solve the above constraint problem with SAGA and compare the two algorithms.