A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
文献类型：期刊论文
| 作者 | Gao, XS ; Lin, Q; Zhang, GF
|
| 刊名 | COMPUTER-AIDED DESIGN
 |
| 出版日期 | 2006 |
| 卷号 | 38期号:1页码:1-13 |
| 关键词 | geometric constraint solving parametric CAD general construction sequence basic merge pattern decomposition tree graph algorithm |
| ISSN号 | 0010-4485 |
| DOI | 10.1016/j.cad.2005.03.002 |
| 英文摘要 | In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently. (c) 2005 Elsevier Ltd. All rights reserved. |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000233192700001 |
| 出版者 | ELSEVIER SCI LTD |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/3090]  |
| 专题 | 系统科学研究所 |
| 通讯作者 | Gao, XS |
| 作者单位 | 1.Acad Sinica, AMSS, Inst Syst Sci, Key Lab Math Mechanizat, Beijing 100080, Peoples R China 2.Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China |
| 推荐引用方式 GB/T 7714 | Gao, XS,Lin, Q,Zhang, GF. A C-tree decomposition algorithm for 2D and 3D geometric constraint solving[J]. COMPUTER-AIDED DESIGN,2006,38(1):1-13. |
| APA | Gao, XS,Lin, Q,&Zhang, GF.(2006).A C-tree decomposition algorithm for 2D and 3D geometric constraint solving.COMPUTER-AIDED DESIGN,38(1),1-13. |
| MLA | Gao, XS,et al."A C-tree decomposition algorithm for 2D and 3D geometric constraint solving".COMPUTER-AIDED DESIGN 38.1(2006):1-13. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。