高效率的三角网格模型保特征简化方法

段黎明; 邵辉; 李中明; 张桂; 杨尚朋

doi:10.3788/OPE.20172402.0460

您当前的位置：

首页 >

文章列表页 >

高效率的三角网格模型保特征简化方法

信息科学 | 更新时间：2020-07-07

- 高效率的三角网格模型保特征简化方法
- Simplification method for feature preserving of efficient triangular mesh model
- 光学精密工程 2017年25卷第2期页码：460-468
- 作者机构：
  
  1.重庆大学光电技术及系统教育部重点实验室ICT研究中心, 重庆 400044
  2.重庆大学机械工程学院, 重庆 400044
- 作者简介：
  
  段黎明(1964-), 男, 四川营山人, 教授, 博士生导师1988年、1998年于重庆大学分别获得硕士、博士学位, 主要从事工业CT技术及应用, 基于工业CT的逆向设计, 网格重建与处理等研究。E-Mail:duanliming163@163.com DUAN Li-ming, E-mail:duanliming163@163.com
  [ "邵辉 (1992-), 男, 安徽合肥人, 硕士研究生, 2014年于重庆大学获得学士学位, 主要研究方向为逆向工程与三角网格处理。E-Mail:cqushaohui@gmail.com" ]
- 基金信息：
  
  国家重大科学仪器设备开发专项(2013YQ030629)
- DOI：10.3788/OPE.20172402.0460
  中图分类号： TH703
- 收稿日期：2016-08-15，
  
  录用日期：2016-10-16，
  
  纸质出版日期：2017-02-25
- 稿件说明：
移动端阅览
段黎明, 邵辉, 李中明, 等. 高效率的三角网格模型保特征简化方法[J]. 光学精密工程, 2017,25(2):460-468.

Li-ming DUAN, Hui SHAO, Zhong-ming LI, et al. Simplification method for feature preserving of efficient triangular mesh model[J]. Optics and precision engineering, 2017, 25(2): 460-468.
段黎明, 邵辉, 李中明, 等. 高效率的三角网格模型保特征简化方法[J]. 光学精密工程, 2017,25(2):460-468. DOI： 10.3788/OPE.20172402.0460.

Li-ming DUAN, Hui SHAO, Zhong-ming LI, et al. Simplification method for feature preserving of efficient triangular mesh model[J]. Optics and precision engineering, 2017, 25(2): 460-468. DOI： 10.3788/OPE.20172402.0460.

摘要

部分三角网格模型因数据量庞大而导致其不便于存储、分析和显示，本文提出了一种结合网格精细化方法的三角形折叠网格简化算法以解决此问题。首先通过

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=small

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=middle

网格细分法确定待折叠三角形三个顶点的修正坐标，并根据修正坐标初步确定折叠点位置，然后引入折叠点的拉普拉斯坐标和原三角形法向信息来更新折叠点位置，最后由三角形折叠后该区域的体积误差和被折叠三角形的平展度共同确定折叠代价，从而使网格优先从较为平坦和特征点较少的区域开始依次进行三角形折叠简化。对多个模型进行了实验测试和数据分析，结果表明该方法能够有效精简网格数据，与3个不同类型的简化方法相比，该方法的简化效率最高，而且能有效保持原网格模型的几何特征并控制简化三角形的质量。

Abstract

Considering that some triangular mesh models are inconvenient for storage

analysis and display due to enormous data volume

a simplification algorithm for triangular collapsed mesh combining with mesh refinement was put forward. In this method

the modified coordinates for three vertexes of the triangle to be collapsed were determined by using the

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=small

http://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=1756530&type=middle

surface subdivision method

and the position of the folding point was preliminarily determined in accordance with the modified coordinates; then the Laplacian coordinate of the folding point and normal information of the original triangle were introduced to update the folding point position; finally

the collapse cost was caculated based on volume error of the area after triangle collapse and flatness of the collapsed triangle

thus enabled the mesh to preferentially carry out collapse simplification from relatively flat area with few feature points. Experimental test and data analysis were established in multiple models

and result indicates that the method can effectively simplify the mesh data. Compared with three simplification methods of different types

the method can achieve the highest simplification efficiency

and can

at the same time

effectively maintain geometric characteristics of the mesh model and control quality of the simplified triangle.

关键词

Keywords

references

张雨禾, 耿国华, 魏潇然.散乱点云谷脊特征提取[J].光学精密工程, 2015, 23(1):310-318.

ZHANG Y H, GENG G H, WEI X R. Valley-ridge feature extraction from point clouds[J]. Opt. Precision Eng., 2015, 23(1):310-318.(in Chinese)

马鑫, 魏仲慧, 何昕, 等.三维枪弹痕点云数据处理及特征提取研究[J].液晶与显示, 2016, 31(9):889-896.

MA X, WEI ZH H, HE X, et al.. Processing and feature extraction for three-dimensional bullet point cloud data[J]. Chinese Journal of Liquid Crystals and Display, 2016, 31(9):889-896.

SCHROEDER W J, ZARGE J A, LORENSEN W E. Decimation of triangle meshes[J]. Computer Graphics, 1992, 26(2):65-70.

TURK G. Re-tiling polygonal surfaces[J]. Computer Graphics, 1992, 26(2):55-64.

袁小翠, 吴禄慎, 陈华伟.特征保持点云数据精简[J].光学精密工程, 2015, 23(9):2666-2676.

YUAN X C, WU L SH, CHEN H W. Feature preserving point cloud simplification[J]. Opt. Precision Eng., 2015, 23(9):2666-2676. (in Chinese)

OZAKI H, KYOTA F, KANAI T. Out-of-core framework for QEM-based mesh simplification[C].Eurographics Symposium on Parallel Graphics and Visualization, Eurographics Association, 2015.

GARLAND M, HECKBERT P S. Surface simplification using quadric error metrics[C]. Proceedings of SIGGRAPH, Los Angeles, USA:Computer Graphics, 1997:209-216.

JIA Q, LIU Y, GU X. Edge collapse mesh simplification algorithm based on detail features preserving[J]. Journal of Computational Information Systems, 2014, 10(7):2883-2890.

计忠平, 刘利刚, 王国瑾.基于割角的保特征网格简化算法[J].计算机研究与发展, 2006, 43(12):2144-2151.

JI ZH P, LIU L G, WANG G J.Feature preserving mesh simplification based on corner cutting[J]. Journal of Computer Research and Development, 2006, 43(12):2144-2151.(in Chinese)

ZHOU M D, MICHAEL Y W. Engineered model simplification for simulation based structural design[J]. Computer Aided Design and Applications, 2012, 9(1):87-94.

董艳, 张志毅, 杨客.基于顶点重要度的保形网格简化方法研究[J].计算机工程与设计, 2013, 34(5):1889-1895.

DONG Y, ZHANG ZH Y, YANG K. Research of algorithm for shape preserving triangular mesh simplification based on important degree[J]. Computer Engineering and Design, 2013, 34(5):1889-1895. (in Chinese)

DASSI F, ETTINGER B, PEROTTO S, et al.. A mesh simplification strategy for a spatial regression analysis over the cortical surface of the brain[J]. Applied Numerical Mathematics, 2015, 90(C):111-131.

HAMANN B. A data reduction scheme for triangulated surfaces[J]. Computer Aided Geometric Design, 1994, 11(2):179-214.

SHAFAE M, PAJAROLA R. DStrips:Dynamic triangle strips for real-time mesh simplification and rendering[C]. 11th Pacific Conference on Computer Graphics and Applications, 2003:271-280.

PAN Z, ZHOU K, SHI J. A new mesh simplification algorithm based on triangle collapses[J]. Journal of Computer Science and Technology, 2001, 16(1):57-63.

CHEN J, SHI X. Real-time LOD algorithm based on triangle collapse optimization[C]. Proceedings of the 7th International Conference on Computational Intelligence and Security, Washington, D. C., USA, 2011:312-315.

周元峰, 张彩明, 贺平.体积平方度量下的特征保持网格简化方法[J].计算机学报, 2009, 32(2):203-212.

ZHOU Y F, ZHANG C M, HE P. Feature preserving mesh simplification algorithm based on square volume measure[J]. Chinese Journal of Computers, 2009, 32(2):203-212.(in Chinese)

张霞, 段黎明, 刘璐.保持特征的高质量三角网格简化方法[J].计算机集成制造系统, 2014, 20(3):486-493.

ZHANG X, DUAN L M, LIU L. High quality triangular mesh simplification with feature-preserving[J]. Computer Integrated Manufacturing Systems, 2014, 20(3):486-493. (in Chinese)

KOBBELT L. Subdivision[J]. Proceedings of ACM SIGGRAPH, 2000, 18(1):103-112.

ZHOU K, HUANG J, SNYDEJ R J, et al.. Large mesh deformation using the volumetric graph Laplacian[J]. ACM Transactions on Graphics (TOG), 2005, 24(3):496-503.

吴禄慎, 史皓良, 陈华伟.基于特征信息分类的三维点数据去噪[J].光学精密工程, 2016, 24(6):1465-1473.

WU L SH, SHI H L, CHEN H W. Denoising of three-dimensional point data based on classification of feature information[J]. Opt. Precision Eng., 2016, 24(6):1465-1473.(in Chinese)

赵九龙, 马瑜, 李爽, 等.三维医学图像的混合噪声去除方法[J].液晶与显示, 2015, 30(2):340-346.

ZHAO J L, MA Y, LI SH, et al.. Mixed noise removing method for three-dimensional medical images[J]. Chinese Journal of Liquid Crystals and Display, 2015, 30(2):340-346.(in Chinese)

ZHAO W, GAO S M, LIN H W. A robust hole-filling algorithm for triangular mesh[J]. The Visual Computer, 2007, 23(12):987-997.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

三角网格模型的特征保持混合折叠简化

基于遗传算法的三角网格折叠简化