二维全约束优化算法的研究  

Research on Optimal Algorithm for 2D Full Constraint Solving

作　　者：王刚[1] 姜洪臣[1] 于达仁[1] 赵万生[1] 

机构地区：[1]哈尔滨工业大学,哈尔滨150001

出　　处：《计算机工程》2002年第10期23-25,共3页Computer Engineering

基　　金：国家重点自然科学基金资助项目(59935110)

摘　　要：从工程实际出发，分析了现有的几何约束求解方法中存在的问题，提出了一种新的二维全约束优化算法。该方法采用自由度优先搜索策略生成有向图，用简单推理和代数方程组综合方法求解，较好地解决了满约束求解和过约束判断问题，大大减小了非线性方程组的规模，使得约束问题的求解得到简化，提高了求解效率。Based on analyzing the merits and faults in the geometric constraint satisfaction algorithm for the present, this article puts forward a new optimal algorithm for 2D full constraint. Adopting degree of freedom priority strategy, the algorithm generates the directed graph. This method is efficient enough to solve the full constraint satisfaction and over constraint decision by the way of combining simple reasoning and nonlinear algebraic equations algorithm. At the same time, scale of nonlinear algebraic equations reduced by far in this method, which simplifies the constraint satisfaction algorithm and approves the efficiency.

关 键 词：二维全约束优化算法 几何约束 无向图 有向图 自由度 参数化设计 人工智能 CAD 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]