carrier image

Efficient Delaunay Mesh Generation from Sampled Scalar Functions

Goswami, Samrat, Andrew Gillette, and Chandrajit Bajaj

Proceedings, 16th International Meshing Roundtable, Springer-Verlag, pp.495-512, October 14-17 2007

IMR
PROCEEDINGS

16th International Meshing Roundtable
Seattle, Washington, U.S.A.
October 14-17, 2007

Institute for Computational and Engineering Sciences, University of Texas at Austin
Department of Mathematics, University of Texas at Austin
Department of Computer Sciences and Institute for Computational and Engineering Sciences, University of Texas at Austin
[email] samrat@ices.utexas.edu, agillette@math.utexas.edu, bajaj@cs.utexas.edu

Abstract
Many modern research areas face the challenge of meshing level sets of sampled scalar functions. While many algorithms focus on ensuring geometric qualities of the output mesh, recent attention has been paid to building topologically accurate Delaunay conforming meshes of any level set from such volumetric data. In this paper, we present an algorithm which constructs a surface mesh homeomorphic to the true level set of the sampled scalar function. The presented algorithm also produces a tetrahedral volumetric mesh of good quality, both interior and exterior to the level set. The meshing scheme presented substantially improves over the existing algorithms in terms of efficiency. Finally, we show that when the unknown sampled scalar function, for which the level set is to be meshed, is approximated by a specific class of interpolant, the algorithm can be simplified by taking into account the nature of the interpolation scheme so as to circumvent some of the critical computations which tend to produce numerical instability.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article