| 对象族拓扑约束求解的研究 |
| |
| 引用本文： | 孙立镌,马爱玲. 对象族拓扑约束求解的研究[J]. 计算机工程与应用, 2008, 44(35): 43-45. DOI: 10.3778/j.issn.1002-8331.2008.35.013 |
| |
| 作者姓名： | 孙立镌 马爱玲 |
| |
| 作者单位： | 哈尔滨理工大学,计算机科学与技术学院,哈尔滨,150080;哈尔滨理工大学,计算机科学与技术学院,哈尔滨,150080 |
| |
| 摘 要： | 针对当前对象族模型在求解拓扑约束时存在的缺陷，提出一种求解拓扑约束的新方法，这种方法在求解拓扑约束时，把拓扑约束映射为布尔约束满足问题，通过用SAT求解器求解布尔约束来求解拓扑约束。实践证明，该方法不仅直接关联与拓扑约束指定的特征的语义，而且当模型中存在大量相交的特征时也是可行的，提高了拓扑约束求解的效率。
|
| 关 键 词： | 对象族 拓扑约束 布尔约束 |
| 收稿时间： | 2008-05-26 |
| 修稿时间： | 2008-8-11 |
Study of topological constraints solving for families of objects |
| |
| SUN Li-quan,MA Ai-ling. Study of topological constraints solving for families of objects[J]. Computer Engineering and Applications, 2008, 44(35): 43-45. DOI: 10.3778/j.issn.1002-8331.2008.35.013 |
| |
| Authors: | SUN Li-quan MA Ai-ling |
| |
| Affiliation: | College of Computer Science & Technology，Harbin University Science Technology，Harbin 150080，China |
| |
| Abstract: | 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. |
| |
| Keywords: | families of objects topological constraints boolean constraints |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
