Fast stellar mesh simplification

Antônio Wilson Vieira; Luiz Velho; Hélio Lopes; Geovan Tavares; Thomas Lewiner

doi:10.1109/SIBGRA.2003.1240988

Geometric Modeling

Fast stellar mesh simplification

Antônio Wilson Vieira, Luiz Velho, Hélio Lopes, Geovan Tavares, Thomas Lewiner

Sibgrapi 2003 (XVI Brazilian Symposium on Computer Graphics and Image Processing): pp. 27-34 (October 2003)

Selected for publication in Computer Graphics Forum

abstract

Abstract

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 that 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.

downloads

Downloads

PDF paper1.6 MB PPT presentation2.1 MB journal versiondoi ↗

cite

BibTeX

@inproceedings{fast_stellar_sibgrapi,
  author        = {Antônio Wilson Vieira and Luiz Velho and Hélio Lopes and Geovan Tavares and Thomas Lewiner},
  title         = {Fast stellar mesh simplification},
  year          = {2003},
  month         = {october},
  booktitle     = {Sibgrapi 2003 (XVI Brazilian Symposium on Computer Graphics and Image Processing)},
  pages         = {27--34},
  publisher     = {IEEE},
  address       = {São Carlos, SP},
  doi           = {10.1109/SIBGRA.2003.1240988},
  url           = {https://thomas.lewiner.org/pdfs/fast_stellar_sibgrapi.pdf}
}