File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast Delaunay triangulation in three dimensions

TitleFast Delaunay triangulation in three dimensions
Authors
Issue Date1995
PublisherElsevier 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?
AbstractAn 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 Identifierhttp://hdl.handle.net/10722/70638
ISSN
2015 Impact Factor: 3.467
2015 SCImago Journal Rankings: 2.952
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorBorouchaki, Hen_HK
dc.contributor.authorLo, SHen_HK
dc.date.accessioned2010-09-06T06:24:46Z-
dc.date.available2010-09-06T06:24:46Z-
dc.date.issued1995en_HK
dc.identifier.citationComputer Methods in Applied Mechanics and Engineering, 1995, v. 128 n. 1-2, p. 153-167en_HK
dc.identifier.issn0045-7825en_HK
dc.identifier.urihttp://hdl.handle.net/10722/70638-
dc.description.abstractAn 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.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.titleFast Delaunay triangulation in three dimensionsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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+dimensionsen_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/0045-7825(95)00854-1-
dc.identifier.scopuseid_2-s2.0-0029415989en_HK
dc.identifier.hkuros42445en_HK
dc.identifier.hkuros10997-
dc.identifier.volume128en_HK
dc.identifier.issue1-2en_HK
dc.identifier.spage153en_HK
dc.identifier.epage167en_HK
dc.identifier.isiWOS:A1995TK50400008-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridBorouchaki, H=7003830832en_HK
dc.identifier.scopusauthoridLo, SH=7401542444en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats