摘要
融约束网络、自由度分析及图理论为一体，提出了一套关于几何约束满足问题的最大归约算法体系。最大归约理论首次揭示了几何约束系统内在的串、并、耦合机制，为几何约束推理提供了新的方法。
A novel method for geometric constraint reasoning is proposed,with which the maximaldecomposition of a geometrical constraint system can be made, This method represents apractically integrated utilization of the constrain network, analysis of the degree of freedomand the sparse matrix. With maximal reduction, a geometrically constrained system is de-composed into a series of subsystems. The algorithm developed can be used in the fields ofparametric drawing,parametric modelling and assembly.
出处
《华中理工大学学报》
CSCD
北大核心
1995年第6期70-74,共5页
Journal of Huazhong University of Science and Technology
关键词
几何约束满足
几何推理
几何约束系统
CAD
parametric design
geometrical constraint satisfaction
parametric constraint reasoning
