对象族拓扑约束求解的研究  

Study of topological constraints solving for families of objects

作　　者：孙立镌[1] 马爱玲[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《计算机工程与应用》2008年第35期43-45,49,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.60173055~~

摘　　要：针对当前对象族模型在求解拓扑约束时存在的缺陷,提出一种求解拓扑约束的新方法,这种方法在求解拓扑约束时,把拓扑约束映射为布尔约束满足问题,通过用SAT求解器求解布尔约束来求解拓扑约束。实践证明,该方法不仅直接关联与拓扑约束指定的特征的语义,而且当模型中存在大量相交的特征时也是可行的,提高了拓扑约束求解的效率。According to the limitation of the current families of objects modeling system＇s constraint resolution mechanism for topological constraints.This paper presents a new technique that solves topological constraints.The system of topological constraints is mapped to a Boolean constraint satisfaction problem.The topological constraints is solved by solving this problem using a SAT solver.The study on the solving topological constraints is a new,interesting development in CAD and has great significance.

关 键 词：对象族 拓扑约束 布尔约柬 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]