Graded Delaunay decoupling method for parallel guaranteed quality planar mesh generation

SIAM Journal on Scientific Computing

Volumn 30, Issue 4, 2007, Pages 1875-1891

  Linardakis, Leonidas ^a   Chrisochoides, Nikos ^b  

^a VIRGINIA INSTITUTE OF MARINE SCIENCE   (United States)

^b Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Delaunay mesh; Distributed memory computers; Domain decomposition; Mesh generation; Parallel algorithms; Parallel mesh generation

Indexed keywords

DOMAIN DECOMPOSITION METHODS;

DECOUPLING METHODS; DELAUNAY; DELAUNAY MESHES; DISTRIBUTED-MEMORY COMPUTERS; DOMAIN DECOMPOSITIONS; GUARANTEED QUALITY; PARALLEL MACHINE; PARALLEL MESH GENERATION; SUBDOMAIN; TWO-DIMENSIONAL;

MESH GENERATION;

EID: 55549121962     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/060677276     Document Type: Article

References (44)

1. G. E. BLELLOCH, G. L. MILLER, J. C. HARDWICK, AND D. TALMOR, Design and implementation of a practical parallel Delaunay algorithm, Algorithmica, 24 (1999), pp. 243-269.
2. H. BOROUCHAKI, P.-L. GEORGE, F. HECHT, P. LAUG, AND E. SALTEL, Delaunay mesh generation governed by metric specifications, Part I. Algorithms and Part II. Applications, Finite Elem. Anal. Des., 25 (1997), pp. 61-83 and 85-109.
3. H. BOROUCHAKI, F. HECHT, AND P. J. FREY, Mesh gradation control, in Proceedings of the 6th Internationa] Meshing Roundtable, Park City, UT, Sandia National Laboratories, Albuquerque, NM, 1997, pp. 131-141.
4. S.-W. CHENG, T. K. DEY, E. A. RAMOS, AND T. RAY, Quality meshing for polyhedra with small angles, in Proceedings of the 20th Annual ACM Symposium Computational Geometry, Brooklyn, NY, 2004, pp. 290-299.
5. A. CHERNIKOV AND N. CHRISOOHOIDES, Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement, in Proceedings of the 18th Annual International Conference on Supercomputing, Malo, France, ACM, New York, 2004, pp. 48-57.
6. L. P. CHEW, Guaranteed quality triangular meshes, Technical report TR-89-983, Department of Computer Science, Cornell University, Ithaca, NY, 1989.
7. L. P. CHEW, Guaranteed-quality mesh generation for curved surfaces, in Proceedings of the 9th Annual ACM Symposium on Computational Geometry, San Diego, CA, 1993, pp. 274-280.
8. L. P. CHEW, N. CHRISOCHOIDES, AND F. SUKUP, Parallel constrained Delaunay triangulation, in Proceedings of the ASME/ASCE/SES Special Symposium on Trends in Unstructured Mesh Generation, Evanston, IL, 1997, pp. 89-96.
9. N. CHRISOCHOIDES AND D. NAVE, Parallel Delaunay mesh generation kernel, Internat. J. Numer. Methods Engrg., 58 (2003), pp. 161-176.
10. H. L. DE COUGNY AND M. S. SHEPHARD, Surface meshing using vertex insertion, in Proceedings of the 5th International Meshing Roundtable, Pittsburgh, PA, Sandia National Laboratories, Albuquerque, NM, 1996, pp. 243-256.
11. H. L. DE COUGNY AND M. S. SHEPHARD, Parallel volume meshing using face removals and hierarchical repartitioning, Comput. Methods Appl. Mech. Engrg., 174 (1999), pp. 275-298.
12. F. DEISTER, UTREMEL, O. HASAN, AND N. P. WEATHERILL, Fully automatic and fast mesh size specification for unstructured mesh generation, Engrg. with Comput., 20 (2004), pp. 237-248.
13. J. GALTIER, AND P.-L. GEORGE, Prepartitioning as a way to mesh subdomains in parallel, in Proceedings of the 5th International Meshing Roundtable, Pittsburgh, PA, Sandia National Laboratories, Albuquerque, NM, 1996, pp. 107-122.
14. E. G. IVANOV, H. ANDRÄ, AND A. N. KUDRYAVTSEV, Domain decomposition approach for automatic parallel generation of tetrahedral grids, Comput. Methods Appl. Math., 6 (2006), pp. 178-193.
15. C. KADOW AND N. WALKINGTON, Design of a projection-based parallel Delaunay mesh generation and refinement algorithm, in Proceedings of the 4th Symposium on Trends in Unstructured Mesh Generation, USACM, Albuquerque, NM, 2003.
16. G. KARYPIS AND V. KUMAR, MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, Technical report, University of Minnesota, Minneapolis, MN, 1995.
17. C. K. LEE, On curvuture element-size control in metric surface mesh generation, Interna.t. J. Numer. Methods Engrg., 50 (2001), pp. 787-807.
18. X. LI, J.-F. REMACLE, N. CHEVAUGEON, AND M. S. SHEPHARD, Anisotropic mesh gradation control, in Proceedings of the 13th International Meshing Roundtable, Williamsburg, VA, Sandia National Laboratories, Albuquerque, NM, 2004, pp. 401-412.
19. L. LINARDAKIS AND N. CHRISOCHOIDES, Delaunay decoupling method for parallel guaranteed quality planar mesh refinement, SIAM J. Sci. Comput., 27 (2006), pp. 1394-1423.
20. L. LINARDAKIS AND N. CHRISOCHOIDES, Algorithm 870: A static geometric medial axis domain decomposition in 2D Euclidean space, ACM Trans. Math. Software, 34 (2008), pp. 1-28.
21. R. LÖHNER, Extensions and improvements of the advancing front grid generation technique, Comm. Numer. Methods Engrg., 12 (1996), pp. 683-702.
22. R. LÖHNER, Automatic unstructued grid generators, Finite Elem. Anal. Des., 25 (1997), pp. 111-135.
23. R. LÖHNER AND J. R. CEBRAL, Parallel advancing front grid generation, in Proceedings of the 8th International Meshing Roundtable, South Lake Tahoe, CA, Sandia National Laboratories, Albuquerque, NM, 1999.
24. MEDDEC, http://www.cs.wm.edu/~leonl01/meddec/meddec. html.
25. METIS, http://glaros.dtc.umn.edu/gkhomemetis/metis/overview.
26. S. A. MITCHELL, Cardinality bounds for triangulations with bounded minimum angle, in Proceedings of the Sixth Canadian Conference on Computational Geometry, University of Saskatchewan, 1994, pp. 326-331.
27. MVIEW, http://mview.sourceforge.net/.
28. S. J. OWEN AND S. SAIGAL, Neighborhood-based element sizing control for finite element surface meshing, in Proceedings of the 6th International Meshing Roundtable, Park City, UT, Sandia National Laboratories, Albuquerque, NM, 1997.
29. S. J. OWEN AND S. SAIGAL, Surface mesh sizing control, Internat. J. Numer. Methods Engrg., 47 (2000), pp. 497-511.
30. S. E. PAV AND N. J. WALKINGTON, Robust three-dimensional Delaunay refinement, in Proceedings of the 13th International Meshing Roundtable, Williamsburg, VA, Sandia National Laboratories, Albuquerque, NM, 2004.
31. P.-O. PERSSON, PDE-based gradient limiting for mesh size functions, in Proceedings of the 13th International Meshing Roundtable, Williamsburg, VA, Sandia National Laboratories, Albuquerque, NM, 2004, pp. 377-387.
32. P.-O. PERSSON, Mesh size functions for implicit geometries and PDE-based gradient limiting, Engrg. Comput., 22 (2006), pp. 95-109.
33. W. R. QUADROS, S. J. OWEN, M. BREWER, AND K. SHIMADA, Finite element mesh sizing for surfaces using skeleton, in Proceedings of the 13th International Meshing Roundtable, Williamsburg, VA, Sandia National Laboratories, Albuquerque, NM, 2004, pp. 389-400.
34. J. RUPPERT, A new and simple algorithm for quality 2-dimensional mesh generation, in Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, pp. 83-92.
35. J. RUPPERT, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms, 18 (1995), pp. 548-585.
36. R. SAID, N. WEATHERILL, K. MORGAN, AND N. VERHOEVEN, Distributed parallel Delaunay mesh generation, Comp. Methods Appl. Mech. Engrg., 177 (1999), pp. 109-125.
37. SCICLONE, http://www.compsci.wm.edu/SciClone/index. html.
38. J. R. SHEWCHUK, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, in Applied Computational Geometry: Towards Geometric Engineering, Lecture Notes in Comput. Sci. 1148, M. C. Lin and D. Manocha, eds., Springer-Verlag, 1996, pp. 203-222.
39. J. R. SHEWCHUK, Delaunay Refinement Mesh Generation, Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1997. Available as Technical report CMU-CS-97-137.
40. 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.
41. J. R. SHEWCHUK, Delaunay refinement algorithms for triangular mesh generation, Comput. Geom., 22 (2002), pp. 21-74.
42. SHOWME, http://www.cs.cmu.edu/~quake/showme.html.
43. TRIANGLE, http://www.cs.cmu.edu/~quake/triangle.html.
44. J. ZHU, T. BLACKER, AND R. SMITH, Background overlay grid size functions, in Proceedings of the 11th International Meshing Roundtable, Ithaca, NY, Sandia National Laboratories, Albuquerque, NM, 2002, pp. 65-74.