Stellar mesh simplification using probabilistic optimization

Stellar mesh simplification using probabilistic optimization
Antônio Wilson Vieira, Thomas Lewiner, Luiz Velho, Hélio Lopes, Geovan Tavares

Abstract:

This paper proposes the Fast Stellar mesh simplification, a fast implementation of the Four-Face Cluster algorithm. In this method, a probabilistic optimization heuristic substitutes the priority queue of the original Four-Face Cluster, which results in a 40% faster algorithm with the same order of distortion. It extends naturally to a progressive and/or multi-resolution scheme for combinatorial surfaces This work also presents a simple way to encode the hierarchy of the multi-resolution meshes. A very significant objective of this work is to point out important aspects to be considered when developing a practical and robust implementation of this simplification technique, and analyses the influence of the parameters.

Downloads:

PDF paper (6.4 MB)

BibTeX:

@article{fast_stellar_cgf,
    author = {Antônio Wilson Vieira and Thomas Lewiner and Luiz Velho and Hélio Lopes and Geovan Tavares},
    title = {Stellar mesh simplification using probabilistic optimization},
    year = {2004},
    month = {october},
    journal = {Computer Graphics Forum},
    volume = {23},
    number = {4},
    pages = {825--838},
    publisher = {Eurographics},
    doi = {10.1111/j.1467-8659.2004.00811.x},
    url = {\url{http://thomas.lewiner.org/pdfs/fast_stellar_cgf.pdf}}
}