File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Automatic merging of hexahedral meshes

TitleAutomatic merging of hexahedral meshes
Authors
KeywordsAutomatic Merging
Hexahedral And Tetrahedral Finite Element Meshes
Pyramid
Issue Date2012
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finel
Citation
Finite Elements In Analysis And Design, 2012, v. 55, p. 7-22 How to Cite?
AbstractA generic algorithm is proposed to merge structured and unstructured hexahedral meshes automatically into one single valid finite element mesh of hexahedral, tetrahedral and pyramid elements. In view of the success of merging arbitrary tetrahedral meshes in addressing the industrial need for rapid modification, update and manipulation of meshed objects, the merging algorithm is extended to hexahedral meshes by first dividing each hexahedral element into five or six tetrahedral elements. Non-intersected hexahedral elements can be easily recovered from the merged tetrahedral mesh as the constituent tetrahedra as a subdivision of the original hexahedral elements are intact and present in the mesh. Like the merging of tetrahedral meshes, the procedure is robust and efficient as all operations such as loops of intersection, incorporation of intersection segments, partition of boundary surfaces and identification of regions of intersection are deterministic and topological. The mesh merging algorithm provides a means to combine, modify and insert new features to existing hexahedral and tetrahedral meshes. It is also a powerful tool to create new meshes from existing hexahedral and tetrahedral meshes through the Boolean operations. High-quality regular hexahedral elements of the original mesh generated by mapping or extrusion will be preserved, which is important for finite element analysis as hexahedral elements are sensitive to shape distortions. Examples with details for each step of the mesh merging process are presented to elucidate the main ideas of the algorithm. © 2012 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/150660
ISSN
2015 Impact Factor: 2.175
2015 SCImago Journal Rankings: 1.278
ISI Accession Number ID
Funding AgencyGrant Number
HKSAR GRFHKU715110
Funding Information:

The financial support from the HKSAR GRF Grant to the research project HKU715110 Eon`` Drifted based seismic fragility analysis of high- rise RC buildings with transfer structures'' is greatly acknowledged.

References

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_US
dc.date.accessioned2012-06-26T06:06:32Z-
dc.date.available2012-06-26T06:06:32Z-
dc.date.issued2012en_US
dc.identifier.citationFinite Elements In Analysis And Design, 2012, v. 55, p. 7-22en_US
dc.identifier.issn0168-874Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/150660-
dc.description.abstractA generic algorithm is proposed to merge structured and unstructured hexahedral meshes automatically into one single valid finite element mesh of hexahedral, tetrahedral and pyramid elements. In view of the success of merging arbitrary tetrahedral meshes in addressing the industrial need for rapid modification, update and manipulation of meshed objects, the merging algorithm is extended to hexahedral meshes by first dividing each hexahedral element into five or six tetrahedral elements. Non-intersected hexahedral elements can be easily recovered from the merged tetrahedral mesh as the constituent tetrahedra as a subdivision of the original hexahedral elements are intact and present in the mesh. Like the merging of tetrahedral meshes, the procedure is robust and efficient as all operations such as loops of intersection, incorporation of intersection segments, partition of boundary surfaces and identification of regions of intersection are deterministic and topological. The mesh merging algorithm provides a means to combine, modify and insert new features to existing hexahedral and tetrahedral meshes. It is also a powerful tool to create new meshes from existing hexahedral and tetrahedral meshes through the Boolean operations. High-quality regular hexahedral elements of the original mesh generated by mapping or extrusion will be preserved, which is important for finite element analysis as hexahedral elements are sensitive to shape distortions. Examples with details for each step of the mesh merging process are presented to elucidate the main ideas of the algorithm. © 2012 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finelen_US
dc.relation.ispartofFinite Elements in Analysis and Designen_US
dc.subjectAutomatic Mergingen_US
dc.subjectHexahedral And Tetrahedral Finite Element Meshesen_US
dc.subjectPyramiden_US
dc.titleAutomatic merging of hexahedral meshesen_US
dc.typeArticleen_US
dc.identifier.emailLo, SH:hreclsh@hkucc.hku.hken_US
dc.identifier.authorityLo, SH=rp00223en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.finel.2012.02.003en_US
dc.identifier.scopuseid_2-s2.0-84857683575en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857683575&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume55en_US
dc.identifier.spage7en_US
dc.identifier.epage22en_US
dc.identifier.eissn1872-6925-
dc.identifier.isiWOS:000302129200002-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLo, SH=7401542444en_US
dc.identifier.citeulike10438999-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats