摘要

A method is presented to remesh three-dimensional discrete data surfaces. The originality of the method resides in mimicking heavily the classical adva10ncing front method for quality while always relying on a valid mesh for robustness. Therefore, local operations are applied in a first step to obtain a mesh of appropriate length scale compared to the specified size, and an original procedure has been developed for refinement that automatically degenerates to a surface mesh optimization if the size map has been respected. A valid mesh is then always available during the remeshing procedure.
A new background grid is proposed that relies on a Cartesian mesh for the size distribution. Interpolation is performed very quickly and the size distribution is smoothed out to provide a slowly varying mesh size distribution.
Various numerical results are presented to illustrate the efficiency but mainly the quality and robustness of the method.

  • 出版日期2011-3-25