基于OpenMP的三维并行Delaunay网格生成算法及实现
针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并行Delaunay网格生成算法。算法采用划分求解区域为方格的方法实现候选点集的划分和并行插点。使用OpenMP对算法进行实现，并利用多种实现技术避免线程间的同步等待，提升算法效率。实验结果表明，该算法及所采用的实现技术可以在三维条件下快速生成大量网格单元，具有较高的并行效率，同时能够保证良好的网格质量。...
Saved in:
| Published in | 计算机应用研究 Vol. 33; no. 12; pp. 3658 - 3662 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
中国科学院计算机网络信息中心 超级计算中心，北京 100190
2016
中国科学院大学，北京 100190%中国科学院计算机网络信息中心 超级计算中心,北京,100190 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2016.12.031 |
Cover
| Abstract | 针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并行Delaunay网格生成算法。算法采用划分求解区域为方格的方法实现候选点集的划分和并行插点。使用OpenMP对算法进行实现，并利用多种实现技术避免线程间的同步等待，提升算法效率。实验结果表明，该算法及所采用的实现技术可以在三维条件下快速生成大量网格单元，具有较高的并行效率，同时能够保证良好的网格质量。 |
|---|---|
| AbstractList | TP301; 针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并行Delaunay网格生成算法。算法采用划分求解区域为方格的方法实现候选点集的划分和并行插点。使用OpenMP对算法进行实现，并利用多种实现技术避免线程间的同步等待，提升算法效率。实验结果表明，该算法及所采用的实现技术可以在三维条件下快速生成大量网格单元，具有较高的并行效率，同时能够保证良好的网格质量。 针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并行Delaunay网格生成算法。算法采用划分求解区域为方格的方法实现候选点集的划分和并行插点。使用OpenMP对算法进行实现，并利用多种实现技术避免线程间的同步等待，提升算法效率。实验结果表明，该算法及所采用的实现技术可以在三维条件下快速生成大量网格单元，具有较高的并行效率，同时能够保证良好的网格质量。 |
| Abstract_FL | For the fact that most parallel Delaunay mesh generation algorithms can’t suit the shared memory structure well, this paper proposed a parallel Delaunay mesh generation algorithm using OpenMP.It was based on the existing 2D parallel al-gorithm for shared memory structure and took into account the characteristics of the problem in 3D.The presented algorithm di-vided the domain into cubes in order to partition the candidate point set and inserted points in parallel.The algorithm was im-plemented with OpenMP.It used several methods to avoid the synchronization among threads and increased the efficiency of the algorithm.The experimental results show that the algorithm and implementation methods can rapidly generate large-scale mesh elements.It has a relatively good parallel efficiency together with good mesh quality. |
| Author | 张晓蒙 陆忠华 张鉴 |
| AuthorAffiliation | 中国科学院计算机网络信息中心超级计算中心,北京100190 中国科学院大学,北京100190 |
| AuthorAffiliation_xml | – name: 中国科学院计算机网络信息中心 超级计算中心，北京 100190; 中国科学院大学，北京 100190%中国科学院计算机网络信息中心 超级计算中心,北京,100190 |
| Author_FL | Lu Zhonghua Zhang Xiaomeng Zhang Jian |
| Author_FL_xml | – sequence: 1 fullname: Zhang Xiaomeng – sequence: 2 fullname: Lu Zhonghua – sequence: 3 fullname: Zhang Jian |
| Author_xml | – sequence: 1 fullname: 张晓蒙 陆忠华 张鉴 |
| BookMark | eNo9j81Kw0AcxPdQwbb6EuLBS-J_s8lu9iJI_YRKPfReNsmmJtRNTSiSuwcrUhUUwYPVFyiCIlr1bZrGxzBS8TTM8GOGqaCSipREaBmDTjjlq6EeJInSMQDWCOWWbgCmOjZ0ILiEyv_5PKokSQhgGphDGa1lw_FkPGh0pdrbz-9OJm_9_OMle3_9fjzfkB3RUyLNv66mD5_59XB6epmPbqfPN9nFWTa6zwdPC2jOF51ELv5pFTW3Npu1Ha3e2N6trdc1lxa7wuTcY75LpeSiMJ4NTHLbtzwwpXAJA8cHn1mMWZ7BsGC24whCXdsxGQUbSBWtzGqPhfKFarfCqBerYrAVJmGapuHvWWwUVwt0aYa6B5FqHwUF3I2DQxGnLcqAmibGFvkBEqdrjw |
| ClassificationCodes | TP301 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2016.12.031 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | 3D parallel Delaunay mesh generation algorithm and its implementation based on OpenMP |
| DocumentTitle_FL | 3 D parallel Delaunay mesh generation algorithm and its implementation based on OpenMP |
| EndPage | 3662 |
| ExternalDocumentID | jsjyyyj201612031 670644115 |
| GrantInformation_xml | – fundername: 国家“863”计划资助项目; 国家自然科学基金资助项目 funderid: (2015AA01A302); (91130019，91330206，11271350) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c601-a499d7fc6ee9aa49d807e98f5d04eac370bf0f75775d271a78bba36c8b4760803 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 10:07:42 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 12 |
| Keywords | 3D mesh generation Delaunay algorithm OpenMP 三维网格生成 Delaunay算法 并行计算 parallel computing |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c601-a499d7fc6ee9aa49d807e98f5d04eac370bf0f75775d271a78bba36c8b4760803 |
| Notes | 51-1196/TP For the fact that most parallel Delaunay mesh generation algorithms can＇ t suit the shared memory structure well, this paper proposed a parallel Delaunay mesh generation algorithm using OpenMP. It was based on the existing 2D parallel algorithm for shared memory structure and took into account the characteristics of the problem in 3D. The presented algorithm divided the domain into cubes in order to partition the candidate point set and inserted points in parallel. The algorithm was im- plemented with OpenMP. It used several methods to avoid the synchronization among threads and increased the efficiency of the algorithm. The experimental results show that the algorithm and implementation methods can rapidly generate large-scale mesh elements. It has a relatively good parallel efficiency together with good mesh quality. 3D mesh generation; Delaunay algorithm; parallel computing; OpenMP Zhang Xiaomeng1,2, Lu Zhonghua1 , Zhang Jian1 （1. Supercomputing Center, Computer Network Information Center, Chinese |
| PageCount | 5 |
| ParticipantIDs | wanfang_journals_jsjyyyj201612031 chongqing_primary_670644115 |
| PublicationCentury | 2000 |
| PublicationDate | 2016 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – year: 2016 text: 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationYear | 2016 |
| Publisher | 中国科学院计算机网络信息中心 超级计算中心，北京 100190 中国科学院大学，北京 100190%中国科学院计算机网络信息中心 超级计算中心,北京,100190 |
| Publisher_xml | – name: 中国科学院大学，北京 100190%中国科学院计算机网络信息中心 超级计算中心,北京,100190 – name: 中国科学院计算机网络信息中心 超级计算中心，北京 100190 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.044883 |
| Snippet | 针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并... TP301; 针对大多数并行Delaunay网格生成算法无法充分利用多核共享内存结构的问题，在原有面向共享内存的二维并行算法基础上，根据三维问题的特点提出基于OpenMP的三维并... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 3658 |
| SubjectTerms | Delaunay算法 OpenMP 三维网格生成 并行计算 |
| Title | 基于OpenMP的三维并行Delaunay网格生成算法及实现 |
| URI | http://lib.cqvip.com/qk/93231X/201612/670644115.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201612031 |
| Volume | 33 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate issn: 1001-3695 databaseCode: ABDBF dateStart: 20130901 customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn isFulltext: true dateEnd: 99991231 titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn omitProxy: true ssIdentifier: ssib025702191 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1da9RAcDlaEF_8FmtVTug-ldR8bPbjRUjuchSh4sMJfTuSXNJylFTt3cP12QcVqQqK4IPVP1AExY-q_6Z38Wc4s8ldo0hRX5bN7OzMsLOZmV12ZwlZgCjZTZmyDCcKTYOBQzZCHjlGagkZhm5sqhg39Fdu8uXb7Maqu1qrfaqcWhr0o6V4-4_3Sv5HqwADveIt2X_Q7JQoAKAO-oUSNAzlX-mYBi5VLep7NGBYygDPh6zcooGgCj6ZhksqFUJ8n_oMu_iK-pwGknoWlY1mshEOsnCoUZpUWTTg1DOp39BkGHIAiJRUmQjxAqoEQnyHKhfpyRaVHlawKUAcGVDfrMa9mluADKsUVEPL7mIJjAp2ntQ4ZgnxUNjJtNC4DWzE3ooqBwkrG-qLNFAIklwjtTQSyNYEYRYr_RSOhs-qux3FNczSNOPhL4cXT3JObHeRRGMyR-2KJXZ4kRK-9OoOL4z-7x7DUVxpj4E8lqY88Mwf1_vEpY_6NSc3FybGkZjcYNbGjaAZMuv5Tb91GIlC4FbNTGhj0p_DlR-m7ecVU4tvCYLvmJpa13KEqx8mKIIKBo1FYo1SwGNkoZT-2lGyY8aQ9c1s7S7EQfpaWpaG2VolgmqfIifKpU_dK-bxaVLbXj9DTk6eFamXXuYsuT7a3T_Y3ymmcv7q_sHnh_nXD6MvH3-8fTyZrPn3Z-M33_Lnu-MHT_O9l-P3L0ZPHo32Xuc7786RditoN5aN8pkPI-Ygcghr7q5IY54kKoSPrjRFomTqdk0GUYEjzCg1UxgN4XZtYYVCRlHo8FhGTHBY7zjnyUy2mSUXSL1rsdR0QxFbbsI4mKBuHKVSCMtKcRmfzJH56Wh07hTZXDpTXc6Rq-X4dMp_fKvT2-oNh8Mejqhlw3hePJLCPDmOmMUO3SUy0783SC5DzNqPrpTz4ycjCHWz |
| linkProvider | EBSCOhost |
| 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=%E5%9F%BA%E4%BA%8EOpenMP%E7%9A%84%E4%B8%89%E7%BB%B4%E5%B9%B6%E8%A1%8CDelaunay%E7%BD%91%E6%A0%BC%E7%94%9F%E6%88%90%E7%AE%97%E6%B3%95%E5%8F%8A%E5%AE%9E%E7%8E%B0&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E5%BC%A0%E6%99%93%E8%92%99+%E9%99%86%E5%BF%A0%E5%8D%8E+%E5%BC%A0%E9%89%B4&rft.date=2016&rft.issn=1001-3695&rft.volume=33&rft.issue=12&rft.spage=3658&rft.epage=3662&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2016.12.031&rft.externalDocID=670644115 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |