Well-constrained completion and decomposition for under-constrained geometric constraint problems

CSpace > 系统科学研究所

	Well-constrained completion and decomposition for under-constrained geometric constraint problems
	Zhang, Gui-Fang ; Gao, Xiao-Shan
	2006-12-01
发表期刊	INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
ISSN	0218-1959
卷号	16 期号:5-6 页码:461-478
摘要	In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in such a way that the new constraint problem G is well-constrained and the set of equations to be solved simultaneously in order to solve G has the smallest size. We propose a polynomial time algorithm which gives a partial solution to the above problem.
关键词	geometric constraint solving under-constrained completion decomposition
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Theory & Methods ; Mathematics, Applied
WOS记录号	WOS:000242417500006
出版者	WORLD SCIENTIFIC PUBL CO PTE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/27809
专题	系统科学研究所
通讯作者	Zhang, Gui-Fang
作者单位	1.Beijing Forestry Univ, Sch Sci, Beijing 100083, Peoples R China 2.Acad Sinica, KLMM, ISS, AMMS, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Gui-Fang,Gao, Xiao-Shan. Well-constrained completion and decomposition for under-constrained geometric constraint problems[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS,2006,16(5-6):461-478.
APA	Zhang, Gui-Fang,&Gao, Xiao-Shan.(2006).Well-constrained completion and decomposition for under-constrained geometric constraint problems.INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS,16(5-6),461-478.
MLA	Zhang, Gui-Fang,et al."Well-constrained completion and decomposition for under-constrained geometric constraint problems".INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 16.5-6(2006):461-478.