Masala, Giovanni Luca Christian and Golosio, Bruno and Oliva, Piernicola (2013) An Improved marching cube algorithm for 3D data segmentation. Computer Physics Communications, Vol. 184 (3), p. 777-782. eISSN 1879-2944. Article.
Full text not available from this repository.
The marching cube algorithm is one of the most popular algorithms for isosurface triangulation. It is based on a division of the data volume into elementary cubes, followed by a standard triangulation inside each cube. In the original formulation, the marching cube algorithm is based on 15 basic triangulations and a total of 256 elementary triangulations are obtained from the basic ones by rotation, reflection, conjugation, and combinations of these operations.
I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore
Repository Staff Only: item control page