Elsevier Science Home
Computer Physics Communications Program Library
Full text online from Science Direct
Programs in Physics & Physical Chemistry
CPC Home

[Licence| Download | New Version Template] aens_v1_0.tar.gz(25472 Kbytes)
Manuscript Title: An improved Marching Cubes algorithm for 3D data segmentation
Authors: G.L. Masala, B. Golosio, P. Oliva
Program title: TRIANGOLATE
Catalogue identifier: AENS_v1_0
Distribution format: tar.gz
Journal reference: Comput. Phys. Commun. 184(2013)777
Programming language: C.
Computer: Pentium 4, CPU 3.2 GHz and 3.24 GB of RAM ( 2.77 GHz).
Operating system: Tested on several Linux distribution, but generally works in all Linux-like platforms.
RAM: Approximately 2 MB
Keywords: 3D imaging, Surface triangulation.
PACS: 07.05.Rm.
Classification: 6.5.

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.

Solution method:
The proposed solution is an improvement of the Marching Cube algorithm, which approximates the isosurface using a set of triangular facets. The data volume is divided into logical volumes where the topology of the triangulation is selected through a look-up table, while the metric is computed by linear interpolation.

Running time:
It is dependent on the input data, but the test provided takes 8 seconds.