Solving geometric constraints with niche genetic simulated annealing algorithm

This paper proposes a novel algorithm to solve the geometric constraint solving, which integrates the niche algorithm (NA) well with the simulated annealing algorithm (SAGA). This method makes full use of the advantages of SAGA and NA. It can handle the under-/over-constraint problems naturally. NA can make this algorithm find all the solutions for the multi-solution constraint system. SAGA can make this algorithm solve the constraint equations robustly. Our experiments have proved the robustness and efficiency of this method.