Quality meshing with weighted Delaunay refinement

SIAM Journal on Computing

Volumn 33, Issue 1, 2003, Pages 69-93

  Cheng, Siu Wing ^a   Dey, Tamal K ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Algorithms; Computational geometry; Delaunay triangulation; Mesh quality; Sliver; Tetrahedral mesh generation; Weighted Delaunay refinement

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

DELAUNAY TRIANGULATION; QUALITY MESHING; SLIVER EXUDATION METHOD; TETRAHEDRAL MESH GENERATION; WEIGHTED DELAUNAY REFINEMENT;

FINITE ELEMENT METHOD;

EID: 1842511639     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703418808     Document Type: Article

References (22)

1. N. Amenta, M. Bern, and D. Eppstein, Optimal point placement for mesh smoothing, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 528-537.
2. M. Bern and P. Plassman, Mesh generation, in Handbook of Computational Geometry, J. Sack and J. Urrutia, eds., Elsevier, New York, 2000, pp. 291-332.
3. M. Bern, D. Eppstein, and J. Gilbert, Provably good mesh generation, J. Comput. System Sci., 48 (1994), pp. 384-409.
4. B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom., 9 (1993), pp. 145-158.
5. L. P. Chew, Guaranteed-Quality Triangular Meshes, Technical report TR-98-983, Computer Science Department, Cornell University, Ithaca, NY, 1989.
6. L. P. Chew, Guaranteed-quality Delaunay meshing in 3D, in Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, France, 1997, pp. 391-393.
7. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng, Sliver exudation, J. ACM, 47 (2000), pp. 883-904.
8. T. K. Dey, C. Bajaj, and K. Sugihara, On good triangulations in three dimensions, Internat. J. Comput. Geom. Appl., 2 (1992), pp. 75-95.
9. T. K. Dey and J. Pach, Extremal problems for geometric hypergraphs, Discrete Comput. Geom., 19 (1998), pp. 473-484.
10. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
11. H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, Cambridge, England, 2001.
12. H. Edelsbrunner, X.-Y. Li, G. L. Miller, A. Stathopoulos, D. Talmor, S.-H. Teng, A. Üngör, and N. Walkington, Smoothing cleans up slivers, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 273-277.
13. H. Edelsbrunner and D. Guoy, An experimental study of sliver exudation, in Proceedings of the 10th International Meshing Roundtable, Newport Beach, CA, 2001, pp. 307-316.
14. P. L. George and H. Borouchaki, Delaunay Triangulation and Meshing: Application to Finite Elements, Hernes, Paris, 1998.
15. X.-Y. Li and S.-H. Teng, Generating well-shaped Delaunay meshes in 3D, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, pp. 28-37.
16. D. Talmor, Well-Spaced Points for Numerical Methods, Technical report CMU-CS-97-164, Department of Computer Sciences, Carnegie-Mellon University, Pittsburgh, PA, 1997.
17. G. L. Miller, S-H. Teng, W. Thurston, and S. A. Vavasis, Geometric separators for finite-element meshes, SIAM J. Sci. Comput., 19 (1998), pp. 364-386.
18. S. A. Mitchell and S. A. Vavasis, Quality mesh generation in higher dimensions, SIAM J. Comput., 29 (2000), pp. 1334-1370.
19. J. Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms, 18 (1995), pp. 548-585.
20. J. R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, in Proceedings of the 14th Annual ACM Symposium on Computational Geometry, ACM, New York, 1998, pp. 86-95.
21. G. Strang and G. J. Fix, An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973.
22. S.-H. Teng and C.-W. Wong, Unstructured mesh generation: Theory, practice and perspectives, Internat. J. Comput. Geom. Appl., 10 (2000), pp. 227-266.