File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A fast robust algorithm for the intersection of triangulated surfaces

TitleA fast robust algorithm for the intersection of triangulated surfaces
Authors
KeywordsIntersection
Neighbour tracing
Surface
Triangular mesh
Issue Date2004
PublisherSpringer-Verlag London Ltd. The Journal's web site is located at http://link.springer.de/link/service/journals/00366/
Citation
Engineering With Computers, 2004, v. 20 n. 1, p. 11-21 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. An algorithm based on tracing the neighbours of intersecting triangles (TNOIT) is proposed to determine the intersection lines. 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 checking for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. In the determination of intersection between two triangles, 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. Five examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm. © Springer-Verlag London Limited 2004.
Persistent Identifierhttp://hdl.handle.net/10722/71836
ISSN
2015 Impact Factor: 1.46
2015 SCImago Journal Rankings: 0.540
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLo, SHen_HK
dc.contributor.authorWang, WXen_HK
dc.date.accessioned2010-09-06T06:35:36Z-
dc.date.available2010-09-06T06:35:36Z-
dc.date.issued2004en_HK
dc.identifier.citationEngineering With Computers, 2004, v. 20 n. 1, p. 11-21en_HK
dc.identifier.issn0177-0667en_HK
dc.identifier.urihttp://hdl.handle.net/10722/71836-
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. An algorithm based on tracing the neighbours of intersecting triangles (TNOIT) is proposed to determine the intersection lines. 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 checking for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. In the determination of intersection between two triangles, 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. Five examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm. © Springer-Verlag London Limited 2004.en_HK
dc.languageengen_HK
dc.publisherSpringer-Verlag London Ltd. The Journal's web site is located at http://link.springer.de/link/service/journals/00366/en_HK
dc.relation.ispartofEngineering with Computersen_HK
dc.subjectIntersectionen_HK
dc.subjectNeighbour tracingen_HK
dc.subjectSurfaceen_HK
dc.subjectTriangular meshen_HK
dc.titleA fast robust algorithm for the intersection of triangulated surfacesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0177-0667&volume=20&spage=11&epage=21&date=2004&atitle=A+fast+robust+algorithm+for+the+intersection+of+triangulated+surfacesen_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.1007/s00366-004-0277-3en_HK
dc.identifier.scopuseid_2-s2.0-9544237003en_HK
dc.identifier.hkuros92809en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-9544237003&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume20en_HK
dc.identifier.issue1en_HK
dc.identifier.spage11en_HK
dc.identifier.epage21en_HK
dc.identifier.isiWOS:000220385900002-
dc.publisher.placeUnited Kingdomen_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