Journal article 1266 views 268 downloads
Domain decomposition approach for parallel improvement of tetrahedral meshes
Journal of Parallel and Distributed Computing, Volume: 107, Pages: 101 - 113
Swansea University Author: Chenfeng Li
-
PDF | Accepted Manuscript
Download (1.22MB)
DOI (Published version): 10.1016/j.jpdc.2017.04.008
Abstract
Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-sca...
Published in: | Journal of Parallel and Distributed Computing |
---|---|
ISSN: | 07437315 |
Published: |
2017
|
Online Access: |
Check full text
|
URI: | https://cronfa.swan.ac.uk/Record/cronfa33170 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
first_indexed |
2017-05-03T13:11:41Z |
---|---|
last_indexed |
2018-02-09T05:21:52Z |
id |
cronfa33170 |
recordtype |
SURis |
fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2017-06-20T13:05:41.7045373</datestamp><bib-version>v2</bib-version><id>33170</id><entry>2017-05-03</entry><title>Domain decomposition approach for parallel improvement of tetrahedral meshes</title><swanseaauthors><author><sid>82fe170d5ae2c840e538a36209e5a3ac</sid><ORCID>0000-0003-0441-211X</ORCID><firstname>Chenfeng</firstname><surname>Li</surname><name>Chenfeng Li</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-05-03</date><deptcode>CIVL</deptcode><abstract>Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-scale meshes. In this study, a novel domain decomposition approach is proposed for parallel mesh improvement. It analyses the dual graph of the input mesh to build an inter-domain boundary that avoids small dihedral angles and poorly shaped faces. Consequently, the parallel improver can fit this boundary without compromising the mesh quality. Meanwhile, the new method does not involve any inter-processor communications and therefore runs very efficiently. A parallel pre-processing pipeline that combines the proposed improver and existing parallel surface and volume meshers can prepare a quality mesh containing hundreds of millions of elements in minutes. Experiments are presented to show that the developed system is robust and applicable to models of a complication level experienced in industry.</abstract><type>Journal Article</type><journal>Journal of Parallel and Distributed Computing</journal><volume>107</volume><paginationStart>101</paginationStart><paginationEnd>113</paginationEnd><publisher/><issnPrint>07437315</issnPrint><keywords>Parallel algorithms; Mesh generation; Quality improvement; Domain decomposition; Dual graph</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2017</publishedYear><publishedDate>2017-12-31</publishedDate><doi>10.1016/j.jpdc.2017.04.008</doi><url/><notes/><college>COLLEGE NANME</college><department>Civil Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>CIVL</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2017-06-20T13:05:41.7045373</lastEdited><Created>2017-05-03T11:13:57.2104564</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Civil Engineering</level></path><authors><author><firstname>Jianjun</firstname><surname>Chen</surname><order>1</order></author><author><firstname>Dawei</firstname><surname>Zhao</surname><order>2</order></author><author><firstname>Yao</firstname><surname>Zheng</surname><order>3</order></author><author><firstname>Yan</firstname><surname>Xu</surname><order>4</order></author><author><firstname>Chenfeng</firstname><surname>Li</surname><orcid>0000-0003-0441-211X</orcid><order>5</order></author><author><firstname>Jianjing</firstname><surname>Zheng</surname><order>6</order></author></authors><documents><document><filename>0033170-03052017111545.pdf</filename><originalFilename>clayton2017(2)v4.pdf</originalFilename><uploaded>2017-05-03T11:15:45.3030000</uploaded><type>Output</type><contentLength>1258912</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-04-27T00:00:00.0000000</embargoDate><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807> |
spelling |
2017-06-20T13:05:41.7045373 v2 33170 2017-05-03 Domain decomposition approach for parallel improvement of tetrahedral meshes 82fe170d5ae2c840e538a36209e5a3ac 0000-0003-0441-211X Chenfeng Li Chenfeng Li true false 2017-05-03 CIVL Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-scale meshes. In this study, a novel domain decomposition approach is proposed for parallel mesh improvement. It analyses the dual graph of the input mesh to build an inter-domain boundary that avoids small dihedral angles and poorly shaped faces. Consequently, the parallel improver can fit this boundary without compromising the mesh quality. Meanwhile, the new method does not involve any inter-processor communications and therefore runs very efficiently. A parallel pre-processing pipeline that combines the proposed improver and existing parallel surface and volume meshers can prepare a quality mesh containing hundreds of millions of elements in minutes. Experiments are presented to show that the developed system is robust and applicable to models of a complication level experienced in industry. Journal Article Journal of Parallel and Distributed Computing 107 101 113 07437315 Parallel algorithms; Mesh generation; Quality improvement; Domain decomposition; Dual graph 31 12 2017 2017-12-31 10.1016/j.jpdc.2017.04.008 COLLEGE NANME Civil Engineering COLLEGE CODE CIVL Swansea University 2017-06-20T13:05:41.7045373 2017-05-03T11:13:57.2104564 Faculty of Science and Engineering School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Civil Engineering Jianjun Chen 1 Dawei Zhao 2 Yao Zheng 3 Yan Xu 4 Chenfeng Li 0000-0003-0441-211X 5 Jianjing Zheng 6 0033170-03052017111545.pdf clayton2017(2)v4.pdf 2017-05-03T11:15:45.3030000 Output 1258912 application/pdf Accepted Manuscript true 2018-04-27T00:00:00.0000000 true eng |
title |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
spellingShingle |
Domain decomposition approach for parallel improvement of tetrahedral meshes Chenfeng Li |
title_short |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
title_full |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
title_fullStr |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
title_full_unstemmed |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
title_sort |
Domain decomposition approach for parallel improvement of tetrahedral meshes |
author_id_str_mv |
82fe170d5ae2c840e538a36209e5a3ac |
author_id_fullname_str_mv |
82fe170d5ae2c840e538a36209e5a3ac_***_Chenfeng Li |
author |
Chenfeng Li |
author2 |
Jianjun Chen Dawei Zhao Yao Zheng Yan Xu Chenfeng Li Jianjing Zheng |
format |
Journal article |
container_title |
Journal of Parallel and Distributed Computing |
container_volume |
107 |
container_start_page |
101 |
publishDate |
2017 |
institution |
Swansea University |
issn |
07437315 |
doi_str_mv |
10.1016/j.jpdc.2017.04.008 |
college_str |
Faculty of Science and Engineering |
hierarchytype |
|
hierarchy_top_id |
facultyofscienceandengineering |
hierarchy_top_title |
Faculty of Science and Engineering |
hierarchy_parent_id |
facultyofscienceandengineering |
hierarchy_parent_title |
Faculty of Science and Engineering |
department_str |
School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Civil Engineering{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Civil Engineering |
document_store_str |
1 |
active_str |
0 |
description |
Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-scale meshes. In this study, a novel domain decomposition approach is proposed for parallel mesh improvement. It analyses the dual graph of the input mesh to build an inter-domain boundary that avoids small dihedral angles and poorly shaped faces. Consequently, the parallel improver can fit this boundary without compromising the mesh quality. Meanwhile, the new method does not involve any inter-processor communications and therefore runs very efficiently. A parallel pre-processing pipeline that combines the proposed improver and existing parallel surface and volume meshers can prepare a quality mesh containing hundreds of millions of elements in minutes. Experiments are presented to show that the developed system is robust and applicable to models of a complication level experienced in industry. |
published_date |
2017-12-31T03:40:49Z |
_version_ |
1763751860259258368 |
score |
11.016235 |