Variational implicit surface meshing

Abstract : In this paper, we propose a new algorithm to mesh implicit surfaces which produces meshes both with a good triangle aspect ratio as well as a good approximation quality. The number of vertices of the output mesh is defined by the end-user. For this goal, we perform a two-stage processing : an initialization step followed by an iterative optimization step. The initialization step consists in capturing the surface topology and allocating the vertex budget. The optimization algorithm is based on a variational vertices relaxation and triangulation update. In addition a gradation parameter can be defined to adapt the mesh sampling to the curvature of the implicit surface. We demonstrate the efficiency of the approach on synthetic models as well as real-world acquired data, and provide comparisons with previous approaches.
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00533568
Contributor : Sébastien Valette <>
Submitted on : Sunday, November 7, 2010 - 6:01:41 PM
Last modification on : Wednesday, December 12, 2018 - 3:26:10 PM
Long-term archiving on : Tuesday, February 8, 2011 - 2:31:42 AM

File

GVPN09SMI.pdf
Files produced by the author(s)

Identifiers

Citation

Arnaud Gelas, Sébastien Valette, Rémy Prost, Wieslaw L Nowinski. Variational implicit surface meshing. Computers and Graphics, Elsevier, 2009, 33 (3), pp.312-320. ⟨10.1016/j.cag.2009.03.016⟩. ⟨hal-00533568⟩

Share

Metrics

Record views

501

Files downloads

487