Improvement of Marching Cubes Algorithm Based on Sign Determination

Traditional Marching Cubes algorithm has the problem of repeating calculation, so that an improved Marching Cubes algorithm is put forward. Boundary voxel is utilized to find adjacent boundary voxel. According to the relationship of edge and edge sign between boundary voxel and adjacent boundary voxel, we transmit intersection on the common face of the boundary voxel to adjacent boundary voxel. If the edge sign of adjacent boundary voxel is not existed, we change the edge sign of the adjacent boundary voxel simultaneously. In that way, we can avoid double counting of the intersection, which is in two adjacent boundary voxels. The two adjacent boundary voxels have common surface on where the edge of the isosurface lies. During the computation of intersection of edge and isosurface, we only compute the edges whose edge signs are null. At the same time, we make use of edge sign to avoid repeating assignment. It speeds up isosurface extraction.