ACM Home Page
Please provide us with feedback. Feedback
Dynamic triangulation of variational implicit surfaces using incremental Delaunay tetrahedralization
Full text PdfPdf (1.37 MB)
Source Symposium on Volume Visualization archive
Proceedings of the 2002 IEEE symposium on Volume visualization and graphics table of contents
Boston, Massachusetts
SESSION: Reconstruction and triangulation table of contents
Pages: 73 - 80  
Year of Publication: 2002
ISBN:0-7803-7641-2
Author
B. Crespin  LIGIM, Université Claude Bernard Lyon I
Sponsors
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
: IEEE Computer Society Technical Committee on Computer Graphics
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 36,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Akkouche, S., and Galin, E. 2001. Adaptive implicit surface polygonization using marching triangles. Computer Graphic Forum 20, 2, 67-80.
2
3
4
 
5
 
6
 
7
 
8
Boissonnat, J.-D., Devillers, O., and Teillaud, M. 1990. A dynamic construction of higher-order Voronoi diagrams and its randomized analysis. Tech. Rep. 1207, INRIA.
 
9
Crespin, B., Guitton, P., and Schlick, C. 1998. Efficient and accurate tessellation of implicit sweeps. In Proc. of CSG'98 (Set-theoretic Solid Modelling Techniques and Applications), I. Geometers, Ed., 49-63.
 
10
Desbrun, M., Tsingos, N., and Gascuel, M.-P. 1995. Adaptive sampling of implicit surfaces for interactive modeling and animation. In Implicit Surfaces'95 Proceedings, Eurographics, 171-185.
 
11
Duchon, J. 1977. Spline minimizing rotation-invariant seminorms in sobolev spaces. In Constructive Theory of Functions of Several Variables, W. Schempp and K. Zeller, Eds., vol. 571, 85-100.
 
12
 
13
Hartmann, E. 1998. A marching method for the triangulation of surfaces. The Visual Computer 14, 3, 95-108.
 
14
Hilton, A., Stoddart, A., Illingworth, J., and Windeatt, T. 1996. Marching triangles: Range image fusion for complex object modeling. In International Conference on Image Processing.
 
15
16
 
17
 
18
 
19
 
20
Rodrian, H.-C., and Moock, H. 1996. Dynamic triangulation of animated skeleton-based implicit surfaces. In Implicit Surfaces'96 Proceedings, Eurographics, 37-52.
 
21
Shewchuk, J. R., 1999. Lecture notes on delaunay mesh generation (available on citeseer.nj.nec.com/shewchuk99lecture.html).
 
22
Shu, R., Zhou, C., and Kankanhalli, M. 1995. Adaptive marching cubes. The Visual Computer 11, 4, 202-217.
23
 
24
Turk, G., and O'Brien, J. F. 1999. Variational implicit surfaces. Tech. Rep. GIT-GVU-99-15, Georgia Institute of Technology.
 
25
 
26
van Overveld, C., and Wyvill, B. 1993. Shrinkwrap: an adaptive algorithm for polygonizing and implicit surface. Tech. rep., University of Calgary.
27
28
 
29
Wu, S.-T., and de Gomensoro Malheiros, M. 1999. On improving the search for critical points of implicit functions. In Implicit Surfaces.
 
30
Wyvill, G., McPheeters, C., and Wyvill, B. 1986. Data structure for soft objects. The Visual Computer 2, 4, 227-234.