The reduction is carried out by using geometric constraint graph based on the point clusters. Then the sequence of reduction is computed and the geometric model is rebuilded.
该算法基于点簇对约束网络图进行归约，求得归约序列然后重构几何模型，具有求解速度快、可靠性高、应用范围广等优点。
The reduction is carried out by using geometric constraint graph based on the point clusters. Then the sequence of reduction is computed and the geometric model is rebuilded.
该算法基于点簇对约束网络图进行归约，求得归约序列然后重构几何模型，具有求解速度快、可靠性高、应用范围广等优点。
应用推荐