Fast stellar mesh simplification

Author

Vieira, Antonio W. ; Velho, Luiz ; Lopes, Hélio ; Tavares, Geovan ; Lewiner, Thomas

Author_Institution

Laboratorio Matmidia, Pontificia Univ. Catolica do Rio de Janeiro, Brazil

fYear

2003

fDate

12-15 Oct. 2003

Firstpage

27

Lastpage

34

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.

Keywords

computational geometry; data structures; image coding; mesh generation; topology; data structure; fast stellar mesh simplification algorithm; four-face cluster algorithm; mesh compression; priority queue; probabilistic heuristic; progressive transmission; surface topology; Application software; Clustering algorithms; Computational modeling; Computer graphics; Data structures; Decoding; Reconstruction algorithms; Redundancy; Surface reconstruction; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Graphics and Image Processing, 2003. SIBGRAPI 2003. XVI Brazilian Symposium on

ISSN

1530-1834

Print_ISBN

0-7695-2032-4

Type

conf

DOI

10.1109/SIBGRA.2003.1240988

Filename

1240988