ACM Home Page
Please provide us with feedback. Feedback
Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation
Full text PdfPdf (41.52 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Meshing table of contents
Article No. 75  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Jane Tournois  INRIA
Camille Wormser  ETH Zurich
Pierre Alliez  INRIA
Mathieu Desbrun  Caltech
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 78,   Downloads (12 Months): 205,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531381
What is a DOI?

APPENDICES and SUPPLEMENTS
The auxiliary files include: -three tetrahedral meshes generated by our algorithm, in the .tetmesh format -a readme file describing the .tetmesh format -list_of_meshes.txt describing the main characteristics of the given meshes.


ABSTRACT

We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise smooth surfaces. Building upon recent theoretical and practical advances, our algorithm interleaves Delaunay refinement and mesh optimization to generate quality meshes that satisfy a set of user-defined criteria. This interleaving is shown to be more conservative in number of Steiner point insertions than refinement alone, and to produce higher quality meshes than optimization alone. A careful treatment of boundaries and their features is presented, offering a versatile framework for designing smoothly graded tetrahedral meshes.


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
Acar, U., Hudson, B., Miller, G., and Phillips, T. 2007. SVR: Practical Engineering of a Fast 3D Meshing Algorithm. In Proc. of 16th Int. Meshing Roundtable, 45--62.
2
 
3
 
4
Antani, L., Delage, C., and Alliez, P. 2007. Mesh Sizing with Additively Weighted Voronoi Diagrams. In Proc. of the 16th Int. Meshing Roundtable, 335--346.
 
5
Boissonnat, J.-D., Wormser, C., and Yvinec, M. 2007. Curved Voronoi diagrams. In Effective Comp. Geometry for Curves and Surfaces, Springer, Ed. 67--116.
 
6
Boivin, C., and Ollivier-Gooch, C. 2002. Guaranteed-quality Triangular Mesh Generation for Domains with Curved Boundaries. Int. J. Numer. Methods Eng. 55, 1185--1213.
 
7
Chen, L., and Xu, J. 2004. Optimal Delaunay triangulations. J. of Comp. Mathematics 22, 2, 299--308.
 
8
Chen, L. 2004. Mesh Smoothing Schemes based on Optimal Delaunay Triangulations. In Proc. of the 13th Int. Meshing Roundtable, 109--120.
9
 
10
Cheng, S., Dey, T., and Levine, J. 2007. A Practical Delaunay Meshing Algorithm for a Large Class of Domains. In Proc. of the 16th Int. Meshing Roundtable, 477--494.
 
11
 
12
Chew, L. 1989. Guaranteed-Quality Triangular Meshes. Tech. rep., Dept. of Computer Science, Cornell Univ.
13
 
14
 
15
Freitag, L., and Ollivier-Gooch, C. 1997. Tetrahedral Mesh Improvement using Swapping and Smoothing. Int. J. for Num. Methods in Eng. 40, 21, 3979--4002.
 
16
George, P.-L. 2004. Tetmesh-GHS3D, Tetrahedral Mesh Generator. INRIA User's Manual, INRIA (Institut National de Recherche en Informatique et Automatique), France.
 
17
Klingner, B., and Shewchuk, J. 2007. Aggressive Tetrahedral Mesh Improvement. In Proc. of the 16th Int. Meshing Roundtable, 3--23.
18
 
19
20
 
21
Oudot, S., Rineau, L., and Yvinec, M. 2005. Meshing Volumes Bounded by Smooth Surfaces. In Proc. of the 14th Int. Meshing Roundtable, 203--219.
 
22
Persson, P., and Strang, G. 2004. A Simple Mesh Generator in MATLAB. SIAM Review, 329--346.
 
23
Rineau, L., and Yvinec, M. 2007. Meshing 3D Domains Bounded by Piecewise Smooth Surfaces. In Proc. of the 16th Int. Meshing Roundtable, 443--460.
 
24
Shewchuk, J. 2002. Delaunay Refinement Algorithms for Triangular Mesh Generation. Comp. Geometry: Theory and Applications 22, 1--3, 21--74.
 
25
Shewchuk, J. 2002. What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures. In Proc. of the 11th Int. Meshing Roundtable, 115--126.
 
26
Si, H., 2007. TetGen, A Quality Tetrahedral Mesh Generator and 3-Dimensional Delaunay Triangulator. http://tetgen.berlios.de/.
 
27
Terdiman, P., 2005. OPCODE 3D Collision Detection library. http://www.codercorner.com/Opcode.htm.
 
28
Tournois, J., Alliez, P., and Devillers, O. 2007. Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. In Proc. of the 16th Int. Meshing Roundtable.
 
29
Tournois, J. 2009. Mesh Optimization. PhD thesis, INRIA, Univ. de Nice Sophia Antipolis, France.
 
30
 
31
Wu, J., and Kobbelt, L. 2002. Fast Mesh Decimation by Multiple-Choice Techniques. Vision, Modeling, and Visualization 2002, 241--249.

Collaborative Colleagues:
Jane Tournois: colleagues
Camille Wormser: colleagues
Pierre Alliez: colleagues
Mathieu Desbrun: colleagues