Probing for Surface Mesh Generation through Delaunay Refinement - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2012

Probing for Surface Mesh Generation through Delaunay Refinement

(1) , (1)
1
Hugo Férée
Pierre Alliez

Abstract

Surface mesh generation through Delaunay refinement is considered as a relevant alternative to the common marching cubes algorithm. One distinctive feature lies into the fact that it interleaves shape probing (through intersection with Voronoi edges) with refinement. The current implementations require seeding the refinement procedure for each connected component so as to guarantee that all components are properly discovered by the mesh refinement procedure. This task is often left to the user. Although this is an easy task for input polyhedral surfaces, it is not when the input surface is defined as an isovalue of an implicit function. In this report we propose an automatic seeding procedure which interleaves refinement, seeding and initialization steps with the qualities of the refinement and the guarantees of careful seeding.
Fichier principal
Vignette du fichier
RR-8123.pdf (2.59 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00747344 , version 1 (31-10-2012)

Identifiers

  • HAL Id : hal-00747344 , version 1

Cite

Hugo Férée, Pierre Alliez. Probing for Surface Mesh Generation through Delaunay Refinement. [Research Report] RR-8123, INRIA. 2012. ⟨hal-00747344⟩
260 View
130 Download

Share

Gmail Facebook Twitter LinkedIn More