Quality meshing of polyhedra with small angles

International Journal of Computational Geometry and Applications

Volumn 15, Issue 4, 2005, Pages 421-461

  Cheng, Siu Wing ^a   Dey, Tamal K ^b   Ramos, Edgar A ^c   Ray, Tathagata ^b  

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

^b OHIO STATE UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Delaunay meshing; Delaunay refinement; Polyhedra meshing

Indexed keywords

EID: 24044524199     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195905001774     Document Type: Conference Paper

References (19)

1. M. Bern, D. Eppstein and J. Gilbert, Provably good mesh generation, J. Comput. Syst. Sci. 48 (1994) 384-409.
2. C. Boivin and C. Ollivier-Gooch, Guaranteed-quality triangular mesh generation for domains with curved boundaries, Int. J. Numer. Methods Engin. 55 (2002) 1185-1213.
3. S.-W. Cheng and T. K. Dey, Quality meshing with weighted Delaunay refinement, SIAM J. Comput. 33 (2003) 69-93.
4. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello and S.-H. Teng, Sliver exudation, J. ACM 47 (2000) 883-904.
5. S.-W. Cheng and S.-H. Poon, Graded conforming tetrahedralization with bounded radius-edge ratio, Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (2003), pp. 295-304.
6. L. P. Chew. Guaranteed-quality triangular meshes, Report TR-98-983, Comput. Sci. Dept., Cornell Univ., Ithaca, NY, (1989).
7. L. P. Chew, Guaranteed-quality Delaunay meshing in 3D, in Proc. 13th Ann. ACM Symp. Comput. Geom. (1997), pp. 391-393.
8. D. Cohen-Steiner, E. C. de Verdière and M. Yvinec, Conforming Delaunay triangulations in 3D, Proc. Ann. Symp. Computational Geometry (2002), pp. 199-208.
9. T. K. Dey, C. Bajaj and K. Sugihara, On good triangulations in three dimensions, Int. J. Comput. Geom. 2 (1992) 75-95.
10. H. Edelsbrunner, Geometry and Topology for Mesh Generation (Cambridge Univ. Press, England, 2001).
11. X.-Y. Li and S.-H. Teng, Generating well-shaped Delaunay meshes in 3D, Proc. 12th. Ann. ACM-SIAM Symp. Discrete Algorithm (2001), pp. 28-37.
12. G. L. Miller, D. Talmor, S.-H. Teng and N. Walkington, A Delaunay based numerical method for three dimensions: generation, formulation, and partition, Proc. 27th Ann. ACM Symp. Theory Comput. (1995), pp. 683-692.
13. S. A. Mitchell and S. A. Vavasis, Quality mesh generation in higher dimensions, SIAM J. Comput. 29 (2000) 1334-1370.
14. M. Murphy, D. M. Mount and C. W. Gable, A point placement strategy for conforming Delaunay tetrahedralization, Int. J. Comput. Geom. Appl. 11 (2001) 669-682.
15. S. Pav and N. Walkington, 3D robust Delaunay refinement, 14th Intl. Meshing Roundtable 2005.
16. J. Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms 18 (1995) 548-585.
17. J. R. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proc. 14th Ann. ACM Symp. Comput. Geom. (1998), pp. 86-95.
18. J. R. Shewchuk, Mesh generation for domains with small angles, Proc. 16th Ann. Symp. Comput. Geom. (2000), pp. 1-10.
19. http://www.cse.ohio-state.edu/~tamaldey/qualmesh.html