Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Optimizing the topological and combinatorial complexity of isosurfaces

Autor
Andujar, C.; Brunet, P.; Chica, A.; Navazo, I.; Rossignac, J.; Vinacua, A.
Tipus d'activitat
Article en revista
Revista
Computer-Aided Design
Data de publicació
2005-07
Volum
37
Número
8
Pàgina inicial
847
Pàgina final
857
DOI
https://doi.org/10.1016/j.cad.2004.09.013 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/12103 Obrir en finestra nova
Resum
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of isosurfaces. Most approaches divide the 3D space into cubes that each occupy the space between eight neighboring samples of a regular lattice. The portion of the isosurface inside a cube may be computed independently of what happens in the other cubes, provided that the constructions for each pair of neighboring cubes ...
Citació
Andújar, C. [et al.]. Optimizing the topological and combinatorial complexity of isosurfaces. "Computer-aided design", Juliol 2005, vol. 37, núm. 8, p. 847-857.
Paraules clau
Handle Removal, Isosurface Extraction, Marching Cubes, Topological Ambiguity, Triangle Meshes
Grup de recerca
ViRVIG - Grup de Recerca en Visualització, Realitat Virtual i Interacció Gràfica

Participants

Arxius