titoli, abstracts, parole chiave >>>
An Improved marching cube algorithm for 3D data segmentation

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.

DOI: 10.1016/j.cpc.2012.09.030


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.
The original formulation of the algorithm suffers from well-known problems of connectivity among triangles of adjacent cubes, which has been solved in various ways. We developed a variant of the marching cube algorithm that makes use of 21 basic triangulations. Triangles of adjacent cubes are always well connected in this approach. The output of the code is a triangulated model of the isosurface in raw format or in VRML (Virtual Reality Modelling Language) format.

Item Type:Article
ID Code:8602
Uncontrolled Keywords:3D imaging, surface triangulation
Subjects:Area 02 - Scienze fisiche > FIS/07 Fisica applicata (a beni culturali, ambientali, biologia e medicina)
Divisions:001 Università di Sassari > 01-a Nuovi Dipartimenti dal 2012 > Scienze Politiche, Scienze della Comunicazione e Ingegneria dell'Informazione
001 Università di Sassari > 01-a Nuovi Dipartimenti dal 2012 > Chimica e Farmacia
Copyright Holders:© 2012 Elsevier B.V.
Deposited On:05 Feb 2013 11:09

I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore

Repository Staff Only: item control page