A hybrid parallel Delaunay image-to-mesh conversion algorithm scalable on distributed-memory clusters

In this paper, we present a scalable three dimensional parallel Delaunay image-to-mesh conversion algorithm. A nested master–worker model is used to simultaneously explore process- and thread-level parallelization. The mesh generation includes two stages: coarse and fine meshing. First, a coarse mes...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer aided design Ročník 103; s. 34 - 46
Hlavní autoři:	Feng, Daming, Chernikov, Andrey N., Chrisochoides, Nikos P.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Ltd 01.10.2018 Elsevier BV
Témata:	3-D technology Algorithms Cluster analysis Clusters Computer memory Concurrency Conversion Distributed memory Distributed shared memory Finite element method Grid refinement (mathematics) Hybrid programming Image-to-mesh conversion Mesh generation Parallel mesh generation Parallel processing Three dimensional models Two-level parallelization Parallel mesh generation Two-level parallelization Hybrid programming Image-to-mesh conversion
ISSN:	0010-4485, 1879-2685
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In this paper, we present a scalable three dimensional parallel Delaunay image-to-mesh conversion algorithm. A nested master–worker model is used to simultaneously explore process- and thread-level parallelization. The mesh generation includes two stages: coarse and fine meshing. First, a coarse mesh is constructed in parallel by the threads of the master process. Then the coarse mesh is partitioned. Finally, the fine mesh refinement procedure is executed until all the elements in the mesh satisfy the quality and fidelity criteria. The communication and computation are separated during the fine mesh refinement procedure. The master thread of each process that initializes the MPI environment is in charge of the inter-node MPI communication for data (submesh) movement while the worker threads of each process are responsible for the local mesh refinement within the node. We conducted a set of experiments to test the performance of the algorithm on distributed memory clusters and observed that the granularity of coarse level data decomposition, which affects the coarse level concurrency, has a significant influence on the performance of the algorithm. With the proper value of granularity, the algorithm is scalable to 45 distributed memory compute nodes (900 cores). •The Hybrid MPI+Threads method is a hybrid programming image-to-mesh conversion algorithm.•The Hybrid MPI+Threads method creates meshes with quality and fidelity guarantees.•The Hybrid MPI+Threads method supports parallel non-uniform mesh generation for multi-material objects.•The Hybrid MPI+Threads method is a scalable parallel meshing algorithm on distributed multi-core node clusters.
AbstractList	In this paper, we present a scalable three dimensional parallel Delaunay image-to-mesh conversion algorithm. A nested master–worker model is used to simultaneously explore process- and thread-level parallelization. The mesh generation includes two stages: coarse and fine meshing. First, a coarse mesh is constructed in parallel by the threads of the master process. Then the coarse mesh is partitioned. Finally, the fine mesh refinement procedure is executed until all the elements in the mesh satisfy the quality and fidelity criteria. The communication and computation are separated during the fine mesh refinement procedure. The master thread of each process that initializes the MPI environment is in charge of the inter-node MPI communication for data (submesh) movement while the worker threads of each process are responsible for the local mesh refinement within the node. We conducted a set of experiments to test the performance of the algorithm on distributed memory clusters and observed that the granularity of coarse level data decomposition, which affects the coarse level concurrency, has a significant influence on the performance of the algorithm. With the proper value of granularity, the algorithm is scalable to 45 distributed memory compute nodes (900 cores). •The Hybrid MPI+Threads method is a hybrid programming image-to-mesh conversion algorithm.•The Hybrid MPI+Threads method creates meshes with quality and fidelity guarantees.•The Hybrid MPI+Threads method supports parallel non-uniform mesh generation for multi-material objects.•The Hybrid MPI+Threads method is a scalable parallel meshing algorithm on distributed multi-core node clusters. In this paper, we present a scalable three dimensional parallel Delaunay image-to-mesh conversion algorithm. A nested master–worker model is used to simultaneously explore process- and thread-level parallelization. The mesh generation includes two stages: coarse and fine meshing. First, a coarse mesh is constructed in parallel by the threads of the master process. Then the coarse mesh is partitioned. Finally, the fine mesh refinement procedure is executed until all the elements in the mesh satisfy the quality and fidelity criteria. The communication and computation are separated during the fine mesh refinement procedure. The master thread of each process that initializes the MPI environment is in charge of the inter-node MPI communication for data (submesh) movement while the worker threads of each process are responsible for the local mesh refinement within the node. We conducted a set of experiments to test the performance of the algorithm on distributed memory clusters and observed that the granularity of coarse level data decomposition, which affects the coarse level concurrency, has a significant influence on the performance of the algorithm. With the proper value of granularity, the algorithm is scalable to 45 distributed memory compute nodes (900 cores).
Author	Chrisochoides, Nikos P. Feng, Daming Chernikov, Andrey N.
Author_xml	– sequence: 1 givenname: Daming surname: Feng fullname: Feng, Daming email: dfeng@cs.odu.edu – sequence: 2 givenname: Andrey N. surname: Chernikov fullname: Chernikov, Andrey N. email: achernik@cs.odu.edu – sequence: 3 givenname: Nikos P. surname: Chrisochoides fullname: Chrisochoides, Nikos P. email: nikos@cs.odu.edu
BookMark	eNp9kE1r3DAQhkVJoZu0P6A3Qc92R7Ity_QU0vQDAr20ZzGWxlktWmsryYH991HYnnrIaWB4nxne55pdrXElxj4KaAUI9fnQWnStBDG2QrQA6g3bCT1OjVR6uGI7AAFN3-vhHbvO-QAAUnTTjtEt35_n5B0_YcIQKPCvFHBb8cz9ER-pKbE5Ut5zG9cnStnHlWN4jMmX_ZFniwHnQLxunc8l-Xkr5CpxjOnMbdhyqdB79nbBkOnDv3nD_ny7_333o3n49f3n3e1DYzs5lEYPI8xSoR17DXpaNJCaEKBTk9Ju7gWOPS6L004NpDTi4qSbh470QmoW0N2wT5e7pxT_bpSLOcQtrfWlkUKAlHrshpoSl5RNMedEizml2jWdjQDzYtMcTLVpXmwaIUy1WZnxP8b6gqXaKAl9eJX8ciGpFn_ylEy2nlZLzieyxbjoX6GfAXp5km4
CitedBy_id	crossref_primary_10_1016_j_cma_2020_113634 crossref_primary_10_1016_j_parco_2020_102672 crossref_primary_10_1016_j_cma_2020_112881 crossref_primary_10_2514_1_J057657 crossref_primary_10_1007_s00366_024_01994_0 crossref_primary_10_1016_j_finel_2022_103723 crossref_primary_10_2514_1_J060270
Cites_doi	10.1016/j.matcom.2006.12.008 10.1145/1006209.1006217 10.1145/1375527.1375560 10.1016/j.comgeo.2013.11.009 10.1145/262839.263018 10.1007/PL00008262 10.1016/0167-8191(94)00085-O 10.1109/TVCG.2013.115 10.1016/j.parco.2016.01.007 10.1126/science.1235381 10.1016/j.proeng.2016.11.018 10.1007/BF01200364 10.1007/PL00009475 10.1137/050625886 10.1137/0909041 10.1016/j.procs.2012.04.166 10.1016/j.jpdc.2013.11.002 10.1007/s00366-013-0328-8 10.1093/comjnl/24.2.162 10.1093/comjnl/24.2.167 10.1145/276884.276894 10.1137/030602812 10.1016/j.comgeo.2004.03.009 10.1016/j.parco.2016.01.003 10.1016/0167-8191(95)00054-2 10.1007/s00371-003-0219-x 10.1145/2629697 10.1137/100809076 10.1134/S0965542508080083 10.1016/j.comgeo.2010.04.008 10.1137/060677276 10.1016/0956-0521(94)90014-0 10.1137/100815256 10.1145/1322436.1322442 10.1016/j.proeng.2015.10.119
ContentType	Journal Article
Copyright	2017 Elsevier Ltd Copyright Elsevier BV Oct 2018
Copyright_xml	– notice: 2017 Elsevier Ltd – notice: Copyright Elsevier BV Oct 2018
DBID	AAYXX CITATION 7SC 7TB 8FD F28 FR3 JQ2 KR7 L7M L~C L~D
DOI	10.1016/j.cad.2017.11.006
DatabaseName	CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional
DatabaseTitleList	Civil Engineering Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1879-2685
EndPage	46
ExternalDocumentID	10_1016_j_cad_2017_11_006 S0010448517302294
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABFRF ABMAC ABXDB ABYKQ ACAZW ACBEA ACDAQ ACGFO ACGFS ACIWK ACKIV ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA K-O KOM LG9 LY7 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSW SSZ T5K TAE TN5 TWZ VOH WUQ XFK XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 7TB 8FD F28 FR3 JQ2 KR7 L7M L~C L~D
ID	FETCH-LOGICAL-c325t-8570b26ac748089f80e69a0036968db41a74affd8d65e68aafd2db53e8fe6b103
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000437997400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0010-4485
IngestDate	Sun Oct 05 00:10:37 EDT 2025 Tue Nov 18 22:23:33 EST 2025 Sat Nov 29 07:31:35 EST 2025 Fri Feb 23 02:28:10 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Parallel mesh generation Two-level parallelization Hybrid programming Image-to-mesh conversion
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c325t-8570b26ac748089f80e69a0036968db41a74affd8d65e68aafd2db53e8fe6b103
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2110228735
PQPubID	2045267
PageCount	13
ParticipantIDs	proquest_journals_2110228735 crossref_primary_10_1016_j_cad_2017_11_006 crossref_citationtrail_10_1016_j_cad_2017_11_006 elsevier_sciencedirect_doi_10_1016_j_cad_2017_11_006
PublicationCentury	2000
PublicationDate	October 2018 2018-10-00 20181001
PublicationDateYYYYMMDD	2018-10-01
PublicationDate_xml	– month: 10 year: 2018 text: October 2018
PublicationDecade	2010
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Computer aided design
PublicationYear	2018
Publisher	Elsevier Ltd Elsevier BV
Publisher_xml	– name: Elsevier Ltd – name: Elsevier BV
References	Nave, Chrisochoides, Chew (b34) 2004; 28 Chernikov, Chrisochoides (b19) 2006; 28 Feng, Chernikov, Chrisochoides (b14) 2016; 163 Foteinos, Chrisochoides (b33) 2013 Feng D, Tsolakis C, Chernikov A, Chrisochoides N. Scalable 3D hybrid parallel Delaunay image-to-mesh conversion algorithm for distributed shared memory architectures. In: 24th International meshing roundtable, Austin, Texas, 2015. Gustanfson, Montry, Benner (b48) 1988; 9 Amunts, Lepage, Borgeat, Mohlberg, Dickscheid, Rousseau (b1) 2013; 340 Chernikov, Chrisochoides (b7) 2011; 33 Batista, Millman, Pion, Singler (b24) 2010; 43 Foteinos, Chrisochoides (b13) 2014; 74 George, Borouchaki (b10) 1998 Chernikov A, Chrisochoides N. Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement. In: ACM International conference on supercomputing, 2004, p. 48–57. Gorman, Southern, Farrell, Piggott, Rokos, Kelly (b44) 2012; 9 Amenta, Bern (b12) 1999; 22 Chew LP. Guaranteed-quality Delaunay meshing in 3D. In: Proceedings of the 13th ACM symposium on computational geometry, 1997, p. 391–3. Linardakis, Chrisochoides (b28) 2006; 27 Löhner R, Cebral JR. Parallel advancing front grid generation. In: Proceedings of the 8th International meshing roundtable, South Lake Tahoe, CA, 1999, p. 67–74. Bowyer (b17) 1981; 24 Chernikov A, Chrisochoides N. Three-dimensional Delaunay refinement for multi-core processors. In: ACM International conference on supercomputing, 2008, p. 214–24. Ircad Laparoscopic Center, 2013. Foteinos, Chrisochoides (b22) 2011 Bronson, Levine, Whitaker (b8) 2014; 20 Chernikov, Chrisochoides (b11) 2012; 34 . Andra, Gluchshenko, Ivanov, Kudryavtsev (b25) 2008; 48 Linardakis, Chrisochoides (b45) 2008; 30 Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of the 14th ACM symposium on computational geometry, 1998, p. 86–95. Kohout, Kolingerová (b21) 2003; 19 Armstrong, Robinson, McKeag, Li, Bridgett, Donaghy (b29) 1995 Ito, Shih, Erukala, Soni, Chernikov, Chrisochoides (b40) 2007; 75 Globisch (b42) 1995; 21 de Cougny, Shephard, Ozturan (b38) 1994; 5 Foteinos, Chernikov, Chrisochoides (b4) 2014; 47 Blandford, Blelloch, Kadow (b23) 2006 Chew LP, Chrisochoides N, Sukup F. Parallel Constrained Delaunay Meshing. In: ASME/ASCE/SES summer meeting, special symposium on trends in unstructured mesh generation, 1997, p. 89–96. Gursoy, Patrikalakis (b30) 1992; 8 Grama, Gupta, Karypis, Kumar (b49) 2003 Globisch (b41) 1995; 21 Okusanya, Peraire (b27) 1997 Watson (b16) 1981; 24 Cheng, Dey, Shewchuk (b9) 2012 Liang, Zhang (b6) 2014; 30 Chernikov, Chrisochoides (b32) 2008; 34 Blelloch, Miller, Hardwick, Talmor (b20) 1999; 24 CGAL, computational geometry algorithms library, 2014. Feng, Chernikov, Chrisochoides (b35) 2016; 59 Si (b3) 2015; 41 Ibanez, Dunn, Shephard (b43) 2016; 52 Richolt J, Jakab M, Kikinis R. Surgical Planning Laboratory, 2011. Galtier J, George P-L. Prepartitioning as a way to mesh subdomains in parallel. In: Proceedings of the 5th International meshing roundtable, Pittsburgh, PA, 1996, p. 107–21. Amenta (10.1016/j.cad.2017.11.006_b12) 1999; 22 Watson (10.1016/j.cad.2017.11.006_b16) 1981; 24 Chernikov (10.1016/j.cad.2017.11.006_b11) 2012; 34 Bronson (10.1016/j.cad.2017.11.006_b8) 2014; 20 Chernikov (10.1016/j.cad.2017.11.006_b32) 2008; 34 Foteinos (10.1016/j.cad.2017.11.006_b22) 2011 Kohout (10.1016/j.cad.2017.11.006_b21) 2003; 19 Grama (10.1016/j.cad.2017.11.006_b49) 2003 Si (10.1016/j.cad.2017.11.006_b3) 2015; 41 Okusanya (10.1016/j.cad.2017.11.006_b27) 1997 Bowyer (10.1016/j.cad.2017.11.006_b17) 1981; 24 Chernikov (10.1016/j.cad.2017.11.006_b7) 2011; 33 Foteinos (10.1016/j.cad.2017.11.006_b4) 2014; 47 10.1016/j.cad.2017.11.006_b26 George (10.1016/j.cad.2017.11.006_b10) 1998 Batista (10.1016/j.cad.2017.11.006_b24) 2010; 43 Foteinos (10.1016/j.cad.2017.11.006_b33) 2013 de Cougny (10.1016/j.cad.2017.11.006_b38) 1994; 5 10.1016/j.cad.2017.11.006_b31 Foteinos (10.1016/j.cad.2017.11.006_b13) 2014; 74 Chernikov (10.1016/j.cad.2017.11.006_b19) 2006; 28 Blelloch (10.1016/j.cad.2017.11.006_b20) 1999; 24 Blandford (10.1016/j.cad.2017.11.006_b23) 2006 Gustanfson (10.1016/j.cad.2017.11.006_b48) 1988; 9 Cheng (10.1016/j.cad.2017.11.006_b9) 2012 Gursoy (10.1016/j.cad.2017.11.006_b30) 1992; 8 Feng (10.1016/j.cad.2017.11.006_b14) 2016; 163 Andra (10.1016/j.cad.2017.11.006_b25) 2008; 48 Ibanez (10.1016/j.cad.2017.11.006_b43) 2016; 52 10.1016/j.cad.2017.11.006_b36 10.1016/j.cad.2017.11.006_b37 Globisch (10.1016/j.cad.2017.11.006_b41) 1995; 21 Gorman (10.1016/j.cad.2017.11.006_b44) 2012; 9 10.1016/j.cad.2017.11.006_b39 Liang (10.1016/j.cad.2017.11.006_b6) 2014; 30 Amunts (10.1016/j.cad.2017.11.006_b1) 2013; 340 10.1016/j.cad.2017.11.006_b46 10.1016/j.cad.2017.11.006_b2 Globisch (10.1016/j.cad.2017.11.006_b42) 1995; 21 Armstrong (10.1016/j.cad.2017.11.006_b29) 1995 10.1016/j.cad.2017.11.006_b47 10.1016/j.cad.2017.11.006_b5 Feng (10.1016/j.cad.2017.11.006_b35) 2016; 59 Linardakis (10.1016/j.cad.2017.11.006_b45) 2008; 30 Linardakis (10.1016/j.cad.2017.11.006_b28) 2006; 27 Ito (10.1016/j.cad.2017.11.006_b40) 2007; 75 10.1016/j.cad.2017.11.006_b15 10.1016/j.cad.2017.11.006_b18 Nave (10.1016/j.cad.2017.11.006_b34) 2004; 28
References_xml	– volume: 24 start-page: 243 year: 1999 end-page: 269 ident: b20 article-title: Design and implementation of a practical parallel Delaunay Algorithm publication-title: Algorithmica – volume: 21 start-page: 1979 year: 1995 end-page: 1995 ident: b42 article-title: On an automatically parallel generation technique for tetrahedral meshes publication-title: Parallel Comput – reference: Chernikov A, Chrisochoides N. Practical and efficient point insertion scheduling method for parallel guaranteed quality Delaunay refinement. In: ACM International conference on supercomputing, 2004, p. 48–57. – volume: 24 start-page: 162 year: 1981 end-page: 166 ident: b17 article-title: Computing Dirichlet tesselations publication-title: Comput J – volume: 21 start-page: 509 year: 1995 end-page: 524 ident: b41 article-title: PARMESH –A parallel mesh generator publication-title: Parallel Comput – volume: 9 start-page: 609 year: 1988 end-page: 638 ident: b48 article-title: Development of parallel methods for a 1024-processor hypercube publication-title: SIAM J Sci Stat Comput – volume: 22 start-page: 481 year: 1999 end-page: 504 ident: b12 article-title: Surface reconstruction by voronoi filtering publication-title: Discrete Comput Geom – volume: 34 start-page: A1333 year: 2012 end-page: A1350 ident: b11 article-title: Generalized insertion region guides for Delaunay mesh refinement publication-title: SIAM J Sci Comput – start-page: 277 year: 1995 end-page: 288 ident: b29 article-title: Medials for meshing and more publication-title: 4th International meshing roundtable – volume: 47 start-page: 539 year: 2014 end-page: 562 ident: b4 article-title: Guaranteed quality tetrahedral Delaunay meshing for medical images publication-title: Comput Geom Theory Appl – volume: 5 start-page: 311 year: 1994 end-page: 323 ident: b38 article-title: 3rd National symposium on large-scale structural analysis for high-performance computers and workstations parallel three-dimensional mesh generation publication-title: Comput Syst Eng – reference: Ircad Laparoscopic Center, 2013. – volume: 30 start-page: 211 year: 2014 end-page: 222 ident: b6 article-title: An octree-based dual contouring method for triangular and tetrahedral mesh generation with guaranteed angle range publication-title: Eng Comput – volume: 34 start-page: 6 year: 2008 end-page: 25 ident: b32 article-title: Parallel 2D constrained Delaunay mesh generation publication-title: ACM Trans Math Software – reference: Löhner R, Cebral JR. Parallel advancing front grid generation. In: Proceedings of the 8th International meshing roundtable, South Lake Tahoe, CA, 1999, p. 67–74. – reference: Chew LP. Guaranteed-quality Delaunay meshing in 3D. In: Proceedings of the 13th ACM symposium on computational geometry, 1997, p. 391–3. – reference: Galtier J, George P-L. Prepartitioning as a way to mesh subdomains in parallel. In: Proceedings of the 5th International meshing roundtable, Pittsburgh, PA, 1996, p. 107–21. – volume: 48 start-page: 1367 year: 2008 end-page: 1375 ident: b25 article-title: Automatic parallel generation of tetrahedral grids by using a domain decomposition approach publication-title: Comput Math Math Phys – reference: Chernikov A, Chrisochoides N. Three-dimensional Delaunay refinement for multi-core processors. In: ACM International conference on supercomputing, 2008, p. 214–24. – volume: 20 start-page: 223 year: 2014 end-page: 237 ident: b8 article-title: Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees publication-title: IEEE Trans Visual Comput Graph – volume: 33 start-page: 3491 year: 2011 end-page: 3508 ident: b7 article-title: Multitissue tetrahedral image-to-mesh conversion with guaranteed quality and fidelity publication-title: SIAM J Sci Comput – year: 1998 ident: b10 publication-title: Delaunay triangulation and meshing. Application to finite elements – volume: 340 start-page: 1472 year: 2013 end-page: 1475 ident: b1 article-title: Bigbrain: An ultrahigh-resolution 3D human brain model publication-title: Science – year: 2003 ident: b49 publication-title: Introduction to parallel computing – reference: Richolt J, Jakab M, Kikinis R. Surgical Planning Laboratory, 2011. – volume: 43 start-page: 663 year: 2010 end-page: 677 ident: b24 article-title: Parallel geometric algorithms for multi-core computers publication-title: Comput Geom – reference: Shewchuk JR. Tetrahedral mesh generation by Delaunay refinement. In: Proceedings of the 14th ACM symposium on computational geometry, 1998, p. 86–95. – reference: Feng D, Tsolakis C, Chernikov A, Chrisochoides N. Scalable 3D hybrid parallel Delaunay image-to-mesh conversion algorithm for distributed shared memory architectures. In: 24th International meshing roundtable, Austin, Texas, 2015. – volume: 24 start-page: 167 year: 1981 end-page: 172 ident: b16 article-title: Computing the n-dimensional Delaunay tesselation with application to voronoi polytopes publication-title: Comput J – volume: 30 start-page: 1875 year: 2008 end-page: 1891 ident: b45 article-title: Graded Delaunay decoupling method for parallel guaranteed quality planar mesh generation publication-title: SIAM J Sci Comput – start-page: 109 year: 1997 end-page: 116 ident: b27 article-title: 3D parallel unstructured mesh generation publication-title: Trends in unstructured mesh generation – start-page: 233 year: 2013 end-page: 242 ident: b33 article-title: High quality real-time image-to-mesh conversion for finite element simulations publication-title: ACM International conference on supercomputing – volume: 74 start-page: 2123 year: 2014 end-page: 2140 ident: b13 article-title: High quality real-time image-to-mesh conversion for finite element simulations publication-title: J Parallel Distrib Comput – volume: 59 start-page: 60 year: 2016 end-page: 70 ident: b35 article-title: Two-level locality-aware parallel Delaunay image-to-mesh conversion publication-title: Parallel Comput – start-page: 292 year: 2006 end-page: 300 ident: b23 article-title: Engineering a compact parallel Delaunay algorithm in 3D publication-title: Proceedings of the 22nd symposium on computational geometry – start-page: 9 year: 2011 end-page: 26 ident: b22 article-title: Dynamic parallel 3D Delaunay triangulation publication-title: International meshing roundtable – volume: 19 start-page: 532 year: 2003 end-page: 548 ident: b21 article-title: Parallel Delaunay triangulation in E3: make it simple publication-title: Vis Comput – volume: 41 start-page: 11:1 year: 2015 end-page: 11:36 ident: b3 article-title: TetGen, a Delaunay-based quality tetrahedral mesh generator publication-title: ACM Trans Math Software – volume: 52 start-page: 133 year: 2016 end-page: 143 ident: b43 article-title: Hybrid MPI-thread parallelization of adaptive mesh operations publication-title: Parallel Comput – reference: . – volume: 28 start-page: 1907 year: 2006 end-page: 1926 ident: b19 article-title: Parallel guaranteed quality Delaunay uniform mesh refinement publication-title: SIAM J Sci Comput – volume: 163 start-page: 59 year: 2016 end-page: 71 ident: b14 article-title: A hybrid parallel delaunay image-to-mesh conversion algorithm scalable on distributed-memory clusters publication-title: Procedia Eng – volume: 27 start-page: 1394 year: 2006 end-page: 1423 ident: b28 article-title: Delaunay decoupling method for parallel guaranteed quality planar mesh refinement publication-title: SIAM J Sci Comput – volume: 9 start-page: 1513 year: 2012 end-page: 1522 ident: b44 article-title: Hybrid OpenMP/MPI anisotropic mesh smoothing publication-title: Procedia Comput. Sci. – volume: 28 start-page: 191 year: 2004 end-page: 215 ident: b34 article-title: Guaranteed-quality parallel delaunay refinement for restricted polyhedral domains publication-title: Comput Geom Theory Appl. – year: 2012 ident: b9 publication-title: Delaunay mesh generation – volume: 8 start-page: 121 year: 1992 end-page: 137 ident: b30 article-title: An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part i algorithms publication-title: Eng Comput – reference: Chew LP, Chrisochoides N, Sukup F. Parallel Constrained Delaunay Meshing. In: ASME/ASCE/SES summer meeting, special symposium on trends in unstructured mesh generation, 1997, p. 89–96. – reference: CGAL, computational geometry algorithms library, 2014. – volume: 75 start-page: 200 year: 2007 end-page: 209 ident: b40 article-title: Parallel unstructured mesh generation by an advancing front method publication-title: Math Comput Simulation – ident: 10.1016/j.cad.2017.11.006_b39 – volume: 75 start-page: 200 issue: 5 year: 2007 ident: 10.1016/j.cad.2017.11.006_b40 article-title: Parallel unstructured mesh generation by an advancing front method publication-title: Math Comput Simulation doi: 10.1016/j.matcom.2006.12.008 – ident: 10.1016/j.cad.2017.11.006_b36 doi: 10.1145/1006209.1006217 – start-page: 233 year: 2013 ident: 10.1016/j.cad.2017.11.006_b33 article-title: High quality real-time image-to-mesh conversion for finite element simulations – ident: 10.1016/j.cad.2017.11.006_b18 doi: 10.1145/1375527.1375560 – volume: 47 start-page: 539 issue: 4 year: 2014 ident: 10.1016/j.cad.2017.11.006_b4 article-title: Guaranteed quality tetrahedral Delaunay meshing for medical images publication-title: Comput Geom Theory Appl doi: 10.1016/j.comgeo.2013.11.009 – year: 2012 ident: 10.1016/j.cad.2017.11.006_b9 – ident: 10.1016/j.cad.2017.11.006_b15 doi: 10.1145/262839.263018 – volume: 24 start-page: 243 issue: 3 year: 1999 ident: 10.1016/j.cad.2017.11.006_b20 article-title: Design and implementation of a practical parallel Delaunay Algorithm publication-title: Algorithmica doi: 10.1007/PL00008262 – ident: 10.1016/j.cad.2017.11.006_b5 – volume: 21 start-page: 509 issue: 3 year: 1995 ident: 10.1016/j.cad.2017.11.006_b41 article-title: PARMESH –A parallel mesh generator publication-title: Parallel Comput doi: 10.1016/0167-8191(94)00085-O – ident: 10.1016/j.cad.2017.11.006_b26 – volume: 20 start-page: 223 issue: 2 year: 2014 ident: 10.1016/j.cad.2017.11.006_b8 article-title: Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees publication-title: IEEE Trans Visual Comput Graph doi: 10.1109/TVCG.2013.115 – volume: 59 start-page: 60 issue: Supplement C year: 2016 ident: 10.1016/j.cad.2017.11.006_b35 article-title: Two-level locality-aware parallel Delaunay image-to-mesh conversion publication-title: Parallel Comput doi: 10.1016/j.parco.2016.01.007 – volume: 340 start-page: 1472 issue: 6139 year: 2013 ident: 10.1016/j.cad.2017.11.006_b1 article-title: Bigbrain: An ultrahigh-resolution 3D human brain model publication-title: Science doi: 10.1126/science.1235381 – volume: 163 start-page: 59 year: 2016 ident: 10.1016/j.cad.2017.11.006_b14 article-title: A hybrid parallel delaunay image-to-mesh conversion algorithm scalable on distributed-memory clusters publication-title: Procedia Eng doi: 10.1016/j.proeng.2016.11.018 – volume: 8 start-page: 121 year: 1992 ident: 10.1016/j.cad.2017.11.006_b30 article-title: An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part i algorithms publication-title: Eng Comput doi: 10.1007/BF01200364 – volume: 22 start-page: 481 issue: 4 year: 1999 ident: 10.1016/j.cad.2017.11.006_b12 article-title: Surface reconstruction by voronoi filtering publication-title: Discrete Comput Geom doi: 10.1007/PL00009475 – start-page: 292 year: 2006 ident: 10.1016/j.cad.2017.11.006_b23 article-title: Engineering a compact parallel Delaunay algorithm in 3D – ident: 10.1016/j.cad.2017.11.006_b31 – ident: 10.1016/j.cad.2017.11.006_b46 – volume: 28 start-page: 1907 year: 2006 ident: 10.1016/j.cad.2017.11.006_b19 article-title: Parallel guaranteed quality Delaunay uniform mesh refinement publication-title: SIAM J Sci Comput doi: 10.1137/050625886 – start-page: 109 year: 1997 ident: 10.1016/j.cad.2017.11.006_b27 article-title: 3D parallel unstructured mesh generation – year: 1998 ident: 10.1016/j.cad.2017.11.006_b10 – volume: 9 start-page: 609 issue: 4 year: 1988 ident: 10.1016/j.cad.2017.11.006_b48 article-title: Development of parallel methods for a 1024-processor hypercube publication-title: SIAM J Sci Stat Comput doi: 10.1137/0909041 – volume: 9 start-page: 1513 year: 2012 ident: 10.1016/j.cad.2017.11.006_b44 article-title: Hybrid OpenMP/MPI anisotropic mesh smoothing publication-title: Procedia Comput. Sci. doi: 10.1016/j.procs.2012.04.166 – start-page: 277 year: 1995 ident: 10.1016/j.cad.2017.11.006_b29 article-title: Medials for meshing and more – year: 2003 ident: 10.1016/j.cad.2017.11.006_b49 – ident: 10.1016/j.cad.2017.11.006_b47 – volume: 74 start-page: 2123 issue: 2 year: 2014 ident: 10.1016/j.cad.2017.11.006_b13 article-title: High quality real-time image-to-mesh conversion for finite element simulations publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2013.11.002 – volume: 30 start-page: 211 issue: 2 year: 2014 ident: 10.1016/j.cad.2017.11.006_b6 article-title: An octree-based dual contouring method for triangular and tetrahedral mesh generation with guaranteed angle range publication-title: Eng Comput doi: 10.1007/s00366-013-0328-8 – volume: 24 start-page: 162 year: 1981 ident: 10.1016/j.cad.2017.11.006_b17 article-title: Computing Dirichlet tesselations publication-title: Comput J doi: 10.1093/comjnl/24.2.162 – volume: 24 start-page: 167 year: 1981 ident: 10.1016/j.cad.2017.11.006_b16 article-title: Computing the n-dimensional Delaunay tesselation with application to voronoi polytopes publication-title: Comput J doi: 10.1093/comjnl/24.2.167 – ident: 10.1016/j.cad.2017.11.006_b2 doi: 10.1145/276884.276894 – volume: 27 start-page: 1394 issue: 4 year: 2006 ident: 10.1016/j.cad.2017.11.006_b28 article-title: Delaunay decoupling method for parallel guaranteed quality planar mesh refinement publication-title: SIAM J Sci Comput doi: 10.1137/030602812 – volume: 28 start-page: 191 year: 2004 ident: 10.1016/j.cad.2017.11.006_b34 article-title: Guaranteed-quality parallel delaunay refinement for restricted polyhedral domains publication-title: Comput Geom Theory Appl. doi: 10.1016/j.comgeo.2004.03.009 – volume: 52 start-page: 133 issue: C year: 2016 ident: 10.1016/j.cad.2017.11.006_b43 article-title: Hybrid MPI-thread parallelization of adaptive mesh operations publication-title: Parallel Comput doi: 10.1016/j.parco.2016.01.003 – volume: 21 start-page: 1979 issue: 12 year: 1995 ident: 10.1016/j.cad.2017.11.006_b42 article-title: On an automatically parallel generation technique for tetrahedral meshes publication-title: Parallel Comput doi: 10.1016/0167-8191(95)00054-2 – volume: 19 start-page: 532 issue: 7 year: 2003 ident: 10.1016/j.cad.2017.11.006_b21 article-title: Parallel Delaunay triangulation in E3: make it simple publication-title: Vis Comput doi: 10.1007/s00371-003-0219-x – volume: 41 start-page: 11:1 issue: 2 year: 2015 ident: 10.1016/j.cad.2017.11.006_b3 article-title: TetGen, a Delaunay-based quality tetrahedral mesh generator publication-title: ACM Trans Math Software doi: 10.1145/2629697 – volume: 34 start-page: A1333 year: 2012 ident: 10.1016/j.cad.2017.11.006_b11 article-title: Generalized insertion region guides for Delaunay mesh refinement publication-title: SIAM J Sci Comput doi: 10.1137/100809076 – volume: 48 start-page: 1367 issue: 8 year: 2008 ident: 10.1016/j.cad.2017.11.006_b25 article-title: Automatic parallel generation of tetrahedral grids by using a domain decomposition approach publication-title: Comput Math Math Phys doi: 10.1134/S0965542508080083 – volume: 43 start-page: 663 issue: 8 year: 2010 ident: 10.1016/j.cad.2017.11.006_b24 article-title: Parallel geometric algorithms for multi-core computers publication-title: Comput Geom doi: 10.1016/j.comgeo.2010.04.008 – start-page: 9 year: 2011 ident: 10.1016/j.cad.2017.11.006_b22 article-title: Dynamic parallel 3D Delaunay triangulation – volume: 30 start-page: 1875 issue: 4 year: 2008 ident: 10.1016/j.cad.2017.11.006_b45 article-title: Graded Delaunay decoupling method for parallel guaranteed quality planar mesh generation publication-title: SIAM J Sci Comput doi: 10.1137/060677276 – volume: 5 start-page: 311 issue: 4 year: 1994 ident: 10.1016/j.cad.2017.11.006_b38 article-title: 3rd National symposium on large-scale structural analysis for high-performance computers and workstations parallel three-dimensional mesh generation publication-title: Comput Syst Eng doi: 10.1016/0956-0521(94)90014-0 – volume: 33 start-page: 3491 issue: 6 year: 2011 ident: 10.1016/j.cad.2017.11.006_b7 article-title: Multitissue tetrahedral image-to-mesh conversion with guaranteed quality and fidelity publication-title: SIAM J Sci Comput doi: 10.1137/100815256 – volume: 34 start-page: 6 year: 2008 ident: 10.1016/j.cad.2017.11.006_b32 article-title: Parallel 2D constrained Delaunay mesh generation publication-title: ACM Trans Math Software doi: 10.1145/1322436.1322442 – ident: 10.1016/j.cad.2017.11.006_b37 doi: 10.1016/j.proeng.2015.10.119
SSID	ssj0002139
Score	2.2962937
Snippet	In this paper, we present a scalable three dimensional parallel Delaunay image-to-mesh conversion algorithm. A nested master–worker model is used to...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	34
SubjectTerms	3-D technology Algorithms Cluster analysis Clusters Computer memory Concurrency Conversion Distributed memory Distributed shared memory Finite element method Grid refinement (mathematics) Hybrid programming Image-to-mesh conversion Mesh generation Parallel mesh generation Parallel processing Three dimensional models Two-level parallelization
Title	A hybrid parallel Delaunay image-to-mesh conversion algorithm scalable on distributed-memory clusters
URI	https://dx.doi.org/10.1016/j.cad.2017.11.006 https://www.proquest.com/docview/2110228735
Volume	103
WOSCitedRecordID	wos000437997400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2685 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002139 issn: 0010-4485 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV05b9swFCaMpEM7FD3RNGnBoVMFGRJ1kaMRpGg7GBlSwBtBiVTiREdgyUa89Lf3URTlI03QDF0Eg7YIWe_ju_j4PYS-SAJWyfNzV58QcGElMpcpL3QTIkSYSnDRvbxrNpFMp3Q2Y-ej0W97FmZVJFVF7-7Y7X8VNYyBsPXR2SeIe5gUBuAzCB2uIHa4_pPgJ87VWh_DcjSrd1EoUGuqEMtKrJ15CdrDbWu3VE1fcN5lyxxRXNaLeXtVOg3IrDtNBaNSk-rqflhKwh2l3o3PiqVmVmi2fVrbGMLRbJPSkTs1IfBqLk3tfGmNZFdMoBbV_KZeDTWVa2c63nyrGyOCXob5GgPXm7pxzsfbKQqfDsVug9qFAYgDox216wVbirPPaBoTbJKS95S7yTNcQ-CuKV79ZKzpV72_EGnvGbih7NBWtF1zmILrKSAA4h1j-yFJIgZa8XDy42z2c7DlxA9MANX_Absv3lUI7j3HQ57Nno3vHJeLV-hlH3HgiUHKazRS1Rv0YouH8i1SE2wwgy1msMUM3sEM3mAGD5jBFjMYRu9jBlvMvEO_vp1dnH53-_4bbhaQqHV174OUxCJLQupRllNPxUxoBiMWU5mGvkhCkeeSyjhSMRUil0SmUaBoruIU5PseHVR1pT4gHOn9_jCDYDzIdI8DBnFFkJE8J4SpRNIj5Nl3x7OenF73SCn4gzI7Ql-HW24NM8tjPw6tQHjvWhqXkQO4HrvtxAqP90u84TplQghNgujjUx7hGD3frI0TdNAuluoTepat2nmz-NwD7w-HkqTL
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+hybrid+parallel+Delaunay+image-to-mesh+conversion+algorithm+scalable+on+distributed-memory+clusters&rft.jtitle=Computer+aided+design&rft.au=Feng%2C+Daming&rft.au=Chernikov%2C+Andrey+N.&rft.au=Chrisochoides%2C+Nikos+P.&rft.date=2018-10-01&rft.issn=0010-4485&rft.volume=103&rft.spage=34&rft.epage=46&rft_id=info:doi/10.1016%2Fj.cad.2017.11.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cad_2017_11_006
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-4485&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-4485&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-4485&client=summon