Abstract: A three-dimensional geometric constraint method which based packet rewriting is studied in this article.The original 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 presents 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.