Skip to Main content Skip to Navigation
Journal articles

Simplified Marching Cubes: an efficient discretization scheme for simulations of deposition/ablation in complex media

Abstract : Surface growth or recession models depend on accurate and efficient descriptions of the moving surface. We propose a simplified alternative to the popular marching cubes algorithm for isosurfacing, in which the surface consists of triangles which are composed from vertices of the regular 3D grid on which the ata to be processed (e.g. the volume of fluid) is defined. Consequently, the new algorithm does not require any interpolation. In contrast with the original method, a switch of the relative status (above or below the threshold value) of vertices does not lead to similar triangle models. The obtained meshes are guaranteed to be manifold, i.e. to be topologically consistent and with no holes. The implementation of the new method is simple. Comparison of both schemes in a random-walk gas diffusion simulation algorithm shows a substantial time improvement with SMC. An example of Chemical Vapor Infiltration modelling is described.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00584763
Contributor : Christian Germain <>
Submitted on : Sunday, April 10, 2011 - 2:38:30 PM
Last modification on : Thursday, February 18, 2021 - 2:10:02 PM

Identifiers

  • HAL Id : hal-00584763, version 1

Citation

Gerard L. Vignoles, Marc Donias, Christianne Mulat, Christian Germain, Jean-François Delesse. Simplified Marching Cubes: an efficient discretization scheme for simulations of deposition/ablation in complex media. Computational Materials Science, Elsevier, 2011, 50 (3), pp.811-1218. ⟨hal-00584763⟩

Share

Metrics

Record views

484