Watertight and 2-manifold surface meshes using Dual Contouring with tetrahedral decomposition of grid cubes
Rashid, Tanweer, Sharmin Sultana, Michel Audette
Proceedings, 25th International Meshing Roundtable, Elsevier, Science Direct, September 26-30 2016
25th International Meshing Roundtable
Washington DC, U.S.A.
September 26-30, 2016
Tanweer Rashid, Old Dominion University, US, email@example.com
Sharmin Sultana, Old Dominion University, US, firstname.lastname@example.org
Michel Audette, Old Dominion University, US, email@example.com
The Dual Contouring algorithm (DC) is a grid-based process used to generate surface meshes from volumetric data. The advantage of DC is that it can reproduce sharp features by inserting vertices anywhere inside the grid cube, as opposed to the Marching Cubes (MC) algorithm that can insert vertices only on the grid edges. However, DC is unable to guarantee 2-manifold and watertight meshes due to the fact that it produces only one vertex for each grid cube. We present a modified Dual Contouring algorithm that is capable of overcoming this limitation. Our method decomposes an ambiguous grid cube into a maximum of twelve tetrahedral cells; we introduce novel polygon generation rules that produce 2-manifold and watertight surface meshes. We have applied our proposed method on realistic data, and a comparison of the results of our proposed method with results from traditional DC shows the effectiveness of our method.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article