Fast Stellar Mesh Simplification
Lists
Only you see this
Abstract
We introduce stellar simplification, a fast implementation of the four-face cluster algorithm. In our version of this mesh simplification scheme, we adopt a probabilistic heuristic that substitutes the priority queue of the original algorithm. This made our version, on average, 40% faster. In our implementation, we adopt a very concise data structure which uses only two arrays of integers to represent the surface topology. We also introduce a new scheme to encode and decode the hierarchy of meshes generated by the simplification algorithm. This scheme can be used for progressive transmission and compression of meshes.
BibTeX
@inproceedings{vieira2003fast,
author = {Antônio Wilson Vieira and Luiz Velho and Hélio Lopes and Geovan Tavares and Thomas Lewiner},
title = {{Fast Stellar Mesh Simplification}},
booktitle = {SIBGRAPI},
year = {2003},
doi = {10.1109/sibgra.2003.1240988},
}Loading related content...