vix.ing · top · new · best · stats · spec

3D Volume Calculation For the Marching Cubes Algorithm in Cartesian Coordinates

2013/08/02 by Shuqiang Wang, Wang, Shuqiang
Computer Science · Engineering · #3D Shape Modeling and Analysis #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #FOS: Mathematics #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.1308.0387

openalex publication_date 2013/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface in the Front Tracking method cuts through the computational cells. A popular method to calculate the volumes of the partial cells is to first partition the cells into tetrahedra and then sum together the volumes of the tetrahedra for the corresponding partial cells. In this paper, the divergence theorem is used to calculate the volumes of the partial cells generated by the Marching Cubes algorithm. This method is both more robust and efficient compared with the tetrahedralization approach.

Related