Generating well-shaped d-dimensional Delaunay meshes

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 145-165

  Li, Xiang Yang ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Algorithms; Aspect ratio; Computational geometry; d dimensional meshes; Delaunay triangulation; Mesh generation; Radius edge ratio; Well shaped

Indexed keywords

ALGORITHMS; ASPECT RATIO; PROBLEM SOLVING; THEOREM PROVING;

MESH GENERATION;

COMPUTATIONAL GEOMETRY;

EID: 0037265203     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00437-1     Document Type: Conference Paper

References (14)

1. M. Bern, P. Chew, D. Eppstein, J. Ruppert, Dihedral bounds for mesh generation in high dimensions, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, ACM, 1995, pp. 189-196.
2. Cavendish J.C., Field D.A., Frey W.H. An approach to automatic three-dimensional finite element mesh generation. Internat. J. Numer. Methods Eng. 21:1985;329-347.
3. S.W. Cheng, T.K. Dey, H. Edelsbrunner, M.A. Facello, S.H. Teng, Silver exudation, in: Proc. 15th ACM Symp. on Computational Geometry, 1999, pp. 1-13.
4. Chew L.P. Constrained Delaunay triangulations. Algorithmica. 4:1989;97-108.
5. L.P. Chew, Guaranteed-quality delaunay meshing in 3d (short version), in: 13th ACM Symp. on Computational Geometry, 1997, pp. 391-393.
6. H. Edelsbrunner, X.Y. Li, G. Miller, A. Stathopoulos, D. Talmor, S.H. Teng, A. ÜNgÖR", N. Walkington, Smoothing and cleaning up slivers, in: ACM Symp. on Theory of Computing (STOC00), 2000, pp. 273-277.
7. Edelsbrunner H., Shah N.R. Incremental topological flipping works for regular triangulations. Algorithmica. 15:1996;223-241.
8. X.Y. Li, Sliver-free three dimensional delaunay mesh generation, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 2000.
9. X.Y. Li, S.H. Teng, Sliver-free three dimensional delaunay mesh generation, in: Symp. on Discrete Algorithms (SODA), 2001, pp. 28-37.
10. G.L. Miller, D. Talmor, S.H. Teng, N. Walkington, A delaunay based numerical method for three dimensions: generation, formulation, and partition, in: Proc. 27th Annu. ACM Symp. on Theory and Computing 1995, pp. 683-692.
11. J. Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, in: Third Annu. ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 83-92.
12. J.R. Shewchuk, Delaunay refinement mesh generation, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1997.
13. J.R. Shewchuk, Tetrahedral mesh generation by delaunay refinement, in: 14th Ann. ACM Symp. on Computational Geometry, 1998, pp. 86-95.
14. D. Talmor, Well-spaced points for numerical methods, Ph.D. Thesis, Carnegie Mellon University, 1997.