A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

doi:10.1016/j.cad.2005.03.002

CSpace > 系统科学研究所

	A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
	Gao, XS; Lin, Q ; Zhang, GF
	2006
发表期刊	COMPUTER-AIDED DESIGN
ISSN	0010-4485
卷号	38 期号:1 页码:1-13
摘要	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.
关键词	geometric constraint solving parametric CAD general construction sequence basic merge pattern decomposition tree graph algorithm
DOI	10.1016/j.cad.2005.03.002
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Software Engineering
WOS记录号	WOS:000233192700001
出版者	ELSEVIER SCI LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/3091
专题	系统科学研究所
通讯作者	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.