File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s00366-004-0277-3
- Scopus: eid_2-s2.0-9544237003
- WOS: WOS:000220385900002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A fast robust algorithm for the intersection of triangulated surfaces
Title | A fast robust algorithm for the intersection of triangulated surfaces |
---|---|
Authors | |
Keywords | Intersection Neighbour tracing Surface Triangular mesh |
Issue Date | 2004 |
Publisher | Springer-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? |
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. 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 Identifier | http://hdl.handle.net/10722/71836 |
ISSN | 2022 Impact Factor: 8.7 2023 SCImago Journal Rankings: 1.040 |
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:35:36Z | - |
dc.date.available | 2010-09-06T06:35:36Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Engineering With Computers, 2004, v. 20 n. 1, p. 11-21 | en_HK |
dc.identifier.issn | 0177-0667 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71836 | - |
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. 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.language | eng | en_HK |
dc.publisher | Springer-Verlag London Ltd. The Journal's web site is located at http://link.springer.de/link/service/journals/00366/ | en_HK |
dc.relation.ispartof | Engineering with Computers | en_HK |
dc.subject | Intersection | en_HK |
dc.subject | Neighbour tracing | en_HK |
dc.subject | Surface | en_HK |
dc.subject | Triangular mesh | en_HK |
dc.title | A fast robust algorithm for the intersection of triangulated surfaces | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+surfaces | 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.1007/s00366-004-0277-3 | en_HK |
dc.identifier.scopus | eid_2-s2.0-9544237003 | en_HK |
dc.identifier.hkuros | 92809 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-9544237003&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 20 | en_HK |
dc.identifier.issue | 1 | en_HK |
dc.identifier.spage | 11 | en_HK |
dc.identifier.epage | 21 | en_HK |
dc.identifier.isi | WOS:000220385900002 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.scopusauthorid | Wang, WX=7501759936 | en_HK |
dc.identifier.issnl | 0177-0667 | - |