File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/0045-7825(95)00854-1
- Scopus: eid_2-s2.0-0029415989
- WOS: WOS:A1995TK50400008
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast Delaunay triangulation in three dimensions
Title | Fast Delaunay triangulation in three dimensions |
---|---|
Authors | |
Issue Date | 1995 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cma |
Citation | Computer Methods in Applied Mechanics and Engineering, 1995, v. 128 n. 1-2, p. 153-167 How to Cite? |
Abstract | An efficient algorithm for Delaunay triangulation of a given set of points in three dimensions based on the point insertion technique is presented. Various steps of the triangulation algorithm are reviewed and many acceleration procedures are devised to speed up the triangulation process. New features include the search of a neighbouring point by the layering scheme, locating the containing tetrahedron by random walk, formulas of important geometrical quantities of a new tetrahedron based on those of an existing one, a novel approach in establishing the adjacency relationship, the use of adjacency table and the management of memory. The resulting scheme is one of the fastest triangulation algorithms known to the authors, which is able to generate tetrahedra generation rate of 15 000 tetrahedra per second for randomly generated points on a HP 735 machine. © 1995. |
Persistent Identifier | http://hdl.handle.net/10722/70638 |
ISSN | 2023 Impact Factor: 6.9 2023 SCImago Journal Rankings: 2.397 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Borouchaki, H | en_HK |
dc.contributor.author | Lo, SH | en_HK |
dc.date.accessioned | 2010-09-06T06:24:46Z | - |
dc.date.available | 2010-09-06T06:24:46Z | - |
dc.date.issued | 1995 | en_HK |
dc.identifier.citation | Computer Methods in Applied Mechanics and Engineering, 1995, v. 128 n. 1-2, p. 153-167 | en_HK |
dc.identifier.issn | 0045-7825 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/70638 | - |
dc.description.abstract | An efficient algorithm for Delaunay triangulation of a given set of points in three dimensions based on the point insertion technique is presented. Various steps of the triangulation algorithm are reviewed and many acceleration procedures are devised to speed up the triangulation process. New features include the search of a neighbouring point by the layering scheme, locating the containing tetrahedron by random walk, formulas of important geometrical quantities of a new tetrahedron based on those of an existing one, a novel approach in establishing the adjacency relationship, the use of adjacency table and the management of memory. The resulting scheme is one of the fastest triangulation algorithms known to the authors, which is able to generate tetrahedra generation rate of 15 000 tetrahedra per second for randomly generated points on a HP 735 machine. © 1995. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/cma | en_HK |
dc.relation.ispartof | Computer Methods in Applied Mechanics and Engineering | en_HK |
dc.rights | Computer Methods in Applied Mechanics and Engineering. Copyright © Elsevier BV. | en_HK |
dc.title | Fast Delaunay triangulation in three dimensions | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0045-7825&volume=128&spage=153 &epage= 167&date=1995&atitle=Fast+Delaunay+triangulation+in+three+dimensions | 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/0045-7825(95)00854-1 | - |
dc.identifier.scopus | eid_2-s2.0-0029415989 | en_HK |
dc.identifier.hkuros | 42445 | en_HK |
dc.identifier.hkuros | 10997 | - |
dc.identifier.volume | 128 | en_HK |
dc.identifier.issue | 1-2 | en_HK |
dc.identifier.spage | 153 | en_HK |
dc.identifier.epage | 167 | en_HK |
dc.identifier.isi | WOS:A1995TK50400008 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Borouchaki, H=7003830832 | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.issnl | 0045-7825 | - |