File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Finite element mesh generation over intersecting curved surfaces by tracing of neighbours

TitleFinite element mesh generation over intersecting curved surfaces by tracing of neighbours
Authors
KeywordsLocal meshing
Neighbour tracing
Triangular surface intersection
Issue Date2005
PublisherElsevier 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?
AbstractThe 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 Identifierhttp://hdl.handle.net/10722/71697
ISSN
2015 Impact Factor: 2.175
2015 SCImago Journal Rankings: 1.278
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_HK
dc.contributor.authorWang, WXen_HK
dc.date.accessioned2010-09-06T06:34:21Z-
dc.date.available2010-09-06T06:34:21Z-
dc.date.issued2005en_HK
dc.identifier.citationFinite Elements In Analysis And Design, 2005, v. 41 n. 4, p. 351-370en_HK
dc.identifier.issn0168-874Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/71697-
dc.description.abstractThe 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.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finelen_HK
dc.relation.ispartofFinite Elements in Analysis and Designen_HK
dc.rightsFinite Elements in Analysis and Design. Copyright © Elsevier BV.en_HK
dc.subjectLocal meshingen_HK
dc.subjectNeighbour tracingen_HK
dc.subjectTriangular surface intersectionen_HK
dc.titleFinite element mesh generation over intersecting curved surfaces by tracing of neighboursen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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+neighboursen_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.finel.2004.07.002en_HK
dc.identifier.scopuseid_2-s2.0-9544227373en_HK
dc.identifier.hkuros103460en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-9544227373&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume41en_HK
dc.identifier.issue4en_HK
dc.identifier.spage351en_HK
dc.identifier.epage370en_HK
dc.identifier.isiWOS:000226153000002-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridLo, SH=7401542444en_HK
dc.identifier.scopusauthoridWang, WX=7501759936en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats