Solving geometric constraints with genetic simulated annealing algorithm |
| |
Authors: | Liu Sheng-Li Tang Min Dong Jin-Xiang |
| |
Institution: | (1) Department of Computer Science, Zhejiang University, 310027 Hangzhou, China |
| |
Abstract: | This paper applies genetic simulated annealing algorithm (SAGA) to solving geometric constraint problems. This method makes
full use of the advantages of SAGA and can handle under-/over-constraint problems naturally. It has advantages (due to its
not being sensitive to the initial values) over the Newton-Raphson method, and its yielding of multiple solutions, is an advantage
over other optimal methods for multisolution constraint system. Our experiments have proved the robustness and efficiency
of this method.
Project (No. 6001107) supported by the National Science Foundation of Zhejiang Province |
| |
Keywords: | SAGA Geometric constraint solving Variational design |
本文献已被 万方数据 SpringerLink 等数据库收录! |