File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Generation of finite element mesh with variable size over an unbounded 2D domain

TitleGeneration of finite element mesh with variable size over an unbounded 2D domain
Authors
KeywordsAdvancing front
Boundary recovery
Circle packing
Neighbour tracing
Triangular mesh generation
Unbounded domain
Issue Date2005
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cma
Citation
Computer Methods In Applied Mechanics And Engineering, 2005, v. 194 n. 45-47, p. 4668-4684 How to Cite?
AbstractWith the advance of the finite element, general fluid dynamic and traffic flow problems with arbitrary boundary definition over an unbounded domain are tackled. This paper describes an algorithm for the generation of finite element mesh of variable element size over an unbounded 2D domain by using the advancing front circle packing technique. Unlike the conventional frontal method, the procedure does not start from the object boundary but starts from a convenient point within an open domain. The sequence of construction of the packing circles is determined by the shortest distance from the fictitious centre in such a way that the generation front is more or less a circular loop with occasional minor concave parts due to element size variation. As soon as a circle is added to the generation front, finite elements are directly generated by properly connecting frontal segments with the centre of the new circle. In contrast to other mesh generation schemes, the domain boundary is not considered in the process of circle packing, this reduces a lot of geometrical checks for intersection with frontal segments, and a linear time complexity for mesh generation can be achieved. In case the boundary of the domain is needed, simply generate an unbounded mesh to cover the entire object. As the element adjacency relationship of the mesh has already been established in the circle packing process, insertion of boundary segments by neighbour tracing is fast and robust. Details of such a boundary recovery procedure are described, and practical meshing problems are given to demonstrate how physical objects are meshed by the unbounded meshing scheme followed by the insertion of domain boundaries. © 2005 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/71349
ISSN
2015 Impact Factor: 3.467
2015 SCImago Journal Rankings: 2.952
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_HK
dc.contributor.authorWang, WXen_HK
dc.date.accessioned2010-09-06T06:31:11Z-
dc.date.available2010-09-06T06:31:11Z-
dc.date.issued2005en_HK
dc.identifier.citationComputer Methods In Applied Mechanics And Engineering, 2005, v. 194 n. 45-47, p. 4668-4684en_HK
dc.identifier.issn0045-7825en_HK
dc.identifier.urihttp://hdl.handle.net/10722/71349-
dc.description.abstractWith the advance of the finite element, general fluid dynamic and traffic flow problems with arbitrary boundary definition over an unbounded domain are tackled. This paper describes an algorithm for the generation of finite element mesh of variable element size over an unbounded 2D domain by using the advancing front circle packing technique. Unlike the conventional frontal method, the procedure does not start from the object boundary but starts from a convenient point within an open domain. The sequence of construction of the packing circles is determined by the shortest distance from the fictitious centre in such a way that the generation front is more or less a circular loop with occasional minor concave parts due to element size variation. As soon as a circle is added to the generation front, finite elements are directly generated by properly connecting frontal segments with the centre of the new circle. In contrast to other mesh generation schemes, the domain boundary is not considered in the process of circle packing, this reduces a lot of geometrical checks for intersection with frontal segments, and a linear time complexity for mesh generation can be achieved. In case the boundary of the domain is needed, simply generate an unbounded mesh to cover the entire object. As the element adjacency relationship of the mesh has already been established in the circle packing process, insertion of boundary segments by neighbour tracing is fast and robust. Details of such a boundary recovery procedure are described, and practical meshing problems are given to demonstrate how physical objects are meshed by the unbounded meshing scheme followed by the insertion of domain boundaries. © 2005 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cmaen_HK
dc.relation.ispartofComputer Methods in Applied Mechanics and Engineeringen_HK
dc.rightsComputer Methods in Applied Mechanics and Engineering. Copyright © Elsevier BV.en_HK
dc.subjectAdvancing fronten_HK
dc.subjectBoundary recoveryen_HK
dc.subjectCircle packingen_HK
dc.subjectNeighbour tracingen_HK
dc.subjectTriangular mesh generationen_HK
dc.subjectUnbounded domainen_HK
dc.titleGeneration of finite element mesh with variable size over an unbounded 2D domainen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0045-7825&volume=194&issue=45-47&spage=4668&epage=4684&date=2005&atitle=Generation+of+finite+element+mesh+with+variable+size+over+an+unbounded+2D+domainen_HK
dc.identifier.emailLo, SH:hreclsh@hkucc.hku.hken_HK
dc.identifier.authorityLo, SH=rp00223en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.cma.2004.12.011en_HK
dc.identifier.scopuseid_2-s2.0-23444450202en_HK
dc.identifier.hkuros103717en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-23444450202&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume194en_HK
dc.identifier.issue45-47en_HK
dc.identifier.spage4668en_HK
dc.identifier.epage4684en_HK
dc.identifier.isiWOS:000231533400004-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridLo, SH=7401542444en_HK
dc.identifier.scopusauthoridWang, WX=8695906800en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats