Solving Geometric Constraints with Niche Genetic Simulated Annealing Algorithm

摘要：

This paper proposes a novel algorithm to solve thegeometric constraint solving, which integrates the nichealgorithm (NA) well with the simulated annealingalgorithm (SAGA). This method makes full use of theadvantages of SAGA and NA. It can handle the under-/over-constraint problems naturally. NA can make thisalgorithm find all the solutions for the multi-solutionconstraint system. SAGA can make this algorithm solvethe constraint equations robustly. Our experiments haveproved the robustness and efficiency of this method.

作者: LIU Sheng-Li TANG Min CHOU Shang-Ching DONG Jin-Xiang

作者单位: State Key Laboratory of CAD&CG,AI Institute,ZheJiang University,HangZhou 310027,China State Key Laboratory of CAD&CG,AI Institute,ZheJiangUniversity,HangZhou 310027,China;Department of C Department of Computer Science,Wichita State University,Wichita,KS 67260-0083,USA

会议类型: 国际会议

会议名称: The 8th International Conference on Computer Supported Cooperative Work in Design(第八届计算机支持的协同工作设计国际会议)(CSCWD2004)

会议地点: 厦门

会议语种:英文

页码: 679-684

在线出版日期: 2004-05-26（万方平台首次上网日期，不代表论文的发表时间）