@inproceedings{Hoppe:1993:MO,
optnote = {},
optorganization = {},
author = {Hughes Hoppe and Tony DeRose and Tom Duchamp and John McDonald and
Werner Stuetzle},
optkey = {},
series = CGPACS,
optannote = {},
editor = {James T. Kajiya},
url = {http://research.microsoft.com/~hoppe/#meshopt},
address = {New York},
localfile = {papers/Hoppe.1993.MO.pdf},
publisher = {ACM Press/ACM SIGGRAPH},
doi = {http://doi.acm.org/10.1145/166117.166119},
optmonth = {},
citeseer = {http://citeseer.nj.nec.com/hoppe93mesh.html},
optcrossref = {},
booktitle = SIGGRAPH93,
optstatus = {OK},
optvolume = {},
optnumber = {},
title = {{M}esh {O}ptimization},
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 tominimize an energy function that
explicitlymodels 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).},
year = {1993},
pages = {1926},
}
