A great explanation of the Marching Cube algorithm is here. The algorithm’s goal is to draw meshes of an implicit surface function $latex f(x,y,z) = threshold$. Based on the 8 corner points for each tiny cube is above or below the threshold, the mesh triangles for the cube can be easily determined. The algorithm then just iterates over each cube to finish the visualization, thus, the name marching cube.
Marching cube
Posted on