File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Automatic mesh generation on a regular background grid

TitleAutomatic mesh generation on a regular background grid
Authors
KeywordsBackground Grid
Boundary Recovery
Mesh Generation
Triangular Mesh
Issue Date2002
Citation
Journal Of Computer Science And Technology, 2002, v. 17 n. 6, p. 882-887 How to Cite?
AbstractThis paper presents an automatic mesh generation procedure on a 2D domain based on a regular background grid. The idea is to devise a robust mesh generation scheme with equal emphasis on quality and efficiency. Instead of using a traditional regular rectangular grid, a mesh of equilateral triangles is employed to ensure triangular element of the best quality will be preserved in the interior of the domain. As for the boundary, it is to be generated by a node/segment insertion process. Nodes are inserted into the background mesh one by one following the sequence of the domain boundary. The local structure of the mesh is modified based on the Delaunay criterion with the introduction of each node. Those boundary segments, which are not produced in the phase of node insertion, will be recovered through a systematic element swap process. Two theorems will be presented and proved to set up the theoretical basic of the boundary recovery part. Examples will be presented to demonstrate the robustness and the quality of the mesh generated by the proposed technique.
Persistent Identifierhttp://hdl.handle.net/10722/150221
ISSN
2015 Impact Factor: 0.475
2015 SCImago Journal Rankings: 0.437
References

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_US
dc.contributor.authorLiu, Jen_US
dc.date.accessioned2012-06-26T06:02:31Z-
dc.date.available2012-06-26T06:02:31Z-
dc.date.issued2002en_US
dc.identifier.citationJournal Of Computer Science And Technology, 2002, v. 17 n. 6, p. 882-887en_US
dc.identifier.issn1000-9000en_US
dc.identifier.urihttp://hdl.handle.net/10722/150221-
dc.description.abstractThis paper presents an automatic mesh generation procedure on a 2D domain based on a regular background grid. The idea is to devise a robust mesh generation scheme with equal emphasis on quality and efficiency. Instead of using a traditional regular rectangular grid, a mesh of equilateral triangles is employed to ensure triangular element of the best quality will be preserved in the interior of the domain. As for the boundary, it is to be generated by a node/segment insertion process. Nodes are inserted into the background mesh one by one following the sequence of the domain boundary. The local structure of the mesh is modified based on the Delaunay criterion with the introduction of each node. Those boundary segments, which are not produced in the phase of node insertion, will be recovered through a systematic element swap process. Two theorems will be presented and proved to set up the theoretical basic of the boundary recovery part. Examples will be presented to demonstrate the robustness and the quality of the mesh generated by the proposed technique.en_US
dc.languageengen_US
dc.relation.ispartofJournal of Computer Science and Technologyen_US
dc.subjectBackground Griden_US
dc.subjectBoundary Recoveryen_US
dc.subjectMesh Generationen_US
dc.subjectTriangular Meshen_US
dc.titleAutomatic mesh generation on a regular background griden_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.scopuseid_2-s2.0-0036865823en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036865823&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume17en_US
dc.identifier.issue6en_US
dc.identifier.spage882en_US
dc.identifier.epage887en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLo, SH=7401542444en_US
dc.identifier.scopusauthoridLiu, J=8367341200en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats