Triangular Mesh Simplification Based on Bounded Error

Xue Ming Qian; Yan Cao; Xiao Ping Lin

doi:10.4028/www.scientific.net/AMR.411.77

Paper Titles

Structure Design of 2D Convert Probe by Single-Sensor
p.59

Research on Capsule Filling Machine Based on Virtual Prototype
p.64

Design and Research of High-Speed CNC Platform Based on DCG
p.68

A Small Magnetic Driving ECM Machine
p.72

Triangular Mesh Simplification Based on Bounded Error
p.77

Development of Parametric Design System for Disc Cams with Translating Roller Followers
p.83

Static and Dynamic Characteristics Analysis of Precise Composite CNC Grinding Machine
p.88

Study on Nozzle Burning for Engineering Ceramics Machining with Micro-Detonation of Striking Arc
p.97

Study of the Machining Principle and Influencing of Ultrasonic Lapping on SiC Single Crystal
p.102

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 411Triangular Mesh Simplification Based on Bounded...

Triangular Mesh Simplification Based on Bounded Error

Abstract:

The author proposed a triangular mesh simplification algorithm with the methodology of vertex culling, which is based on bounded error. The algorithm includes several steps as follow. Firstly, the algorithm arrays the vertex according to the curvature. The curvature of local area around one vertex reduces in the array. Secondly, for one vertex to be deleted, the bounding box’s height of the local area will be calculated. And the reduction of the bounding box’s height is controlled as restraint of vertex culling. After the vertex culling, triangular mesh reconstruction is conducted on polygon to fill up the hollows formed in the above steps. This algorithm well balanced the deletion rate and deletion error in the experiment.

You might also be interested in these eBooks

Precision Engineering and Non-Traditional Machining

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 411)

Pages:

77-82

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.411.77

Citation:

Cite this paper

Online since:

November 2011

Authors:

Xue Ming Qian, Yan Cao, Xiao Ping Lin

Keywords:

Bounded Error, Curvature, Triangular Mesh, Vertex Culling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Balmelli L, Liebling T, Vetterli M (2003) Computational analysis of mesh simplification using global error. Comp Geom-Theor Appl 25:171–196

DOI: 10.1016/s0925-7721(02)00166-9

Google Scholar

[2] Kim NH, Yoo SK, Lee KS (2003) Polygon reduction of 3D objects using Stokes' theorem. Comput Meth Prog Bio 71:203– 210

DOI: 10.1016/s0169-2607(02)00100-1

Google Scholar

[3] Alvarez R, Noguera JV, Tortosa L, Zamora A (2007) A mesh optimization algorithm based on neural networks. Inform Sciences 177:5347–5364

DOI: 10.1016/j.ins.2007.05.029

Google Scholar

[4] Li WD, Cai YL, Lu WF (2007) A 3D simplification algorithm for distributed visualization. Comput Ind 58:211–226

Google Scholar

[5] Chang IS, Park RH (2003) Range image reconstruction based on robust multiresolution estimation of surface parameters. Comput Vis Image Und 24:1123–1131

DOI: 10.1016/s0167-8655(02)00282-9

Google Scholar

[6] Lee KH, Woo H, Suk T (2001) Data reduction methods for reverse engineering. Int J Adv Manuf Technol 17:735–743

Google Scholar