Location of Repository

Dynamic Triangulation of Variational Implicit Surfaces using Incremental

By Delaunay Tetrahedralization, B. Crespin and Université Claude Bernard Lyon I


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

Topics: CR Categories, I.3.3 [Computer Graphics, Display algorithms— [I.3.6, Computer Graphics—Interaction Techniques Keywords, Geometric Modelling, Iso-surface Extraction
Year: 2014
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ann.jussieu.fr/~fre... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.