BDBComp
Parceria:
SBC
Marching cubes multiresolução

Sandro Santos AndradeThomas de Araujo Buck

A widespread approach to generating polygonal approximations of iso-surfaces in volume data is the Marching Cubes algorithm. This algorithm, however, has the disadvantage that the quantity of polygons generated is considerable. The Multiresolution Marching Cubes presented here reduces this quantity by a variable size marching cube. The resulting polygonal chain offers a wide spectrum for representing the desired surface.

http://sibgrapi.sid.inpe.br/rep-/dpi.inpe.br/banon/1999/01.14.18.06

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD