The implementation of a disambiguation marching cubes algorithm

Abstract

This thesis first systematically analyzes a classic surface generation algorithm, the marching cubes algorithm, in computer volume visualization, with emphasis on the mathematical background and the ambiguity problem of the algorithm. A simple and elegant disambiguation algorithm is then described and implemented. Finally, generated data from mathematical functions and real world data from scientific experiment are used to test the original marching cubes algorithm and the disambiguation algorithm

    Similar works