检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:贾晖[1,2] 耿国华[1] 周明全[3] 张建刚[4]
机构地区:[1]西北大学信息科学与技术学院,西安710127 [2]西安邮电大学计算机学院,西安710121 [3]北京师范大学信息科学与技术学院,北京100875 [4]西安热工研究院有限公司电站信息及监控技术部,西安710032
出 处:《计算机工程》2014年第12期229-234,共6页Computer Engineering
基 金:国家自然科学基金资助项目"基于全局优化的破损兵马俑虚拟复原方法研究"(61373117);西安邮电大学青年基金资助项目"三维网格分割算法研究"(103-0457)
摘 要:为解决三维模型分割线提取对离散曲率噪声敏感且时间复杂度普遍较高的问题,提出一种基于曲率约束的三维模型凹区域分割线提取算法。依据离散曲率特征划分出三维模型网格顶点的凹区域,根据曲度值获得凹区域中顶点所连接边的权重,以最小权重边作为瘦化算法的起始边,根据瘦化策略得到三维模型分割线,在凹区域范围内提取分割线,以减少曲率噪声对分割线提取的影响并提高提取效率。实验结果表明,该算法具有较小的时间复杂度,且提取的分割线均满足视觉理论最小化原则。In order to solve the problem that cut-off line extraction is sensitive to the noise of discrete curvature and generally has high time complexity,this paper proposes the algorithm of extracting 3D model concave region cut-off line based on curvature constraints. It classifies the mesh vertex concave regions of 3D model by discrete curvature characteristics,and then obtains the weights of edges which connects the vertexes of concave regions according to curvature degree,finally with the minimum weight edge as the start edge of the thinning algorithm,it eventually gets the 3D model cut-off lines according to thinning strategy. The algorithm is conducted within the concave regions, which reduces the influence of curvature noise on cut-off line extraction and enhances the extraction efficiency. Experimental results show the algorithm has lower time complexity. The extracted cut-off line can meet the minimization principle of visual theory.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117