Three-dimensional Delaunay refinement for multi-core processors

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2008, Pages 214-224

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

^a The College of William and Mary   (United States)

Author keywords

COTS software; Delaunay triangulation; Mesh generation; Multicore architectures; Parallel scientific computing

Indexed keywords

COMPUTERS; INTELLIGENT CONTROL; SEQUENTIAL SWITCHING; THREE DIMENSIONAL; TREES (MATHEMATICS);

CASE STUDIES; CORE PROCESSORS; COTS SOFTWARE; DELAUNAY; DELAUNAY MESHES; DELAUNAY TRIANGULATION; GUARANTEED QUALITIES; ITERATION SPACES; LABOR INTENSIVES; MULTICORE ARCHITECTURES; PARALLEL FRAMEWORKS; PARALLEL IMPLEMENTATIONS; PARALLEL SCIENTIFIC COMPUTING; REFINEMENT ALGORITHMS; SEQUENTIAL CODES; STEINER POINTS; SUFFICIENT CONDITIONS; THREE DIMENSIONS;

MESH GENERATION;

EID: 57349155016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375527.1375560     Document Type: Conference Paper

References (30)

1. http://www.distene.com/en/build/index.html. Accessed on Jan. 13, 2008.
2. C. D. Antonopoulos, X. Ding, A. N. Chernikov, F. Blagojevic, D. S. Nikolopoulos, and N. P. Chrisochoides. Multigrain parallel Delaunay mesh generation: Challenges and opportunities for multithreaded architectures. In Proceedings of the 19th Annual International Conference on Super computing, pages 367-376, Cambridge, MA, 2005. ACM Press.
3. G. E. Blelloch, J. Hardwick, G. L. Miller, and D. Talmor. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24:243-269, 1999.
4. A. Bowyer. Computing Dirichlet tesselations. Computer Journal, 24:162-166, 1981.
5. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42(1):67-90, 1995.
6. S.-W. Cheng, T. K. Dey, and T. Ray. Weighted Delaunay refinement for polyhedra with small angles. In Proceedings of the 14th International Meshing Roundtable, pages 325-342, San Diego, CA, Sept. 2005. Springer.
7. A. N. Chernikov and N. P. Chrisochoides. Generalized Delaunay mesh refinement: From scalar to parallel. In Proceedings of the 15th International Meshing Roundtable, pages 563-580, Birmingham, AL, Sept. 2006. Springer.
8. A. N. Chernikov and N. P. Chrisochoides. Parallel guaranteed quality Delaunay uniform mesh refinement. SIAM Journal on Scientific Computing, 28:1907-1926, 2006.
9. A. N. Chernikov and N. P. Chrisochoides. Three-dimensional semi-generalized point placement method for Delaunay mesh refinement. In Proceedings of the 16th International Meshing Roundtable, pages 25-44, Seattle, WA, Oct. 2007. Springer.
10. L. P. Chew. Guaranteed quality mesh generation for curved surfaces. In Proceedings of the 9th ACM Symposium on Computational Geometry, pages 274-280, San Diego, CA, 1993.
11. L. P. Chew. Guaranteed-quality Delaunay meshing in 3D. In Proceedings of the 13th ACM Symposium on Computational Geometry, pages 391-393, Nice, France, 1997.
12. H. L. de Cougny, M. S. Shephard, and C. Ozturan. Parallel three-dimensional mesh generation. Computing Systems in Engineering, 5:311-323, 1994.
13. B. N. Delaunay. Sur la sphere vide. Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Mataematicheskii i Estestvennyka Nauk, 7:793-800, 1934.
14. W. H. Frey. Selective refinement: A new strategy for automatic node placement in graded triangular meshes. International Journal for Numerical Methods in Engineering, 24(11):2183-2200, 1987.
15. P.-L. George and H. Borouchaki. Delaunay Triangulation and Meshing. Application to Finite Elements. HERMES, 1998.
16. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. SIGPLAN Not., 42(6):211-222, 2007.
17. X.-Y. Li. Generating well-shaped d-dimensional Delaunay meshes. Theoretical Computer Science, 296(1): 145-165, 2003.
18. L. Linardakis and N. Chrisochoides. Algorithm 870: A static geometric medial axis domain decomposition in 2D Euclidean space. ACM Transactions on Mathematical Software, 34(1): 1-28, 2008.
19. R. Lolmer and J. R. Cebral. Parallel advancing front grid generation. In Proceedings of the 8th International Meshing Roundtable, pages 67-74, South Lake Tahoe, CA, 1999.
20. 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, NV, May 1995.
21. D. Nave, N. Chrisochoides, and L. P. Chew. Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. In Proceedings of the 18th ACM Symposium on Computational Geometry, pages 135-144, Barcelona, Spain, 2002.
22. L. Oliker and R. Biswas. Parallelization of a dynamic unstructured application using three leading paradigms. In Supercomputing'99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CD-ROM), page 39, New York, NY, USA, 1999. ACM Press.
23. I. Pivkin, E. Hueso, R. Weinstein, D. Laidlaw, S. Swartz, and G. Karniadakis. Simulation and visualization of air flow around bat wings during flight. In Proceedings of the International Conference on Computational Science, pages 689-694, Atlanta, GA, 2005.
24. K. Psarris and K. Kyriakopoulos. The impact of data dependence analysis on compilation and program parallelization. In Proceedings of the 17th annual international conference on Supercomputing, pages 205-214, New York, NY, USA, 2003. ACM.
25. J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. In Proceedings of the 14-th ACM Symposium on Computational Geometry, pages 86-95, Minneapolis, MN, 1998.
26. H. Si. Tetgen version 1.4.1. http://tetgen.berlios.de/. Accessed on Aug. 3, 2006.
27. H. Sutter. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal, 30(3), Mar. 2005.
28. R. A. van Engelen and K. Gallivan. The gSOAP toolkit for web services and peer-to-peer computing networks. In Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid, pages 128-135, Berlin, Germany, May 2002.
29. D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal, 24:167-172, 1981.
30. C. Wen and K. Yelick. Compiling sequential programs for speculative parallelism. In Proceedings of the International Conference on Parallel and Distributed Systems, Taiwan, Dec. 1993.