Sparse parallel Delaunay mesh refinement

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 339-347

  Hudson, Benot ^a   Miller, Gary L ^a   Phillips, Todd ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Computational geometry; Mesh generation; Shared memory parallelism

Indexed keywords

MESH REFINEMENT; OPTIMAL SEQUENTIAL TIME BOUNDS; PIECEWISELINEAR CONSTRAINING; SHARED-MEMORY PARALLELISM;

ALGORITHMS; CONSTRAINT THEORY; LINEAR SYSTEMS; MESH GENERATION; PROGRAM PROCESSORS; TWO DIMENSIONAL;

PARALLEL PROCESSING SYSTEMS;

EID: 35248867859     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248435     Document Type: Conference Paper

References (34)

1. U. A. Acar and B. Hudson. Optimal-time dynamic mesh refinement: preliminary results. In Proc. 16th Fall Workshop on Computational Geometry, 2006.
2. C. D. Antonopoulos, X. Ding, A. Chernikov, F. Blagojevic, D. S. Nikolopoulos, and N. Chrisochoides. Multigrain parallel delaunay mesh generation: challenges and opportunities for multithreaded architectures. In ICS '05: Proceedings of the 19th annual international conference on Supercomputing, pages 367-376, New York, NY, USA, 2005. ACM Press.
3. M. Bern, D. Eppstein, and J. R. Gilbert. Provably Good Mesh Generation. Journal of Computer and System Sciences, 48(3):384-409, June 1994.
4. M. W. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. International Journal of Computational Geometry and Applications, 9(6):5.17-532, 1999.
5. D. K. Blandford, G. E. Blelloch, and C. Kadow. Engineering a compact parallel delaunay algorithm in 3d. In Proceedings ofthe ACM Symposium on Computational Geometry, 2006. To Appear.
6. G. E. Blelloch, J. C. Hardwick, G. L. Miller, and D. Talmor. Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica, 24(3-4):243-269, Aug. 1999.
7. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng. Sliver Exudation. Journal of the ACM, 47(5):883-904, Sept. 2000.
8. A. Chernikov and N. Chrisochoides. Generalized delaunay mesh refinement: From scalar to parallel. In 15th International Meshing Roundtable, pages 563-580, Birmingham, AL, Sept 2006.
9. L. Chew, N. Paul, and F. Sukup. Parallel constrained delaunay meshing, 1997.
10. L. P. Chew. Guaranteed-Quality Delaunay Meshing in 3D. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pages 391-393, Nice, France, June 1997. Association for Computing Machinery.
11. N. Chrisochoides and D. Nave. Simultaneous mesh generation and partitioning for delaunay meshes, 1999.
12. H. Edelsbrunner, X.-Y. Li, G. L. Miller, A. Stathopoulos, D. Talmor, S.-H. Teng, A. Üngör, and N. Walkington. Smoothing and cleaning up slivers. In Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pages 273-277, Portland, Oregon, 2000.
13. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. In Proc. 19th ACM Symposium on Theory of Computing, pages 315-324, 1987.
14. S. Har-Peled and A. Üngör. A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. In Symposium on Computational Geometry, 2005.
15. B. Hudson, G. Miller, and T. Phillips. Sparse Voronoi Refinement. In Proceedings of the 15th International Meshing Roundtable, pages 339-356, Birmingham, Alabama, 2006. Long version available as Carnegie Mellon University Technical Report CMU-CS-06-132.
16. B. Hudson, G. Miller, and T. Phillips. Sparse Voronoi Refinement. Technical Report CMU-CS-06-132, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 2006.
17. M. Isenburg, Y. Liu, J. R. Shewchuk, and J. Snoeyink. Streaming computation of Delaunay triangulations. ACM Trans. Graph., 25(3): 1049-1056, 2006.
18. C. Kadow. Parallel Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, Pittsburgh, April 2004.
19. M. Kulkarni, L. P. Chew, and K. Pingali. Using transactions in delaunay mesh generation. In Workshop on Transactional Memory Workloads, 2006.
20. F. Labelle. Sliver Removal by Lattice Refinement. In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry. Association for Computing Machinery, June 2006.
21. X.-Y. Li. Generating well-shaped d-dimensional Delaunay meshes. Theor. Comput. Sci., 296(1):145-165, 2003.
22. X.-Y. Li and S.-H. Teng. Generating well-shaped Delaunay meshed in 3D. In Proceedings of the twelfth annual ACMSIAM symposium on Discrete algorithms, pages 28-37. ACM Press, 2001.
23. G. L. Miller, S. E. Pav, and N. J. Walkington. When and why ruppert's algorithm works. In Proceedings, 12th International Meshing Roundtable, pages 91-102. Sandia National Laboratories, September 14-17 2003.
24. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 683-692, Las Vegas, May 1995. ACM.
25. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. On the radius-edge condition in the control volume method. SIAM J. Numer. Anal., 36(6): 1690-1708, 1999.
26. S. Mitchell and S. Vavasis. Quality mesh generation in three dimensions. In Proc. 8th ACM Symp. Comp. Geom., pages 212-221, 1992.
27. D. Nave and N. Chrisochoides. Boundary refinement in delaunay mesh generation using arbitrarily ordered vertex insertion. In CCCG, pages 282-285, 2005.
28. D. Nave, N. Chrisochoides, and L. P. Chew. Guaranteed-quality parallel delaunay refinement for restricted polyhedral domains. In SoCG'02, 2002.
29. J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993).
30. M. Shephard, J. E. Flaherty, H. L. de Cougny, C. Ozturan, C. L. Bottasso, and M. Beall. Parallel automated adaptive procedures for unstructured meshes. Technical report, RPI, 1995. URL: http://www.scorec.rpi.edu/REPORTS/1995-11.pdf.
31. D. Spielman, S.-H. Teng, and A. Üngör. Parallel Delaunay refinement: Algorithms and analyses. In Proceedings, 11th International Meshing Roundtable, pages 205-218. Sandia National Laboratories, September 15-18 2002. http://www.arxiv.org/abs/cs.CG/0207063.
32. D. A. Spielman, S.-H. Teng, and A. Üngör. Time complexity of practical parallel steiner point insertion algorithms. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 267-268, New York, NY, USA, 2004. ACM Press.
33. T. Tu, D. O'Hallaron, and O. Ghattas. Scalable parallel octree meshing for terascale applications. In ACM/IEEE Super Computing Conference, Seattle, WA, 2005.
34. M. J. Turner, R. W. Clough, H. C. Martin, and L. P. Topp. Stiffness and deflection analysis of complex structures. J. Aeronaut. Sci., 23:805-824, 1956.