用于三维几何约束求解的分组重写方法

Study on packet rewriting method for 3D geometric constraint solving

提出一种基于分组重写的解决三维几何约束的方法,原有的算法在解决大型系统几何约束求解时效率较低,系统开销较大,并且由于算法规则的局限性,使得很多复杂系统无法解决,包括三维几何约束问题。该方法提出了两种新的分组表示类型,拓展子集和放射子集,使得分组更加直观,准确,并有效地提高了求解效率,减小了开销,方法在三维领域更能发挥其作用,能够满足计算机辅助造型中集合造型的需求。

A three-dimensional geometric constraint method which based packet rewriting is studied in this article.The origi- nal algorithm of solving large-scale system＇s geometric constraint is inefficient as well the limitations of the rules algorithm, which makes a lot of complex systems problems, including the three-dimensional geometric constraint.The new method pres- ents two new types of groups, called development subset and radiation subset which evaluate the intuition and accuracy.The efficiency is greatly improved, the system overhead is reduced.This method is more useful in the three-dimensional field.The collection of manufacturing can be applied in the computer-aided modeling.