research-article

Three-dimensional delaunay refinement for multi-core processors

Authors:

Andrey N. Chernikov,

Nikos P. ChrisochoidesAuthors Info & Claims

ICS '08: Proceedings of the 22nd annual international conference on Supercomputing

Pages 214 - 224

https://doi.org/10.1145/1375527.1375560

Published: 07 June 2008 Publication History

Abstract

We develop the first ever fully functional three-dimensional guaranteed quality parallel graded Delaunay mesh generator. First, we prove a criterion and a sufficient condition of Delaunay-independence of Steiner points in three dimensions. Based on these results, we decompose the iteration space of the sequential Delaunay refinement algorithm by selecting independent subsets from the set of the candidate Steiner points without resorting to rollbacks. We use an octree which overlaps the mesh for a coarse-grained decomposition of the set of candidate Steiner points based on their location. We partition the worklist containing poor quality tetrahedra into independent lists associated with specific separated leaves of the octree. Finally, we describe an example parallel implementation using a publicly available state-of-the art sequential Delaunay library (Tetgen). This work provides a case study for the design of abstractions and parallel frameworks for the use of complex labor intensive sequential codes on multicore architectures.

References

[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 Supercomputing, pages 367--376, Cambridge, MA, 2005. ACM Press.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[17]

X.-Y. Li. Generating well-shaped d-dimensional Delaunay meshes. Theoretical Computer Science, 296(1):145--165, 2003.

Digital Library

[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.

Digital Library

[19]

R. Lohner 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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[25]

J. R. Shewchuk. Tetrahedral mesh generation by Delaunay refinement. In Proceedings of the 14th ACM Symposium on Computational Geometry, pages 86--95, Minneapolis, MN, 1998.

Digital Library

[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.

Digital Library

[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.

Cited By

Thomadakis PChrisochoides N(2024)Runtime support for CPU-GPU high-performance computing on distributed memory platformsFrontiers in High Performance Computing10.3389/fhpcp.2024.14170402Online publication date: 19-Jul-2024
https://doi.org/10.3389/fhpcp.2024.1417040
Erkoç ZGüdükbay USi H(2023)Memory-efficient boundary-preserving tetrahedralization of large three-dimensional meshesEngineering with Computers10.1007/s00366-023-01826-740:2(867-883)Online publication date: 9-May-2023
https://doi.org/10.1007/s00366-023-01826-7
Garner KThomadakis PKennedy TTsolakis CChrisochoides N(2019)On the End-User Productivity of a Pseudo-Constrained Parallel Data Refinement Method for the Advancing Front Local Reconnection Mesh Generation SoftwareAIAA Aviation 2019 Forum10.2514/6.2019-2844Online publication date: 14-Jun-2019
https://doi.org/10.2514/6.2019-2844
Show More Cited By

Index Terms

Three-dimensional delaunay refinement for multi-core processors

Recommendations

Practical and efficient point insertion scheduling method for parallel guaranteed quality delaunay refinement
ICS '04: Proceedings of the 18th annual international conference on Supercomputing

We describe a parallel scheduler, for guaranteed quality parallel mesh generation and refinement methods. We prove a sufficient condition for the new points to be independent, which permits the concurrent insertion of more than two points without ...
Generating well-shaped d-dimensional Delaunay meshes
Computing and combinatorics

A d-dimensional simplicial mesh is a Delaunay triangulation if the circumsphere of each of its simplices does not contain any vertices inside. A mesh is well shaped if the maximum aspect ratio of all its simplices is bounded from above by a constant. It ...
Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement

We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional geometries. In this paper, we describe our ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '08: Proceedings of the 22nd annual international conference on Supercomputing

June 2008

390 pages

ISBN:9781605581583

DOI:10.1145/1375527

General Chairs:
Theo Papatheodorou
University of Patras, Greece
,
Utpal Banerjee
Intel (retired), USA
,
Program Chairs:
Avi Mendelson
Intel, Israel
,
Kyle Gallivan
Florida State University, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICS08

Sponsor:

ICS08: International Conference on Supercomputing

June 7 - 12, 2008

Island of Kos, Greece

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
382
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Thomadakis PChrisochoides N(2024)Runtime support for CPU-GPU high-performance computing on distributed memory platformsFrontiers in High Performance Computing10.3389/fhpcp.2024.14170402Online publication date: 19-Jul-2024
https://doi.org/10.3389/fhpcp.2024.1417040
Erkoç ZGüdükbay USi H(2023)Memory-efficient boundary-preserving tetrahedralization of large three-dimensional meshesEngineering with Computers10.1007/s00366-023-01826-740:2(867-883)Online publication date: 9-May-2023
https://doi.org/10.1007/s00366-023-01826-7
Garner KThomadakis PKennedy TTsolakis CChrisochoides N(2019)On the End-User Productivity of a Pseudo-Constrained Parallel Data Refinement Method for the Advancing Front Local Reconnection Mesh Generation SoftwareAIAA Aviation 2019 Forum10.2514/6.2019-2844Online publication date: 14-Jun-2019
https://doi.org/10.2514/6.2019-2844
Pardue JChernikov A(2019)Algorithm 995ACM Transactions on Mathematical Software10.1145/330132145:3(1-30)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3301321
Chen ZTan T(2019)Computing Three-Dimensional Constrained Delaunay Refinement Using the GPU2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT.2019.00039(409-420)Online publication date: Sep-2019
https://doi.org/10.1109/PACT.2019.00039
Drakopoulos FTsolakis CChrisochoides N(2018)Fine-grained Speculative Topological Transformation Scheme for Local Reconnection Methods2018 Aviation Technology, Integration, and Operations Conference10.2514/6.2018-2889Online publication date: 24-Jun-2018
https://doi.org/10.2514/6.2018-2889
Chrisochoides NChernikov AKennedy TTsolakis CGarner K(2018)Parallel Data Refinement Layer of a Telescopic Approach for Extreme-scale Parallel Mesh Generation for CFD Applications2018 Aviation Technology, Integration, and Operations Conference10.2514/6.2018-2887Online publication date: 24-Jun-2018
https://doi.org/10.2514/6.2018-2887
Feng DChernikov AChrisochoides N(2018)A hybrid parallel Delaunay image-to-mesh conversion algorithm scalable on distributed-memory clustersComputer-Aided Design10.1016/j.cad.2017.11.006103(34-46)Online publication date: Oct-2018
https://doi.org/10.1016/j.cad.2017.11.006
Feng DTsolakis CChernikov AChrisochoides N(2017)Scalable 3D hybrid parallel Delaunay image-to-mesh conversion algorithm for distributed shared memory architecturesComputer-Aided Design10.1016/j.cad.2016.07.01085:C(10-19)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.cad.2016.07.010
Chrisochoides N(2016)Telescopic Approach for Extreme-Scale Parallel Mesh Generation for CFD Applications46th AIAA Fluid Dynamics Conference10.2514/6.2016-3181Online publication date: 10-Jun-2016
https://doi.org/10.2514/6.2016-3181
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents