首页 | 官方网站   微博 | 高级检索  
     

密集标志点集的拓扑保持变换方法*
引用本文:刘霞,杨烜.密集标志点集的拓扑保持变换方法*[J].计算机应用研究,2010(12):4394-4397.
作者姓名:刘霞  杨烜
作者单位:LIU Xian-guo1, SUN Li-juan1, DING Bo1,WANG Li-hong2
基金项目:国家自然科学基金资助项目(60173055)
摘    要:在对自由特征模型参数化基础上,提出一种约束求解的新方法。该方法对自由特征形体定义点进行参数化,建立几何约束图,将约束问题分解为三角形约束和四面体约束两大类,分别进行求解,定义手向性规则,利用该规则将子问题组合为全局解。在自主开发的HUST-CAIDS(哈尔滨理工大学计算机辅助工业设计系统)中实现了本算法,并得到满足设计者需求的模型。

关 键 词:自由特征    约束求解    参数化

Preserving-topology transformation based on densely landmarks
LIU Xi,YANG Xuan.Preserving-topology transformation based on densely landmarks[J].Application Research of Computers,2010(12):4394-4397.
Authors:LIU Xi  YANG Xuan
Affiliation:(College of Computer Science & Software Engineering, Shenzhen University, Shenzhen Guangdong 518060, China)
Abstract:This paper proposed a new technology of constraint resolving based on parameterization of freeform feature model. In this method, parameterized freeform feature definition point, established geometry constraint graph, decomposed constraint problem into triangle constraint and tetrahedron constraint, and solved each of them, constructed sub-problem as global result by using handedness rule. This arithmetic was implemented in the HUST-CAIDS, and the result model can meet designer requirement.
Keywords:freeform feature  constraint solving  parameterization
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号