检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘鹤丹[1,2,3] 王成恩[1,2,3]
机构地区:[1]东北大学流程工业综合自动化国家重点实验室,辽宁沈阳110819 [2]东北大学辽宁省复杂装备多学科设计优化技术重点实验室,辽宁沈阳110819 [3]东北大学信息科学与工程学院,辽宁沈阳110819
出 处:《东北大学学报(自然科学版)》2012年第10期1373-1376,共4页Journal of Northeastern University(Natural Science)
基 金:国家高技术研究发展计划项目(2009AA04Z104)
摘 要:针对三维网格等值面抽取中存在的二义性问题,提出三维网格单元等值面梯度抽取法.本算法利用梯度在三维网格单元外表面计算等值点,勾勒等值面轮廓,而后以添加网格内等值点方式明确等值面在网格内部凹凸方向,提出映射后Delaunay三角面片提取法,在二维空间完成等值面抽取.为减少计算及绘制所需存储空间,采用调整步长及合并阈值的方法控制输出三角面片数量.实验结果证明,该算法可一次性抽取等值面准确轮廓,克服了Marching Cubes算法的二义性,生成面片可真实描述三维网格内部等值面走势,通过调整参数保证了等值面精度,降低了存储代价.In order to avoid the ambiguity of isosurface extraction process in 3D mesh, an isosurface extraction algorithm based on gradient in 3D data space was proposed. In this method, contour points were calculated on the surface of the voxel based on gradient step by step. The outline of the isosurface was drew to make sure that the isosurface was concave or convex by adding contour points inside the voxel. The map-Delaunay method was proposed to get triangles of the isosurface in 2D. The step and merge-threshold were used to control the quantity of triangles to decrease the cost of storage. The experiment results showed that with this algorithm, the accurate contour was extracted just for once and the shortcomings of Marching Cubes algorithm was overcome. The isosurface in the voxel could be extracted exactly. The accuracy of the isosurface was ensured, and the cost of storage was reduced by changing the parameters.
关 键 词:可视化 三维网格 等值面抽取 梯度 拓扑二义性 精度
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.207.122