File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.cma.2004.12.011
- Scopus: eid_2-s2.0-23444450202
- WOS: WOS:000231533400004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Generation of finite element mesh with variable size over an unbounded 2D domain
Title | Generation of finite element mesh with variable size over an unbounded 2D domain |
---|---|
Authors | |
Keywords | Advancing front Boundary recovery Circle packing Neighbour tracing Triangular mesh generation Unbounded domain |
Issue Date | 2005 |
Publisher | Elsevier 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? |
Abstract | With 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 Identifier | http://hdl.handle.net/10722/71349 |
ISSN | 2023 Impact Factor: 6.9 2023 SCImago Journal Rankings: 2.397 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lo, SH | en_HK |
dc.contributor.author | Wang, WX | en_HK |
dc.date.accessioned | 2010-09-06T06:31:11Z | - |
dc.date.available | 2010-09-06T06:31:11Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Computer Methods In Applied Mechanics And Engineering, 2005, v. 194 n. 45-47, p. 4668-4684 | en_HK |
dc.identifier.issn | 0045-7825 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71349 | - |
dc.description.abstract | With 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.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cma | en_HK |
dc.relation.ispartof | Computer Methods in Applied Mechanics and Engineering | en_HK |
dc.rights | Computer Methods in Applied Mechanics and Engineering. Copyright © Elsevier BV. | en_HK |
dc.subject | Advancing front | en_HK |
dc.subject | Boundary recovery | en_HK |
dc.subject | Circle packing | en_HK |
dc.subject | Neighbour tracing | en_HK |
dc.subject | Triangular mesh generation | en_HK |
dc.subject | Unbounded domain | en_HK |
dc.title | Generation of finite element mesh with variable size over an unbounded 2D domain | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+domain | en_HK |
dc.identifier.email | Lo, SH:hreclsh@hkucc.hku.hk | en_HK |
dc.identifier.authority | Lo, SH=rp00223 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.cma.2004.12.011 | en_HK |
dc.identifier.scopus | eid_2-s2.0-23444450202 | en_HK |
dc.identifier.hkuros | 103717 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-23444450202&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 194 | en_HK |
dc.identifier.issue | 45-47 | en_HK |
dc.identifier.spage | 4668 | en_HK |
dc.identifier.epage | 4684 | en_HK |
dc.identifier.isi | WOS:000231533400004 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.scopusauthorid | Wang, WX=8695906800 | en_HK |
dc.identifier.issnl | 0045-7825 | - |