Document Type
Conference Paper
Publication Date
2016
DOI
10.1016/j.proeng.2016.11.037
Publication Title
Procedia Engineering
Volume
163
Issue
Special Issue
Pages
136-148
Conference Name
25th International Meshing Roundtable
Abstract
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.
Original Publication Citation
Rashid, T., Sultana, S., & Audette, M. A. (2016). Watertight and 2-manifold surface meshes using dual contouring with tetrahedral decomposition of grid cubes. Paper presented at the 25th International Meshing Roundtable, Arlington, VA.
ORCID
0000-0003-0011-1731
Repository Citation
Rashid, Tanweer; Sultana, Sharmin; and Audette, Michel A., "Watertight and 2-Manifold Surface Meshes Using Dual Contouring With Tetrahedral Decomposition of Grid Cubes" (2016). Computational Modeling & Simulation Engineering Faculty Publications. 10.
https://digitalcommons.odu.edu/msve_fac_pubs/10
Included in
Databases and Information Systems Commons, Graphics and Human Computer Interfaces Commons
Comments
Open access article under a CC-BY-NC-ND license: http://creativecommons.org/licenses/by-nc-nd/4.0/