Well-constrained Completion and Decomposition for Under-constrained Geometric Constraint Pr.pdfVIP

下载本文档

0
0
约4.43万字
约 17页
2017-04-06 发布于江苏
举报
版权申诉

Well-constrained Completion and Decomposition for Under-constrained Geometric Constraint Pr.pdf

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Well-constrained Completion and Decomposition for Under-constrained Geometric Constraint Pr

MM Research Preprints, 65–81 KLMM, AMSS, Academia Sinica Vol. 24, December 2005 Well-constrained Completion and Decomposition for Under-constrained Geometric Constraint Problems Xiao-Shan Gao KLMM, Institute of Systems Science, AMSS, Academia Sinica Gui-Fang Zhang School of Sciences, Beijing Forestry University, Beijing 100083, China Abstract. 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 geometric constraint problem G is well-constrained and the set of equations need 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. Keywords. Geometric constraint solving, under-constrained 1. Introduction Geometric constraint solving (abbr. GCS) is one of the key techniques in intelligent and parametric CAD, which allows the user to make modifications to existing designs by changing parametric values. GCS methods may also be used in other fields like computer vision, molecular modelling, robotics, and feature-based design. There are four major approaches to GCS: the numerical approach, the symbolic approach, the rule-based approach, and the graph-based approach. Most existing GCS methods assumed that the problems are well-constrained. This paper will focus on using graph-based algorithms to solve under-constrained problems. The reason behind this research is that a natural way to draw a design figure is to do it incrementally, that is, to add geometric primitives and geometric constraints one by one. After a new primitive or a new constraint is added, it would be better for the constraint solving system to generate the design diagrams. But, before all the necessary constraints are added, the constraint problem is under-constrained. Joan-Arinyo et al proposed that the main problem about under-constrained problems are we