File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours

TitleAn algorithm for the intersection of quadrilateral surfaces by tracing of neighbours
Authors
KeywordsIntersection
Neighbour tracing
Quadrilateral
Surface
Triangle
Issue Date2003
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cma
Citation
Computer Methods In Applied Mechanics And Engineering, 2003, v. 192 n. 20-21, p. 2319-2338 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 quadrilateral and triangular 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. An algorithm based on tracing the neighbours of intersecting quadrilaterals is proposed to determine the intersection lines. A background grid is employed to limit the scope of searching for candidate quadrilaterals that may intersect. This will drastically cut down the time of geometrical check for intersections between quadrilaterals, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. Given the node numbers at the vertices of the candidate quadrilaterals, the neighbour relationship is then established. In the determination of intersection, each quadrilateral is divided into two triangles and four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm. © 2003 Elsevier Science B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/71167
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:29:32Z-
dc.date.available2010-09-06T06:29:32Z-
dc.date.issued2003en_HK
dc.identifier.citationComputer Methods In Applied Mechanics And Engineering, 2003, v. 192 n. 20-21, p. 2319-2338en_HK
dc.identifier.issn0045-7825en_HK
dc.identifier.urihttp://hdl.handle.net/10722/71167-
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 quadrilateral and triangular 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. An algorithm based on tracing the neighbours of intersecting quadrilaterals is proposed to determine the intersection lines. A background grid is employed to limit the scope of searching for candidate quadrilaterals that may intersect. This will drastically cut down the time of geometrical check for intersections between quadrilaterals, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. Given the node numbers at the vertices of the candidate quadrilaterals, the neighbour relationship is then established. In the determination of intersection, each quadrilateral is divided into two triangles and four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm. © 2003 Elsevier Science 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.subjectIntersectionen_HK
dc.subjectNeighbour tracingen_HK
dc.subjectQuadrilateralen_HK
dc.subjectSurfaceen_HK
dc.subjectTriangleen_HK
dc.titleAn algorithm for the intersection of quadrilateral surfaces by tracing of neighboursen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0045-7825&volume=192&spage=2319&epage=2338&date=2003&atitle=An+algorithm+for+the+intersection+of+quadrilateral+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/S0045-7825(03)00240-8en_HK
dc.identifier.scopuseid_2-s2.0-0038115684en_HK
dc.identifier.hkuros81940en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0038115684&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume192en_HK
dc.identifier.issue20-21en_HK
dc.identifier.spage2319en_HK
dc.identifier.epage2338en_HK
dc.identifier.isiWOS:000183474900002-
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