Collapsing simplification of triangular mesh based on genetic algorithm

Li-ming DUAN; Shang-peng YANG; Xia ZHANG; Hua-qiao REN; Kuan SHEN

doi:10.3788/OPE.20182606.1489

您当前的位置：

首页 >

文章列表页 >

Collapsing simplification of triangular mesh based on genetic algorithm

Information Sciences | 更新时间：2020-07-05

- Collapsing simplification of triangular mesh based on genetic algorithm
- Optics and Precision Engineering Vol. 26, Issue 6, Pages: 1489-1496(2018)
- 作者机构：
  
  1.重庆大学光电技术及系统教育部重点实验室ICT研究中心, 重庆 400044
  2.重庆大学机械工程学院, 重庆 400044
  3.中国科学院重庆绿色智能技术研究院, 重庆 400044
- 作者简介：
- 基金信息：
- DOI：10.3788/OPE.20182606.1489
  CLC： TP751.1
- Received：01 September 2017，
  
  Accepted：30 October 2017，
  
  Published：25 June 2018
- 稿件说明：
移动端阅览
Li-ming DUAN, Shang-peng YANG, Xia ZHANG, et al. Collapsing simplification of triangular mesh based on genetic algorithm[J]. Optics and precision engineering, 2018, 26(6): 1489-1496.
DOI：

Li-ming DUAN, Shang-peng YANG, Xia ZHANG, et al. Collapsing simplification of triangular mesh based on genetic algorithm[J]. Optics and precision engineering, 2018, 26(6): 1489-1496. DOI： 10.3788/OPE.20182606.1489.

摘要

针对处理大数据量的三角网格模型会给计算机带来较大压力的问题，本文提出了一种基于遗传算法的三角形折叠简化方法。先求取三角形重心，用重心的三个坐标值与初始化的三个步长进行计算，得到新点坐标，重复多次得到顶点种群，利用遗传算法求取适应度值最小点，修正后得到最优折叠点，最后依照简化误差对三角形排序并根据输入的简化比进行折叠简化。本文方法的适应度函数采用简化误差和三角形规范化系数之商。采用本文方法对花朵和瓶子的三角网格模型进行简化，体积变化率分别为0.010 6%和0.2%，规范化系数分别提高了11.0%和4.56%，优于其他方法。实验结果表明本文方法在有效简化模型的同时，既能保形又能提升三角形的质量。

Abstract

To solve the problem that the triangular mesh model which deals with large amount of data will bring great pressure to the computer

a triangle collapsing simplification method based on genetic algorithm was proposed in this paper. In this method

the gravity of the triangles was first derived

the new coordinates were calculated by using the three coordinates of the gravity and the three initialized step lengths

the vertex population was obtained through repeating the above operation several times

the minimum point of fitness value was calculated by using genetic algorithm

the optimal collapsing point was obtained after appropriate amendment

and finally

the sequence of the triangles and collapsing simplification were made according to the simplified error and the proportion of input simplification

respectively. The fitness function adopted in this paper was the quotient of the simplified error and the triangle normalization coefficient. The proposed method was used to achieve the simplification of the triangular mesh model of the flower and the vase

whose volume change rates were 0.0106% and 0.2%

respectively. Besides

their normalized coefficients increased by 11.0% and 4.56%

respectively

which were better than the other methods. The experimental results show that the method proposed can not only simplify the model effectively but also remain its shape as well as improve the quality of the triangular.

关键词

Keywords

references

LIU Y, SAPUTRAA, WANGJ, et al.. Automatic polyhedral mesh generation and scaled boundary finite element analysis of STL models[J]. Computer Methods in Applied Mechanics and Engineering, 2017, 313:106-132.

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

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

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

HYUNHO L, MINHO K. Parallel mesh simplification using embedded tree collapsing[J].The Visual Computer, 2016, 32(6-8):967-976.

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

ZHANG Y H, GENG G H, WEI X R.The feature extraction of scattered point cloud valley ridge[J].Opt. Precision Eng., 2015, 23(1):310-318. (in Chinese)

吕书明, 张明磊, 孙树立.基于简化和细分技术的三角形网格拓扑优化方法[J].计算机辅助设计与图形学学报, 2014, 26(08):1225-1231.

LU SH M, ZHANG M L, SUN SH L.A triangular grid topology optimization method based on simplified and subdivided technology[J].Journal of computer aided design and graphics, 2014, 26(8):1225-1231.(in Chinese)

GREG T. Re-tiling polygonal surfaces[J]. ACM SIGGRAPH Computer Graphics, 1992, 26(2):55-64.

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

YUAN X C, WU L SH, CHEN H W.Feature keeping point cloud data compact[J].Opt. Precision Eng., 2015, 23(09):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 & Visualization , Eurographics Association , 2015. http://dl.acm.org/citation.cfm?id=2853227

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

JI ZH P, LIU L G, WANG G J.A simplified algorithm for preserving feature mesh based on cut Angle[J].Journal of Computer Research and Development, 2006, 43(12):2144-2151.(in Chinese)

KENNETH V, BASILE S, PIERRE K, et al..Simplification of meshes with digitized radiance[J]. The Visual Computer, 2015, 31(6):1011-1021.

ZHIGENG P, KUN Z, JIAOYING S. A new mesh simplification algorithm based on triangle collapses[J]. Journal of Computer Science and Technology, 2001, 16(1):57-63.

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

ZHOU Y F, ZHANG C M, HE P.A method for maintaining grid simplification under volume squared measurement[J].Chinese Journal of Computers, 2009, 2(2):203-212.(in Chinese)

段黎明, 吴志芳, 张霞.利用顶点预测方法实现三维网格的保形简化[J].重庆大学学报, 2012, 35(06):15-20.

DUAN L M, WU ZH F, ZAHNG X.The method of vertex prediction is used to simplify the conformal simplification of three-dimensional grid[J].Journal of Chongqing University, 2012, 35(06):15-20.(in Chinese)

易兵, 刘振宇, 谭建荣.边界特征保持的网格模型分级二次误差简化算法[J].计算机辅助设计与图形学学报, 2012, 24(4):427-434.

YI B, LIU Z Y, TAN J R. New Quadric Metric for Simplifying Meshes to Retain the Feature Edge[J].Journal of Computer-Aided Design & Computer Graphics, 2012, 24(4):427-434.(in Chinese)

TIACCI L, CARDONI A. A Genetic Algorithm Approach for Collaborative Networked Organizations Partners Selection[C]. IfipWg 55 Working Conference on Virtual Enterprises , 2017, 380: 503-512. http://link.springer.com/10.1007/978-3-642-32775-9_51

DUAN L M, YANG S P, ZHANG G, et al.. A shape-based inter-layer contours correspondence method for ICT-based reverse engineering[J].PlosOne, 2017, 12(5):1-12.

段黎明, 绍辉, 李中明, 等.高效率的三角网格模型保特征简化方法[J].光学精密工程, 2017, 25(2):460-468.

DUAN L M, SHAO H, LI Z M. Simplification method for feature preserving of efficient triangular mesh model[J].Opt. Precision Eng., 2017, 25(2):460-468. (in Chinese)

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

Views

336

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Establishment and optimization of aerial multispectral field straw mulch quantity inversion model

CAD stereo model multi-source matching for ICF target pose measurement

Simulation of stellar spectrum controlled by fuzzy PID

Research on off-road path optimization algorithm based on Bekker theory improved genetic algorithm

Image correction for high speed scanning confocal laser endomicroscopy

Related Author

LIU Yuanyuan

SUN Yu

GAO Xuebing

WANG Libin

WANG Yueyong

LIU Mengqi

CUI Shuran

CHEN ZhaoJie

Related Institution

Jilin Agricultural Machinery Research Institute

Changchun Agricultural Machinery Research Institute

College of Engineering and Technology， Jilin Agricultural University

College of Information Technology（Institute of Intelligent Agriculture）， Jilin Agricultural University

Joint Laboratory of High Power Laser and Physics， Shanghai Institute of Optics and Fine Mechanics， Chinese Academy of Sciences

AI问答

Address：No.3888 Dong Nanhu Road, Changchun, Jilin, China Postal code：130033
Tel：0431-86176855 Email：gxjmgc@ciomp.ac.cn
Technical support is provided by Beijing Founder electronics co., LTD 吉ICP备11002662号-17 京公网安备11010802024621
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰