An improved Marching Cube algorithm for 3D data segmentation

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)

摘要

游走立方算法是用于等值面三角剖分的最流行算法之一。该算法基于将数据体划分为基本立方体，随后在每个立方体内进行标准三角剖分。在原始公式中，游走立方算法基于15种基本三角剖分，通过旋转、反射、共轭以及这些操作的组合，从基本剖分中衍生出总共256种基本三角剖分。

程序名称：TRIANGOLATE
目录编号：AENS_v1_0

问题性质
给定在3D规则网格上采样的标量场Μ(x,y,z)，构建与等值ΜIso相关的等值面离散模型，其中等值MiSo定义为满足方程Μ(x,y,z) = ΜIso的点集。

Mendeley数据中CPC存储库中持有的此程序的版本
AENS_v1_0; TRIANGOLATE; 10.1016/j.cpc.2012.09.030

此程序已从贝尔法斯特女王大学（1969-2018年）持有的CPC程序库中导入。