A comparison of mesh simplification algorithms

Cignoni, Paolo; Montani, Claudio; Scopigno, Roberto

doi:10.1016/s0097-8493(97)00082-4

Cited by 419 publications

(204 citation statements)

References 33 publications

Supporting

Mentioning

202

Contrasting

Unclassified

Order By: Relevance

“…For thorough survey, an interested reader is referred to consult [3][4][5][6][7]. We discuss here only some most related iterative algorithms.…”

Section: Related Workmentioning

confidence: 99%

Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes

Hussain

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Two simplification algorithms are proposed for automatic decimation of polygonal models, and for generating their LODs. Each algorithm orders vertices according to their priority values and then removes them iteratively. For setting the priority value of each vertex, exploiting normal field of its one-ring neighborhood, we introduce a new measure of geometric fidelity that reflects well the local geometric features of the vertex. After a vertex is selected, using other measures of geometric distortion that are based on normal field deviation and distance measure, it is decided which of the edges incident on the vertex is to be collapsed for removing it. The collapsed edge is substituted with a new vertex whose position is found by minimizing the local quadric error measure. A comparison with the state-of-the-art algorithms reveals that the proposed algorithms are simple to implement, are computationally more efficient, generate LODs with better quality, and preserve salient features even after drastic simplification. The methods are useful for applications such as 3D computer games, virtual reality, where focus is on fast running time, reduced memory overhead, and high quality LODs.

show abstract

“…For thorough survey, an interested reader is referred to consult [3][4][5][6][7]. We discuss here only some most related iterative algorithms.…”

Section: Related Workmentioning

confidence: 99%

Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes

Hussain

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…There have always been strong symbiotic interaction and overlap between the solid modeling community and the computer graphics community. In particular, the complexity of the solid assemblies used in industrial applications has challenged the capabilities of graphics subsystems, motivating research in shape simplification [Rossignac93,Cignoni98], occlusion culling [Navazo03], and geometric compression [Rossignac99]. A similar symbiotic relation with computer vision has regained popularity, as some research efforts in vision were model-based [Besl85] and attempted to extract 3D models from images or video sequences of existing parts or scenes.…”

Section: Evolutionmentioning

confidence: 99%

Solid and Physical Modeling

Rossignac

2007

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

The sections in this article are Introduction Topological Domain Geometric Domain and Representation Schemes Triangle Meshes Curved BReps Constructive Solid Geometry Parameters, Constraints, and Features Variational Geometry Morphological Transformations and Analysis Human‐Shape Interaction Conclusions

show abstract

“…The literature relative to mesh simplification is large [1,2]. The two main categories are the methods based on incremental simplification, such as the well-known Qslim algorithm of Garland and Heckbert [3], and the methods based on partitioning, such as the VSA algorithm of Cohen-Steiner et al [4].…”

Section: Introductionmentioning

confidence: 99%

Aliasing-free simplification of surface meshes

Peyrot

Payan

Antonini

2014

2014 IEEE International Conference on Image Processing (ICIP)

View full text Add to dashboard Cite

We propose in this paper a robust simplification technique, which preserves geometric features such as sharp edges or corners from original surfaces. To achieve this goal, our simplification process relies on a detection tool that enables to preserve the sharp features during the three subsequent steps: a Poisson disk sampling that intelligently reduces the number of vertices of the initial mesh; the meshing of the samples that aligns the edges along the feature lines; and a constrained relaxation step that improves the shape of the triangles of our final simplified mesh. Experimental results show that our method always produces valid meshes without aliasing artifacts, and without giving up the shape fidelity and quality of the mesh elements.

show abstract

A comparison of mesh simplification algorithms

Cited by 419 publications

References 33 publications

Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes

Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes

Solid and Physical Modeling

Aliasing-free simplification of surface meshes

Contact Info

Product

Resources

About