Delaunay refinement algorithms for triangular mesh generation

Computational Geometry: Theory and Applications

Volumn 22, Issue 1-3, 2002, Pages 21-74

  Shewchuk, Jonathan Richard ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational geometry; Constrained delaunay triangulation; Delaunay refinement; Delaunay triangulation; Triangular mesh generation

Indexed keywords

EID: 31244438495     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00047-5     Document Type: Article

References (32)

1. I. Babuska, A.K. Aziz, On the angle condition in the finite element method, SIAM J. Numer. Anal. 13 (2) (1976)214-226.
2. B.S. Baker, E. Grosse, C.S. Rafferty, Nonobtuse triangulation of polygons, Discrete Comput. Geom. 3 (2) (1988) 147-168.
3. M. de Berg, M. van Kreveld, M. Overmars, O. Schvvarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, 1997.
4. M. Bern, D. Eppstein, Mesh generation and optimal triangulation, in: D.-Z. Du, F. Hwang (Eds.), Computing in Euclidean Geometry, Lecture Notes Series on Computing, Vol. 1, World Scientific, Singapore, 1992, pp. 23-90.
5. M. Bern, D. Eppstein, J.R. Gilbert, Provably good mesh generation, J. Comput. System Sei. 48 (3) (1994) 384-409.
6. A. Bowyer, Computing Dirichlet tessellations, Computer J. 24 (2) (1981) 162-166.
7. G.F. Carey, J.T. Oden, Finite Elements: Computational Aspects, Prentice-Hall, Englewood Cliffs, NJ, 1984.
8. L.P. Chew, Constrained Delaunay triangulations, Algorithmica 4 (1) (1989) 97-108.
9. L.P. Chew, Guaranteed-quality triangular meshes, Tech. Kept. TR-89-983, Department of Computer Science, Cornell University, Ithaca, NY, 1989.
10. L.P. Chew, Guaranteed-quality mesh generation for curved surfaces, in: Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, San Diego, CA, 1993, pp. 274-280.
11. L.P. Chew, Guaranteed-quality Delaunay meshing in 3D, in: Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry, 1997, pp. 391-393.
12. K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1) (1989) 387-421.
13. T.K. Dey, C.L. Bajaj, K. Sugihara, On good triangulations in three dimensions, Internat. J. Comput. Geom. Appl. 2(1) (1992) 75-95.
14. O. Devillers, On deletion in Delaunay triangulations, in: Proceedings of the Fifteenth Annual ACM Symposium on Computational Geometry, 1999, pp. 181-188.
15. R.A. Dwyer, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Algorithmica 2 (2) (1987) 137-151.
16. W.H. Frey, Selective refinement: A new strategy for automatic node placement in graded triangular meshes, Internat. J. Numer. Methods Engrg. 24 (11) (1987) 2183-2200.
17. L.J. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (2) (1985) 74-123.
18. M.T. Jones, P.E. Plassmann, Adaptive refinement of unstructured finite-element meshes, Finite Elements in Analysis and Design 25 (1997) 41-60.
19. C.L. Lawson, Software for C1 surface interpolation, in: J.R. Rice (Ed.), Mathematical Software III, Academic Press, New York, 1977, pp. 161-194.
20. D.-T. Lee, A.K. Lin, Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom. 1(1986) 201-217.
21. D.-T. Lee, B.J. Schachter, Two algorithms for constructing a Delaunay triangulation, Internat. J. Comput. Inform. Sei. 9 (3) (1980) 219-242.
22. G.L. Miller, D. Talmor, S.-H. Teng, Optimal good-aspect-ratio coarsening for unstructured meshes, in: Proceedings of the Eighth Annual ACM Symposium on Discrete Algorithms, New Orleans, LA, 1997, pp. 538-547.
23. G.L. Miller, D. Talmor, S.-H. Teng, N. Walkington, A Delaunay based numerical method for three dimensions: Generation, formulation, and partition, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 683-692.
24. S.A. Mitchell, Cardinality bounds for triangulations with bounded minimum angle, in: Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, Canada, 1994, pp. 326-331.
25. J. Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, Tech. Rept. UCB/CSD 92/694, University of California at Berkeley, Berkeley, CA, 1992.
26. J. Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, in: Proceedings of the Fourth Annual ACM Symposium on Discrete Algorithms, 1993, pp. 83-92.
27. J. Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms 18 (3) (1995)548-585.
28. R. Seidel, Backwards analysis of randomized geometric algorithms, Tech. Rept. TR-92-014, International Computer Science Institute, University of California at Berkeley, Berkeley, CA, 1992.
29. J.R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, in: M.C. Lin, D. Manocha (Eds.), Applied Computational Geometry: Towards Geometric Engineering, First ACM Workshop on Applied Computational Geometry, Lecture Notes in Computer Science, Vol. 1148, Springer-Verlag, Berlin, 1996, pp. 203-222.
30. J.R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, in: Proceedings of the Fourteenth Annual ACM Symposium on Computational Geometry, Minneapolis, MN, 1998, pp. 86-95.
31. J.R. Shewchuk, Mesh generation for domains with small angles, in: Proceedings of the Sixteenth Annual ACM Symposium on Computational Geometry, Hong Kong, 2000, pp. 1-10.
32. D.F. Watson, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, Computer J. 24 (2) (1981) 167-172.