Mesh optimization
- 1 September 1993
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same topological type as M0 , that fits the data well and has a small number of vertices. Our approach is to minimize an energy function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number of vertices in an initially dense mesh of triangles).Keywords
This publication has 9 references indexed in Scilit:
- Discrete smooth interpolation in geometric modellingPublished by Elsevier ,2003
- Surface reconstruction from unorganized pointsACM SIGGRAPH Computer Graphics, 1992
- Decimation of triangle meshesACM SIGGRAPH Computer Graphics, 1992
- Re-tiling polygonal surfacesACM SIGGRAPH Computer Graphics, 1992
- Geometrically deformed modelsACM SIGGRAPH Computer Graphics, 1991
- Generalized implicit functions for computer graphicsACM SIGGRAPH Computer Graphics, 1991
- On three-dimensional surface reconstruction methodsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Data structure forsoft objectsThe Visual Computer, 1986
- HomologyPublished by Springer Nature ,1966