一个几何约束系统分解的新算法

A New Decomposition Algorithm of Geometric Constraints Satisfaction Problem

摘要: 几何约束系统的分解是参数化设计中的关键问题.利用从已知实体出发,使约束变动逐步向外围传播的思想,给出了一个分解陈述式约束系统的算法,其空间和时间复杂度分别为O(n)和O(n²).该算法已经在机械绘图与设计系统GH MDS中得到应用.

Abstract: Solving geometric constraints is a key issue of parametric design. In this paper, an algorithm for decomposing the declarative constraint system is described. The space and time complexity of this algorithm is O(n) and O(n²), respectively. And it has been implemented in a CAD commercial product GH MDS.