A Stream Algorithm for the Decimation of Massive Meshes

We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single pass and writes the output to another stream while using only a fixed-sized in-core buffer. By applying randomized multiple choice optimization, we are able to use incremental mesh decimation based on edge collapses and the quadric error metric. The quality of our results is comparable to state-of-the-art highquality mesh decimation schemes (which are slower than our algorithm) and the decimation performance matches the performance of the most efficient out-of-core techniques (which generate meshes of inferior quality). Key words: mesh decimation, massive data, stream processing, multiple-choice optimization

• Type: Conference
• Year: 2003
• Where: GRAPHICSINTERFACE
• Authors: Jianhua Wu, Leif Kobbelt
• Keywords: GRAPHICSINTERFACE 2003, GRAPHICSINTERFACE 2007, Incremental Mesh Decimation, Mesh Decimation, Mesh Decimation Algorithm