Octree-based decimation of marching cubes surfaces

摘要: The marching cubes (MC) algorithm is a method for generating isosurfaces. It also generates an excessively large number of triangles to represent isosurface; this increases the rendering time. This paper presents decimation reduce generated. Decimation carried out before creating triangles. Four major steps comprise algorithm: surface tracking, merging, crack patching and triangulation. Surface tracking enhanced implementation MC algorithm. Starting from seed point, tracker visits only those cells likely compose part desired isosurface. making up extracted are stored in octree that further processed. A bottom-up approach taken merging containing relatively flat approximating surface. finer details maintained. Cells merged as long error due such operation within user-specified parameter, or cell acquires more than one connected component it. described forces edges smaller lie along larger neighboring cells. overall saving depends both on specified value nature data. Use hierarchical data structure potential incremental representation surfaces. We can generate highly smoothed which be progressively refined decreased.