Mesh Optimization：（网格优化）.pdfVIP

Mesh Optimization Hugues Hoppe Tony DeRose Tom Duchampy John McDonaldz Werner Stuetzlez University of Washington Seattle, WA 98195 Abstract To solve the mesh optimization problem we minimize an energy function that captures the competing desires of tight geometric fit We present a method for solving the following problem: Given a set and compact representation. The tradeoff between geometric fit and of data points scattered in three dimensions and an initial triangular compact representation is controlled via a user-selectable parameter mesh M , produce a mesh M , of the same topological type as M , 0 0 cr ep . A large value of cr ep indicates that a sparse representation is that fits the data well and has a small number of vertices. Our ap- to be strongly preferred over a dense one, usually at the expense of proach is to minimize an energy function that explicitly models the degrading the fit. competing desires of conciseness of representation and fidelity to We use the input mesh M as a starting point for a non-linear the data. We show that mesh optimization can be effectively used