XVI Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'03) Fast Stellar Mesh Simplification S?o Carlos, Brazil October 12-October 15 ISBN: 0-7695-2032-4
This paper introduces 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, in 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.
Citation:
Antônio W. Vieira, Luiz Velho, Hélio Lopes, Geovan Tavares, Thomas Lewiner, "Fast Stellar Mesh Simplification," sibgrapi, pp.27, XVI Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||