File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0030269931
- WOS: WOS:A1996VL29400001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Optimal delaunay point insertion
Title | Optimal delaunay point insertion |
---|---|
Authors | |
Keywords | Convex hull Delaunay triangulation Tesselation Voronoï |
Issue Date | 1996 |
Publisher | John Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430 |
Citation | International Journal For Numerical Methods In Engineering, 1996, v. 39 n. 20, p. 3407-3437 How to Cite? |
Abstract | An efficient algorithm for Delaunay triangulation of a given set of points in d dimensions is presented. Various steps of the point insertion algorithm are reviewed and many acceleration procedures are implemented to speed up the triangulation process. New features include the search for a neighbouring point by a layering scheme, locating the containing simplex by a random walk, formulas of important geometrical quantities of a new simplex based on those of an old one, a novel approach in establishing the adjacency relationship using connection matrices. The resulting scheme seems to be one of the fastest triangulation algorithms known, which enables us to generate tetrahedra in ℝ3 with a linear generation rate of 15000 tetrahedra per second for randomly generated points on an HP 735 workstation. |
Persistent Identifier | http://hdl.handle.net/10722/71673 |
ISSN | 2023 Impact Factor: 2.7 2023 SCImago Journal Rankings: 1.019 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Borouchaki, H | en_HK |
dc.contributor.author | George, PL | en_HK |
dc.contributor.author | Lo, SH | en_HK |
dc.date.accessioned | 2010-09-06T06:34:07Z | - |
dc.date.available | 2010-09-06T06:34:07Z | - |
dc.date.issued | 1996 | en_HK |
dc.identifier.citation | International Journal For Numerical Methods In Engineering, 1996, v. 39 n. 20, p. 3407-3437 | en_HK |
dc.identifier.issn | 0029-5981 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71673 | - |
dc.description.abstract | An efficient algorithm for Delaunay triangulation of a given set of points in d dimensions is presented. Various steps of the point insertion algorithm are reviewed and many acceleration procedures are implemented to speed up the triangulation process. New features include the search for a neighbouring point by a layering scheme, locating the containing simplex by a random walk, formulas of important geometrical quantities of a new simplex based on those of an old one, a novel approach in establishing the adjacency relationship using connection matrices. The resulting scheme seems to be one of the fastest triangulation algorithms known, which enables us to generate tetrahedra in ℝ3 with a linear generation rate of 15000 tetrahedra per second for randomly generated points on an HP 735 workstation. | en_HK |
dc.language | eng | en_HK |
dc.publisher | John Wiley & Sons Ltd. The Journal's web site is located at http://www3.interscience.wiley.com/cgi-bin/jhome/1430 | en_HK |
dc.relation.ispartof | International Journal for Numerical Methods in Engineering | en_HK |
dc.rights | International Journal for Numerical Methods in Engineering. Copyright © John Wiley & Sons Ltd. | en_HK |
dc.subject | Convex hull | en_HK |
dc.subject | Delaunay triangulation | en_HK |
dc.subject | Tesselation | en_HK |
dc.subject | Voronoï | en_HK |
dc.title | Optimal delaunay point insertion | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0029-5981&volume=39&spage=3407 &epage= 3437&date=1996&atitle=Optimal+Delaunay+point+insertion | 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.scopus | eid_2-s2.0-0030269931 | en_HK |
dc.identifier.hkuros | 42447 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0030269931&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 39 | en_HK |
dc.identifier.issue | 20 | en_HK |
dc.identifier.spage | 3407 | en_HK |
dc.identifier.epage | 3437 | en_HK |
dc.identifier.isi | WOS:A1996VL29400001 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Borouchaki, H=7003830832 | en_HK |
dc.identifier.scopusauthorid | George, PL=7202720451 | en_HK |
dc.identifier.scopusauthorid | Lo, SH=7401542444 | en_HK |
dc.identifier.issnl | 0029-5981 | - |