中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Well-constrained completion and decomposition for under-constrained geometric constraint problems

文献类型:期刊论文

作者Zhang, Gui-Fang; Gao, Xiao-Shan
刊名INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
出版日期2006-12-01
卷号16期号:5-6页码:461-478
关键词geometric constraint solving under-constrained completion decomposition
ISSN号0218-1959
英文摘要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.
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:000242417500006
出版者WORLD SCIENTIFIC PUBL CO PTE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/27808]  
专题系统科学研究所
通讯作者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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。