Premium
Stellar Mesh Simplification Using Probabilistic Optimization
Author(s) -
Vieira Antônio W.,
Lewiner Thomas,
Velho Luiz,
Lopes Hélio,
Tavares Geovan
Publication year - 2004
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2004.00811.x
Subject(s) - computer science , polygon mesh , probabilistic logic , algorithm , simple (philosophy) , heuristic , encode , mathematical optimization , queue , theoretical computer science , artificial intelligence , mathematics , computer graphics (images) , philosophy , biochemistry , chemistry , epistemology , gene , programming language
This paper proposes the stellar mesh simplification method, a fast implementation of the Four‐Face Cluster (FFC) algorithm. In this method, a probabilistic optimization heuristic substitutes the priority queue of the original method, which results in a 40% faster algorithm with the same order of distortion. It extends naturally to a progressive and/or multiresolution scheme for combinatorial surfaces. This work also presents a simple way to encode the hierarchy of the resulting multiresolution meshes. This work also focuses on important aspects for the development of a practical and robust implementation of this simplification technique, and on the analysis of the influence of the parameters.