No Cover Image

Journal article 1457 views 240 downloads

Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation

Jianjun Chen, Jianjing Zheng, Yao Zheng, Hang Si, Oubay Hassan Orcid Logo, Kenneth Morgan Orcid Logo

Applied Mathematical Modelling

Swansea University Authors: Oubay Hassan Orcid Logo, Kenneth Morgan Orcid Logo

Check full text

DOI (Published version): 10.1016/j.apm.2017.07.011

Abstract

An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip named shell transformation is proposed to reduce the usage of Steiner point...

Full description

Published in: Applied Mathematical Modelling
ISSN: 0307-904X
Published: 2017
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa34757
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2017-07-26T20:23:48Z
last_indexed 2020-06-01T18:46:38Z
id cronfa34757
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2020-06-01T15:07:29.7903776</datestamp><bib-version>v2</bib-version><id>34757</id><entry>2017-07-26</entry><title>Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation</title><swanseaauthors><author><sid>07479d73eba3773d8904cbfbacc57c5b</sid><ORCID>0000-0001-7472-3218</ORCID><firstname>Oubay</firstname><surname>Hassan</surname><name>Oubay Hassan</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>17f3de8936c7f981aea3a832579c5e91</sid><ORCID>0000-0003-0760-1688</ORCID><firstname>Kenneth</firstname><surname>Morgan</surname><name>Kenneth Morgan</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-07-26</date><deptcode>CIVL</deptcode><abstract>An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip named shell transformation is proposed to reduce the usage of Steiner points in boundary recovery and thus to improve the performance of boundary recovery in terms of robustness, efficiency and element quality. Shell transformation searches for a local optimal mesh among multiple choices. Meanwhile, its recursive callings can perform flips on a much larger element set than a single flip, thereby leading the way to a better local optimum solution. By employing shell transformation properly, a mesh that intersects predefined constraints intensively can be transformed to another one with much fewer intersections, thus remarkably reducing the occasions of Steiner point insertion. Besides, shell transformation can be used to remove existing Steiner points by flipping the mesh aggressively. Meshing examples for various industrial applications and surface inputs mainly composed of stretched triangles are presented to illustrate how the improved algorithm works on difficult boundary constrained meshing tasks.</abstract><type>Journal Article</type><journal>Applied Mathematical Modelling</journal><publisher/><issnPrint>0307-904X</issnPrint><keywords>Mesh generation; Boundary recovery; Shell transformation; Delaunay triangulation; Steiner points; Tetrahedral meshes</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2017</publishedYear><publishedDate>2017-12-31</publishedDate><doi>10.1016/j.apm.2017.07.011</doi><url/><notes/><college>COLLEGE NANME</college><department>Civil Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>CIVL</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2020-06-01T15:07:29.7903776</lastEdited><Created>2017-07-26T14:03:25.9370993</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>Jianjing</firstname><surname>Zheng</surname><order>2</order></author><author><firstname>Yao</firstname><surname>Zheng</surname><order>3</order></author><author><firstname>Hang</firstname><surname>Si</surname><order>4</order></author><author><firstname>Oubay</firstname><surname>Hassan</surname><orcid>0000-0001-7472-3218</orcid><order>5</order></author><author><firstname>Kenneth</firstname><surname>Morgan</surname><orcid>0000-0003-0760-1688</orcid><order>6</order></author></authors><documents><document><filename>0034757-26072017140535.pdf</filename><originalFilename>chen2017(3).pdf</originalFilename><uploaded>2017-07-26T14:05:35.9800000</uploaded><type>Output</type><contentLength>1267447</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-07-20T00:00:00.0000000</embargoDate><copyrightCorrect>false</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2020-06-01T15:07:29.7903776 v2 34757 2017-07-26 Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation 07479d73eba3773d8904cbfbacc57c5b 0000-0001-7472-3218 Oubay Hassan Oubay Hassan true false 17f3de8936c7f981aea3a832579c5e91 0000-0003-0760-1688 Kenneth Morgan Kenneth Morgan true false 2017-07-26 CIVL An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip named shell transformation is proposed to reduce the usage of Steiner points in boundary recovery and thus to improve the performance of boundary recovery in terms of robustness, efficiency and element quality. Shell transformation searches for a local optimal mesh among multiple choices. Meanwhile, its recursive callings can perform flips on a much larger element set than a single flip, thereby leading the way to a better local optimum solution. By employing shell transformation properly, a mesh that intersects predefined constraints intensively can be transformed to another one with much fewer intersections, thus remarkably reducing the occasions of Steiner point insertion. Besides, shell transformation can be used to remove existing Steiner points by flipping the mesh aggressively. Meshing examples for various industrial applications and surface inputs mainly composed of stretched triangles are presented to illustrate how the improved algorithm works on difficult boundary constrained meshing tasks. Journal Article Applied Mathematical Modelling 0307-904X Mesh generation; Boundary recovery; Shell transformation; Delaunay triangulation; Steiner points; Tetrahedral meshes 31 12 2017 2017-12-31 10.1016/j.apm.2017.07.011 COLLEGE NANME Civil Engineering COLLEGE CODE CIVL Swansea University 2020-06-01T15:07:29.7903776 2017-07-26T14:03:25.9370993 Faculty of Science and Engineering School of Aerospace, Civil, Electrical, General and Mechanical Engineering - Civil Engineering Jianjun Chen 1 Jianjing Zheng 2 Yao Zheng 3 Hang Si 4 Oubay Hassan 0000-0001-7472-3218 5 Kenneth Morgan 0000-0003-0760-1688 6 0034757-26072017140535.pdf chen2017(3).pdf 2017-07-26T14:05:35.9800000 Output 1267447 application/pdf Accepted Manuscript true 2018-07-20T00:00:00.0000000 false eng
title Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
spellingShingle Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
Oubay Hassan
Kenneth Morgan
title_short Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
title_full Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
title_fullStr Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
title_full_unstemmed Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
title_sort Improved Boundary Constrained Tetrahedral Mesh Generation by Shell Transformation
author_id_str_mv 07479d73eba3773d8904cbfbacc57c5b
17f3de8936c7f981aea3a832579c5e91
author_id_fullname_str_mv 07479d73eba3773d8904cbfbacc57c5b_***_Oubay Hassan
17f3de8936c7f981aea3a832579c5e91_***_Kenneth Morgan
author Oubay Hassan
Kenneth Morgan
author2 Jianjun Chen
Jianjing Zheng
Yao Zheng
Hang Si
Oubay Hassan
Kenneth Morgan
format Journal article
container_title Applied Mathematical Modelling
publishDate 2017
institution Swansea University
issn 0307-904X
doi_str_mv 10.1016/j.apm.2017.07.011
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 An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip named shell transformation is proposed to reduce the usage of Steiner points in boundary recovery and thus to improve the performance of boundary recovery in terms of robustness, efficiency and element quality. Shell transformation searches for a local optimal mesh among multiple choices. Meanwhile, its recursive callings can perform flips on a much larger element set than a single flip, thereby leading the way to a better local optimum solution. By employing shell transformation properly, a mesh that intersects predefined constraints intensively can be transformed to another one with much fewer intersections, thus remarkably reducing the occasions of Steiner point insertion. Besides, shell transformation can be used to remove existing Steiner points by flipping the mesh aggressively. Meshing examples for various industrial applications and surface inputs mainly composed of stretched triangles are presented to illustrate how the improved algorithm works on difficult boundary constrained meshing tasks.
published_date 2017-12-31T03:43:08Z
_version_ 1763752005775392768
score 11.012678

Similar Items