Issue No. 02 - April-June (1999 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.773803
<p><b>Abstract</b>—This paper investigates the effectiveness of the Memoryless Simplification approach described by Lindstrom and Turk [<ref type="bib" rid="bibV009814">14</ref>]. Like many polygon simplification methods, this approach reduces the number of triangles in a model by performing a sequence of edge collapses. It differs from most recent methods, however, in that it does not retain a history of the geometry of the original model during simplification. We present numerical comparisons showing that the memoryless method results in smaller mean distance measures than many published techniques that retain geometric history. We compare a number of different vertex placement schemes for an edge collapse in order to identify the aspects of the Memoryless Simplification that are responsible for its high level of fidelity. We also evaluate simplification of models with boundaries, and we show how the memoryless method may be tuned to trade between manifold and boundary fidelity. We found that the memoryless approach yields consistently low mean errors when measured by the Metro mesh comparison tool. In addition to using complex models for the evaluations, we also perform comparisons using a sphere and portions of a sphere. These simple surfaces turn out to match the simplification behaviors for the more complex models that we used.</p>
Model simplification, surface approximation, level of detail, geometric error, optimization.
Greg Turk, Peter Lindstrom, "Evaluation of Memoryless Simplification", IEEE Transactions on Visualization & Computer Graphics, vol. 5, no. , pp. 98-115, April-June 1999, doi:10.1109/2945.773803