An improved Marching Cube algorithm for 3D data segmentation

Published: 01-03-2013| Version 1 | DOI: 10.17632/h22drbmxmm.1
Contributors:
G.L. Masala,
B. Golosio,
Piernicola Oliva

Description

Abstract 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 th... Title of program: TRIANGOLATE Catalogue Id: AENS_v1_0 Nature of problem Given a scalar field Μ(x,y,z) sampled on a 3D regular grid, build a discrete model of the isosurface associated to the isovalue Μ Iso , which is defined as the set of points that satisfy the equation Μ(x,y,z) = Μ Iso . Versions of this program held in the CPC repository in Mendeley Data AENS_v1_0; TRIANGOLATE; 10.1016/j.cpc.2012.09.030 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)

Files