A Robust and Topological Correct Marching Cube Algorithm Without Look-Up Table

In this paper, we proposed an improved version of the marching cube algorithm which gives a topologically correct triangular approximation of the isosurface for any cube configuration. First, a classification and characterization of critical points on the isosurface of trilinear functions is studied in detail. Then, unlike the past work on marching cube algorithm, a robust triangulation strategy without using the conventional look-up table and complementary and rotation operations is presented. Our algorithm is adaptive to the small changes of the data or the small changes of the threshold, and obtains more reasonable result of triangulation of isosurface than those produced by standard MC algorithm