Dynamic triangulation of variational implicit surfaces using incremental Delaunay tetrahedralization

  • Authors:
  • B. Crespin

  • Affiliations:
  • LIGIM, Université Claude Bernard Lyon I

  • Venue:
  • VVS '02 Proceedings of the 2002 IEEE symposium on Volume visualization and graphics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a novel method to triangulate variational implicit surfaces. The core of the algorithm is an incremental Delaunay tetrahedralization of the constraint points defining the surface; it can be refined over time by adding new points around the surface as needed. Each tetrahedron that crosses the surface can then be triangulated to locally approximate the surface. This method allows getting several meshes of the same shape at different resolutions, which can be updated dynamically when adding new constraint points. This level-of-detail property makes variational surfaces more appealing for applications such as interactive modeling.