Recent progress in robust and quality Delaunay mesh generation

Journal of Computational and Applied Mathematics

Volumn 195, Issue 1-2, 2006, Pages 8-23

  Du, Qiang ^a   Wang, Desheng ^b,c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b XIANGTAN UNIVERSITY   (China)

^c SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Boundary recovery; Centroidal Voronoi tessellations; Delaunay meshes; Mesh generation; Mesh optimization; Robustness and quality

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

BOUNDARY RECOVERY; CENTROIDAL VORONOI TESSELLATIONS; DELAUNAY MESHES; MESH GENERATION; MESH OPTIMIZATION; ROBUSTNESS AND QUALITY;

ALGEBRA;

EID: 33745261230     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.07.014     Document Type: Article

References (78)

1. Amenta N., Bern M., and Eppstein D. Optimal point placement for mesh smoothing. J. Algorithms 30 (1999) 302-322
2. D'Azevedo E., and Simpson B. On optimal triangular meshes for minimizing the gradient error. Numer. Math. 59 (1991) 321-348
3. Baehmann P., Scott L., Wittchen L., Shephard M., Grice K., and Yerry M. Robust geometrically based, automatic two-dimensional mesh generation. Internat. J. Numer. Methods Engrg. 24 (1987) 1043-1078
4. Bank R. Mesh smoothing using a posteriori estimates. SIAM J. Numer. Anal. 34 (1997) 979-997
5. Barnes E., and Sloane N. The optimal Lattice quantizer in three dimensions. SIAM J. Algebraic Discrete Methods 4 (1983) 30-41
6. Berzins M. A solution-based triangular and tetrahedral mesh quality indicator. SIAM J. Sci. Comput. 19 (1998) 2051-2069
7. Bowyer A. Computing Dirichlet tessellations. Comput. J. 24 (1981) 162-166
8. Borouchaki H., and George P. Aspects of 2-D Delaunay mesh generation. Internat. J. Numer. Methods Engrg. 40 (1997) 1957-1975
9. Borouchaki H., George P., Hecht F., Laug P., and Saltel E. Delaunay mesh generation governed by metric specifications. Part I. Algorithms 25 (1997) 61-83
10. Borouchaki H., George P., and Lo S. Optimal Delaunay point insertion. Internat. J. Numer. Methods Engrg. 39 (1996) 3407-3437
11. Borouchaki H., and Lo S. Fast Delaunay triangulation in three dimensions. Comput. J. Numer. Methods. Engrg. 128 (1995) 153-167
12. Borouchaki H., Patrick L., and George P. Parametric surface meshing using a combined advancing-front generalized Delaunay approach. Internat. J. Numer. Methods Engrg. 49 (2000) 233-259
13. Buscaglia G., and Dari E. Anisotropic mesh optimization and its application in adaptivity. Internat. J. Numer. Methods Engrg. 40 (1997) 4119-4136
14. Chew L. Guaranteed quality mesh generation for curved surfaces. Proceedings of the Ninth Annual Computer Geometry (1993) 274-280
15. Ciarlet P. Finite Element Methods (1975), North-Holland, Amsterdam
16. Q. Du, M. Emelianenko, Uniform convergence of a nonlinear energy-based multilevel quantization scheme, preprint, 2005.
17. Q. Du, M. Emelianenko, Acceleration schemes for computing centroidal Voronoi tessellations, preprint, 2005
18. Q. Du, M. Emelianenko, L. Ju, Convergence properties of the Lloyd algorithm for computing the centroidal Voronoi tessellations, SIAM J. Numerical Analysis, 2005, accepted for publication.
19. Du Q., Faber V., and Gunzburger M. Centroidal Voronoi tessellations: applications and algorithms. SIAM Rev. 41 (1999) 637-676
20. Du Q., and Gunzburger M. Grid generation and optimization based on centroidal Voronoi tessellations. Appl. Comput. Math. 133 (2002) 591-607
21. Du Q., Gunzburger M., and Ju L. Probablistic methods for centroidal Voronoi tessellations and their parallel implementations. J. Parallel Comput. 28 (2002) 1477-1500
22. Du Q., Gunzburger M., and Ju L. Meshfree, probabilistic determination of point sets and support regions for meshless computing. Comput. Methods Appl. Mech. Engrg. 191 (2002) 1349-1366
23. Du Q., Gunzburger M., and Ju L. Constrained centroidal Voronoi tessellations on general surfaces. SIAM J. Sci. Comput. 24 5 (2003) 1499-1506
24. Q. Du, Z. Huang, D. Wang, Mesh and solver coadaptation in finite element methods for anisotropic problems, Numer. Methods for Differential Equations 21 (2005) 859-874.
25. Q. Du, L. Ju, Finite volume methods and spherical centroidal Voronoi tessellations, SIAM J. Numer. Anal., accepted for publication.
26. Du Q., and Wang D. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations. Internat. J. Numer. Methods Engrg. 56 (2003) 1355-1373
27. Du Q., and Wang D. Boundary recovery for three dimensional conforming Delaunay triangulation. Comput. Methods Appl. Mech. Engrg. 193 (2004) 2547-2563
28. Du Q., and Wang D. Constrained boundary recovery for three dimensional Delaunay triangulation. Internat. J. Numer. Methods Engrg. 61 (2004) 1471-1500
29. Q. Du, D. Wang, Mesh optimization based on centroidal Voronoi tessellation, Internat. J. Numer. Anal. Modelling, 2004, accepted for publication.
30. Q. Du, X. Wang, Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation, IEEE Proceedings of Visualization 2004 (VIS2004), Austin, TX, 2004, pp. 43-50.
31. Q. Du, D. Wang, On the optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three dimensional space, Comput. Math. Appl. 49 (2005) 1355-1373.
32. Du Q., and Wang D. Anisotropic centroidal Voronoi tessellations and their applications. SIAM J. Sci. Comput. 26 (2005) 737-761
33. Edelsbrunner H., and Guoy D. Sink insertion for mesh improvement. Internat. J. Foundations Comput. Sci. 13 (2002) 223-242
34. Frey P., and Borouchaki H. Geometric surface mesh optimization. Comput. Visualization Sci. 1 (1998) 113-121
35. Frey P., Borouchaki H., and George P. 3D Delaunay mesh generation coupled with an advancing-front approach. Comput. Methods Appl. Mech. Engrg. 157 (1998) 115-131
36. Frey P., and Marechal L. Fast adaptive quadtree mesh generation. Proceedings of the Seventh International Meshing Roundtable (1998) 211-222
37. A. George, Computer implementation of the finite element method, Ph.D. thesis, Standford University, STAN-CS-71-208, 1971.
38. P. George, Gamanic3d, adaptive anisotropic tetrahedral mesh generator, Technical Report, INRIA, 2002.
39. P. George, H. Borouchaki, Delaunay triangulation and meshing, Application to Finite Elements Methods, Hermès, Paris, 1998.
40. George P., Borouchaki H., and Saltel E. Ultimate robustness in meshing an arbitrary polyhedron. Internat. J. Numer. Methods Engrg. 58 (2003) 1061-1089
41. George P., Hecht F., and Saltel E. Automatic mesh generation with specified boundary. Comput. Methods Appl. Mech. Engrg. 92 (1991) 169-188
42. Gersho A. Asymptotically optimal block quantization. IEEE Trans. Inform. Theory 25 (1979) 373-380
43. Hermeline F. Triangulation automatique d'un polyèdre en dimension. N.R.A.I.R.O. 16 (1982) 211-242
44. Hitschfeld N., Villablanca L., Krause J., and Rivara M.C. Improving the quality of meshes for the simulation of semiconductor devices using Lepp-based algorithms. Internat. J. Numer. Methods Engrg. 58 (2003) 333-347
45. Hoppe H., DeRose T., Duchamp T., McDonald J., and Stuetzle W. Mesh optimization. ACM Comput. Graphics 27 (1993) 19-26
46. Karamete B., Beall M., and Shephard M. Triangulation of arbitrary polyhedra to support automatic mesh generators. Internat. J. Numer. Methods Engrg. 49 (2000) 167-191
47. Knupp P. Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities, I-a framework for surface mesh optimization. Internat. J. Numer. Methods Engrg. 48 (2000) 401-420
48. F. Labelle, J. Shewchuk, Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation, SoCG 2003, San Diego.
49. Lee C. Automatic metric advancing front triangulation over curved surfaces. Eng. Comput. 17 (2000) 48-74
50. Leibon G., and Letscher D. Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. Proceedings of the 16th Annual Symposium on Computational Geometry (HK) (June 2000), ACM, New York 341-349
51. X. Li, Sliver-free three dimensional Delaunay mesh generation, Ph.D thesis, UIUC, 2000.
52. Liu A., and Baida M. How far flipping can go towards 3D conforming/constrained triangulation. Proceedings of the Ninth International Meshing Roundtable (2000)
53. Lloyd S. Least square quantization in PCM. IEEE Trans. Inform. Theory 28 (1982) 129-137
54. Lo S. Volume discretization into tetrahedra-I, Verification and orientation of boundary surfaces. Comput. Structures 36 (1991) 493-500
55. Lo S. Volume discretization into tetrahedra-II, 3D triangulation by advancing front approach. Comput. Structures 36 (1991) 501-511
56. Lohner R. Progress in grid generation via the advancing front technique. Engrg. Comput. 12 (1996) 186-199
57. Lohner R., and Juan C. Generation of non-isotropic unstructured grids via directional enrichment. Internat. J. Numer. Methods Engrg. 49 1 (2000) 219-232
58. Lohner R., and Parikh P. Generation of three-dimensional unstructured grids by the advancing-front method. Internat. J. Numer. Methods Engrg. 8 (1988) 1135-1149
59. MacQueen J. Some methods for classification and analysis of multivariate observations. In: LeCam L., and Neyman J. (Eds). Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, I (1967), University of California 281-297
60. Marcum D., and Weatherill N. Unstructured grid generation using iterative point insertion and local reconnection. AIAA J. 33 9 (1995) 1625
61. Mavriplis D. Directional coarsening and smoothing for anisotropic Navier-Stokes problems. Electron. Trans. Numer. Anal. 6 (1997) 182-197
62. K. Nakahashi, D. Sharov, Direct surface triangulation using the advancing front method, AIAA paper 95-1686-CP, 1995.
63. Newman D. The Hexagon theorem. IEEE Trans. Inform. Theory 28 (1982) 137-139
64. Peraire J., Peiro J., Formaggia L., Morgan K., and Zienkiewicz O. Finite element Euler computations in three dimensions. Internat. J. Numer. Methods Engrg. 26 (1988) 2135-2159
65. Rassineux A. Generation and optimization of tetrahedral meshes by advancing front technique. Internat. J. Numer. Methods Engrg. 41 (1998) 651-674
66. Rippa S. Long and thin triangles can be good for linear interpolation. SIAM J. Numer. Anal. 29 (1992) 257-270
67. Schroeder W., and Shephard M. A combined octree/Delaunay method for fully automatic 3D mesh generation. Internat. J. Numer. Methods Engrg. 29 (1990) 37-55
68. Shephard M., and Georges M. Automatic three-dimensional mesh generation by the finite Octree technique. Internat. J. Numer. Methods Engrg. 32 (1991) 709-749
69. J. Shewchuk, What is a good linear finite element? Interpolation, conditioning, anisotropy and quality measures. CS report, UC Berlekey.
70. Shewchuk J. Tetrahedral mesh generation by Delaunay refinement. 14th Annual ACM Symposium on Computational Geometry (1998) 86-95
71. Schewchuk J. Constrained Delaunay tetrahedralization and provably good boundary recovery. Proceedings of the11th International Meshing Roundtable (2002) 193-204
72. Tchon K., Mohammed K., Francois G., and Ricardo C. Constructing anisotropic geometric metrics using octrees and skeletons. Proceedings of the 12th International Meshing Roundtable (2003) 293-304
73. Thompson J., Soni B., and Weatherill N. Handbook of Grid Generation (1999), CRC Press LLC, Boca Raton, FL
74. Watson D. Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes. Comput. J. 24 (1981) 167-172
75. Weatherill N. The integrity of geometrical boundaries in the two-dimensional Delaunay triangulation. Comput. Appl. Numer. Methods 6 (1990) 101-109
76. Weatherill N., and Hassan O. Efficient three dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. Internat. J. Numer. Methods Engrg. 37 (1994) 2005-2039
77. Wright J., and Jack A. Aspects of three-dimensional constrained Delaunay meshing. Internat. J. Numer. Methods Engrg. 37 (1994) 1841-1846
78. Y. Zhang, C. Bajaj, B. Sohn, 3D Finite Element Meshing from Imaging Data, Comput. Methods Appl. Mech. Eng., 2005, in press.