Decreasing isosurface complexity via discrete fitting
References (0)
Cited by (17)
A marching cube algorithm based on edge growth
2021, Virtual Reality and Intelligent HardwareA software tool for visualization of molecular face (VMF) by improving marching cubes algorithm
2014, Computational and Theoretical ChemistryCitation Excerpt :Gordon and Udupa [47] reported a surface detection algorithm which tracked a specified surface of a 3-D object by visiting each boundary face in the surface twice. Montani and cooperators [48,49] proposed an evolution of MC which assumed discretization of the dataset space and replaced cell edge interpolation by midpoint selection. Vignoles and coworkers [50] proposed an algorithm which was called simplified marching cubes (SMC).
Simplified patterns for extracting the isosurfaces of solid objects
2008, Image and Vision ComputingA survey of the marching cubes algorithm
2006, Computers and Graphics (Pergamon)Citation Excerpt :Such facets can be merged, reducing the mesh size and resulting in lower memory consumption and possibly faster mesh rendering. The DMC positional imprecision can be improved by repositioning all intersection points unaffected by the facet merging to the positions described by the linear interpolation scheme of the standard MC [67]. The deformed cubes (DC) [137] also produces a different triangulation.
Optimal isosurface Extraction
2005, Visualization HandbookAn octree-based multiresolution hybrid framework
2004, Future Generation Computer SystemsCitation Excerpt :Finally, conclusions and future work are given in Section 7. Our study has been restricted to volume data sampled in 3D regular grids and to fitted surfaces reconstructed from volume data by the Discretized Marching Cubes (DiscMC) [18,19]. The DiscMC has been considered, and not the Marching Cubes [14], to reduce the number of facets defining the isosurface.