Algorithm 872: Parallel 2D constrained Delaunay mesh generation

ACM Transactions on Mathematical Software

Volumn 34, Issue 1, 2008, Pages

  Chernikov, Andrey N ^a   Chrisochoides, Nikos P ^a  

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

Author keywords

Delaunay triangulation; Mesh generation; Parallel refinement

Indexed keywords

DELAUNAY TRIANGULATION; PARALLEL REFINEMENT; SINGLE-NODE PERFORMANCES;

CONSTRAINED OPTIMIZATION; MESH GENERATION; PROBLEM SOLVING; SEQUENTIAL SWITCHING;

PARALLEL ALGORITHMS;

EID: 38749143720     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1322436.1322442     Document Type: Article

References (53)

1. BARKER, K., CHERNIKOV, A., CHRISOCHOIDES, N., AND PINGALI, K. 2004. A load balancing framework for adaptive and asynchronous applications. IEEE Trans. Paral. Distrib. Syst. 15, 2, 183-192.
2. BLELLOCH, G. E., HARDWICK, J., MILLER, G. L., AND TALMOR, D. 1999. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 24, 243-269.
3. BLELLOCH, G. E., MILLER, G. L., AND TALMOR, D. 1996. Developing a practical projection-based parallel Delaunay algorithm. In 12th Annual Symposium on Computational Geometry. 186-195.
4. BOWYER, A. 1981. Computing Dirichlet tesselations. Comput. J. 24, 162-166.
5. CGAL EDITORIAL BOARD. 2006. CGAL-3.2 User and Reference Manual, http://www.cgal.org/manual/3.3/doc_html/cgal_manual/ contents.html.
6. CHERNIKOV, A. N. AND CHRISOCHOIDES, N. P. 2004a. Parallel guaranteed quality planar Delaunay mesh generation by concurrent point insertion. In 14th Annual Fall Workshop on Computational Geometry. MIT, 55-56.
7. CHERNIKOV, A. N. AND CHRISOCHOIDES, N. P. 2004b. Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement. In Proceedings of the 18th Annual International Conference on Supercomputing. ACM Press, 48-57.
8. CHERNIKOV, A. N. AND CHRISOCHOIDES, N. R 2005. Parallel 2D graded guaranteed quality Delaunay mesh refinement. In Proceedings of the 14th International Meshing Roundtable. Springer, 505-517.
9. CHERNIKOV, A. N. AND CHRISOCHOIDES, N. P. 2006a. Generalized Delaunay mesh refinement: From scalar to parallel. In Proceedings of the 15th International Meshing Roundtable. Springer, 563-580.
10. CHERNIKOV, A. N. AND CHRISOCHOIDES, N. P. in press, May 2006b. Parallel guaranteed quality Delaunay uniform mesh refinement. SIAM J. Scient. Comput..
11. CHEW, L. P. 1987. Constrained Delaunay triangulations. In Proceedings of the 3rd Annual Symposium on Computational Geometry (SCG). ACM Press, 215-222.
12. CHEW, L. P. 1989. Guaranteed-quality triangular meshes. Tech. rep. TR89983, Computer Science Department. Cornell University.
13. CHEW, L. P., CHRISOCHOIDES, N., AND SUKUP, F. 1997. Parallel constrained Delaunay meshing. In ASME/ASCE/SES Summer Meeting, Special Symposium on Trends in Unstructured Mesh Generation. Northwestern University, Evanston, IL, 89-96.
14. CHRISOCHOIDES, N. AND NAVE, D. 2003. Parallel Delaunay mesh generation kernel. Int. J. Numer. Meth. Engin. 58, 161-176.
15. CHRISOCHOIDES, N. R 2005. A survey of parallel mesh generation methods. Tech. rep. BrownSC-2005-09, Brown University. (Also appears as a chapter in Numerical Solution of Partial Differential Equations on Parallel Computers, (A. M. Bruaset, R Bjorstad, A. Tveito Eds., Springer Verlag.)
16. 3. Concur. Pract. Exper. 7, 1, 61-80.
17. DE COUGNY, H. L., SHEPHARD, M. S., AND OZTURAN, C. 1994. Parallel three-dimensional mesh generation. Comput. Syst. Engin. 5, 311-323.
18. DIJKSTRA, E. W. 1987. Shmuel Safra's version of termination detection. Circulated privately, http://www.cs.utexas.edu/users/EWD/ewd09xx/ EWD998.PDF.
19. DONG, S., LUCOR, D., AND KARNIADAKIS, G. E. 2004. Flow past a stationary and moving cylinder: DNS at Re = 10,000. In Proceedings of the Users Group Conference (DOD.UGC04). 88-95.
20. FEDOROV, A. AND CHRISOCHOIDES, N. 2004. Communication support for dynamic load balancing of irregular adaptive applications. In Proceedings of the International Conference on Parallel Processing Workshops. Montreal, Quebec, Canada, 555-562.
21. GALTIER, J. AND GEORGE, P. L. 1997. Prepartitioning as a way to mesh subdomains in parallel. In Special Symposium on Trends in Unstructured Mesh Generation. ASME/ASCE/SES, 107-122.
22. GEORGE, P.-L. AND BOROUCHAKI, H. 1998. Delaunay Triangulation and Meshing. Application to Finite Elements. HERMES.
23. HOUSTIS, E. N., RICE, J. R., WEERAWARANA, S., CATLIN, A. C., PAPACHIOU, R, WANG, K.-Y., AND GAITATZES, M. 1998. Pellpack: A problem-solving environment for pde-based applications on multicomputer platforms. ACM Trans. Math. Softw. 24, 1, 30-73.
24. ISENBURG, M., LIU, Y., SHEWCHUK, J., AND SNOEYINK, J. 2006. Streaming computation of Delaunay triangulations. Accepted to SIGGRAPH.
25. JONES, M. T. AND PLASSMANN, P. E. 1994. Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes. In Scalable High Performance Computing Conference. IEEE Computer Society Press, 478-485.
26. KADOW, C. 2004a. Adaptive dynamic projection-based partitioning for parallel Delaunay mesh generation algorithms. In SIAM Workshop on Combinatorial Scientific Computing.
27. KADOW, C. 2004b. Parallel Delaunay refinement mesh generation. Ph.D. thesis, Carnegie Mellon University.
28. KADOW, C. AND WALKINGTON, N. 2003. Design of a projection-based parallel Delaunay mesh generation and refinement algorithm. In 4th Symposium on Trends in Unstructured Mesh Generation. http://www.andrew.cmu.edu/user/sowen/usnccm03/agenda.html.
29. KARNIADAKIS, G. AND ORSZAG, S. 1993. Nodes, modes, and flow codes. Phys. Today 46, 34-42.
30. KARYPIS, G. AND KUMAR, V. 1998. MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Version 4.0. University of Minnesota.
31. 3 for computers with shared memory. Paral. Comput. 31, 5, 491-522.
32. KOT, A., CHERNIKOV, A., AND CHRISOCHOIDES, N. 2006. Effective out-of-core parallel Delaunay mesh refinement using off-the-shelf software. In 20th IEEE International Parallel and Distributed Processing Symposium.
33. KUMAR, V., GRAMA, A., GUPTA, A., AND KARYPIS, G. 1994. Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms. The Benjamin/Cummings Publishing Company, Inc.
34. LINARDAKIS, L. AND CHRISOCHOIDES, N. 2005. A static medial axis domain decomposition for 2d geometries. ACM Trans. Math. Softw. Submitted.
35. LINARDAKIS, L. AND CHRISOCHOIDES, N. 2006. Delaunay decoupling method for parallel guaranteed quality planar mesh refinement. SIAM J. Scient. Comput. 27, 4, 1394-1423.
36. LÖHNER, R. AND CEBRAL, J. R. 1999. Parallel advancing front grid generation. In Proceedings of the Eighth International Meshing Roundtable. 67-74.
37. MILLER, G. L., TALMOR, D., TENG, S.-H., AND WALKINGTON, N. 1995. A Delaunay based numerical method for three dimensions: Generation, formulation, and partition. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing. ACM Press, 683-692.
38. NAVE, D., CHRISOCHOIDES, N., AND CHEW, L. P. 2004. Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. Computat. Geom.: Theory Appl. 28, 191-215.
39. RIVARA, M.-C., CALDERON, C., FEDOROV, A., AND CHRISOCHOIDES, N. 2006. Parallel decoupled terminaledge bisection method for 3d meshes. Engin. Comput. 22, 2, 111-119.
40. RUPPERT, J. 1995. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J Algor. 18, 3, 548-585.
41. RYPL, D. AND BITTNAR, Z. 2001. Parallel 3D mesh generator: Performance comparison. In Computational Fluid and Solid Mechanics, K. Bathe, Ed. Vol. 2. Elsevier, 1644-1646.
42. SHEWCHUK, J. R. 1996. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering, M. C. Lin and D. Manocha, Eds. Lecture Notes in Computer Science, vol. 1148. Springer-Verlag, 203-222.
43. SHEWCHUK, J. R. 1997a. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discr. Computat. Geom. 18, 3, 305-363.
44. SHEWCHUK, J. R. 1997b. Delaunay refinement mesh generation. Ph.D. thesis, Carnegie Mellon University.
45. SHEWCHUK, J. R. 2002a. Delaunay refinement algorithms for triangular mesh generation. Computat. Geom.: Theory Appl. 22, 1-3 (May), 21-74.
46. SHEWCHUK, J. R. 2002b. What is a good element? In Proceedings of the 11th International Meshing Roundtable. Sandia National Laboratories, 115-126.
47. SPIELMAN, D. A., TENG, S.-H., AND ÜNGÖR, A. 2001. Parallel Delaunay refinement: Algorithms and analyses. In Proceedings of the Eleventh International Meshing Roundtable. 205-217.
48. SPIELMAN, D. A., TENG, S.-H., AND ÜNGÖR, A. 2004. Time complexity of practical parallel Steiner point insertion algorithms. In Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press, 267-268.
49. TENG, S.-H. 2004. Personal Communication, February 2004.
50. ÜNGÖR, A. 2002. Parallel Delaunay refinement and space-time meshing. Ph.D. thesis, University of Illinois at Urbana-Champaign.
51. ÜNGÖR, A. 2004. Off-centers: A new type of Steiner points for computing size-optimal guaranteed-quality Delaunay triangulations. In Proceedings of LATIN. 152-161.
52. WALTERS, R. A. 2005. Coastal ocean models: Two useful finite element methods. Recent Develop. Phys. Oceanograp. Model.: Part II 25, 775-793.
53. WATSON, D. F. 1981. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Comput. J. 24, 167-172.