File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.finel.2004.07.002
- Scopus: eid_2-s2.0-9544227373
- WOS: WOS:000226153000002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Finite element mesh generation over intersecting curved surfaces by tracing of neighbours
Title | Finite element mesh generation over intersecting curved surfaces by tracing of neighbours |
---|---|
Authors | |
Keywords | Local meshing Neighbour tracing Triangular surface intersection |
Issue Date | 2005 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finel |
Citation | Finite Elements In Analysis And Design, 2005, v. 41 n. 4, p. 351-370 How to Cite? |
Abstract | The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical check for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. The intersection lines are determined by the robust algorithm based on tracing the neighbours of intersecting triangles. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability. In this paper, the consistent treatment of mesh generation along intersection lines is emphasized. The procedure ensures that all mesh generation operations are carried out on the surface concerned without leaving the surface so that elements generated will always be on the surface. Five examples on a great variety of surface and mesh characteristics are given to illustrate the efficiency and robustness of the algorithm. © 2004 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/71697 |
ISSN | 2023 Impact Factor: 3.5 2023 SCImago Journal Rankings: 0.835 |
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:34:21Z | - |
dc.date.available | 2010-09-06T06:34:21Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Finite Elements In Analysis And Design, 2005, v. 41 n. 4, p. 351-370 | en_HK |
dc.identifier.issn | 0168-874X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71697 | - |
dc.description.abstract | The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical check for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. The intersection lines are determined by the robust algorithm based on tracing the neighbours of intersecting triangles. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability. In this paper, the consistent treatment of mesh generation along intersection lines is emphasized. The procedure ensures that all mesh generation operations are carried out on the surface concerned without leaving the surface so that elements generated will always be on the surface. Five examples on a great variety of surface and mesh characteristics are given to illustrate the efficiency and robustness of the algorithm. © 2004 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/finel | en_HK |
dc.relation.ispartof | Finite Elements in Analysis and Design | en_HK |
dc.rights | Finite Elements in Analysis and Design. Copyright © Elsevier BV. | en_HK |
dc.subject | Local meshing | en_HK |
dc.subject | Neighbour tracing | en_HK |
dc.subject | Triangular surface intersection | en_HK |
dc.title | Finite element mesh generation over intersecting curved surfaces by tracing of neighbours | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0168-874X&volume=41&issue=4&spage=351&epage=370&date=2005&atitle=Finite+element+mesh+generation+over+intersecting+curved+surfaces+by+tracing+of+neighbours | 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.finel.2004.07.002 | en_HK |
dc.identifier.scopus | eid_2-s2.0-9544227373 | en_HK |
dc.identifier.hkuros | 103460 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-9544227373&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 41 | en_HK |
dc.identifier.issue | 4 | en_HK |
dc.identifier.spage | 351 | en_HK |
dc.identifier.epage | 370 | en_HK |
dc.identifier.isi | WOS:000226153000002 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.scopusauthorid | Wang, WX=7501759936 | en_HK |
dc.identifier.issnl | 0168-874X | - |