Mesh optimization

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). CR Categories and Subject Descriptors: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling.

• Type: Conference
• Year: 1993
• Where: SIGGRAPH
• Authors: Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan McDonald, Werner Stuetzle
• Keywords: Computer Graphics, Initial Triangular Mesh, Mesh, Mesh M, SIGGRAPH 1993