Weighted delaunay refinement for polyhedra with small angles

Proceedings of the 14th International Meshing Roundtable, IMR 2005

Volumn , Issue , 2005, Pages 325-342

  Cheng, S W ^a   Dey, T K ^b   Ray, T ^b  

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

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Computational geometry; Delaunay refinement; Mesh generation; Sliver; Weighted Delaunay triangulation

Indexed keywords

COMPUTATIONAL GEOMETRY; MESH GENERATION; PIECEWISE LINEAR TECHNIQUES; PUMPS;

DELAU-NAY TRIANGULATIONS; DELAUNAY MESHING; DELAUNAY REFINEMENTS; PERIODIC POINTS; PIECEWISE LINEAR; PUMPING METHODS; SLIVER; SMALL INPUTS;

ASPECT RATIO;

EID: 84867995757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-29090-7_20     Document Type: Conference Paper

References (18)

1. D. Cohen-Steiner, E. C. de Verdière and M. Yvinec. Conforming Delaunay triangulations in 3D. Proc. Annu. Sympos. Comput. Geom. (2002), 199-208.
2. H. Edelsbrunner and D. Guoy. An Experimental Study of Sliver Exudation. Engineering With Computers, 18 (2002), 229-240.
3. H. Edelsbrunner, X.-Y. Li, G. Miller, A. Stathopoulos, D. Talmor, S.-H. Teng, A. Ungör, and N. Walkington. Smoothing cleans up slivers. Proc. 32th Annu. ACM Sympos. Theory of Computing, 2000, 273-277.
4. H. Edelsbrunner and N. R. Shah. Incremental topological nipping works for regular triangulations. Algorithmica, 15 (1996), 223-241.
5. X.-Y. Li and S.-H. Teng. Generating well-shaped Delaunay meshes in 3D. Proc. 12th. Annu. ACM-SIAM Sympos. Discrete Algorithm (2001), 28-37.
6. S.-H. Lo. Volume discretization into tetrahedra-II. 3D triangulation by advancing front approach. Computers and Structures, 39 (1991), 501-511.
7. R. Lohner. Progress in grid generation via the advancing front technique. Engineering with Computers, 12 (1996), 186-210.
8. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in higher dimensions. SIAM J. Comput., 29 (2000), 1334-1370.
9. M. Murphy, D. M. Mount and C. W. Gable. A point placement strategy for conforming Delaunay tetrahedralization. Intl. J. Comput. Geom. Appl, 11 (2001), 669-682.
10. S.J. Owen. A survey of unstructured mesh generation technology. Proc. 7th Intl. Meshing Roundtable 1998.
11. S. Pav and N. Walkington. A robust 3D Delaunay refinement algorithm. Proc. Intl. Meshing Roundtable 2004.
12. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18 (1995), 548-585.
13. M.S. Shephard and M.K. Georges. Three-dimensional mesh generation by finite octree technique. Intl. J. Numer. Methods in Engineer., 32 (1991), 709-749.
14. J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. Proc. 14th Annu. ACM Sympos. Comput. Geom. (1998), 86-95.
15. J. R. Shewchuk. Mesh generation for domains with small angles. Proc. 16th Annu. Sympos. Comput. Geom. (2000), 1-10.
16. D. Talmor. Well-spaced points for numerical methods. Report CMU-CS-97-164, Dept. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, Penn., 1997.
17. N.P. Weatherill and O. Hassan. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering, 37 (1994), 2005-2039.
18. http://www.cse.ohio-state.edu/~tamaldey/qualmesh.html