File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: 3D Delaunay triangulation of 1 billion points on a PC

Title3D Delaunay triangulation of 1 billion points on a PC
Authors
Issue Date2015
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finel
Citation
Finite Elements in Analysis and Design, 2015, v. 102-103, p. 65-73 How to Cite?
AbstractOf course, there is not enough memory on a PC with 16 GB RAM, and tetrahedra constructed have to be output to leave rooms for the creation of new tetrahedra in the next round of point insertion. A segmental zonal insertion scheme is developed, in which large data sets of more than 100 million points are partitioned into zones, each of which is triangulated in turn by the parallel zonal insertion module. An overlapping zone between two steps of insertion has to be allowed to ensure Delaunay tetrahedra formed at the boundary between two insertion zones. Tetrahedra between zones can be easily eliminated by the minimum vertex allocation method. The collection of all the tetrahedra from each insertion zone/step will produce the required triangulation for the point set. As the work of each typical step for the insertion of an equal number of points is very much similar, the processing time bears roughly a linear relationship with the number of points in the set, at a construction rate of more than 5 million Delaunay tetrahedra per second for the triangulation of 1 billion randomly generated points.
Persistent Identifierhttp://hdl.handle.net/10722/211001
ISSN
2015 Impact Factor: 2.175
2015 SCImago Journal Rankings: 1.278

 

DC FieldValueLanguage
dc.contributor.authorLo, SH-
dc.date.accessioned2015-06-25T07:28:43Z-
dc.date.available2015-06-25T07:28:43Z-
dc.date.issued2015-
dc.identifier.citationFinite Elements in Analysis and Design, 2015, v. 102-103, p. 65-73-
dc.identifier.issn0168-874X-
dc.identifier.urihttp://hdl.handle.net/10722/211001-
dc.description.abstractOf course, there is not enough memory on a PC with 16 GB RAM, and tetrahedra constructed have to be output to leave rooms for the creation of new tetrahedra in the next round of point insertion. A segmental zonal insertion scheme is developed, in which large data sets of more than 100 million points are partitioned into zones, each of which is triangulated in turn by the parallel zonal insertion module. An overlapping zone between two steps of insertion has to be allowed to ensure Delaunay tetrahedra formed at the boundary between two insertion zones. Tetrahedra between zones can be easily eliminated by the minimum vertex allocation method. The collection of all the tetrahedra from each insertion zone/step will produce the required triangulation for the point set. As the work of each typical step for the insertion of an equal number of points is very much similar, the processing time bears roughly a linear relationship with the number of points in the set, at a construction rate of more than 5 million Delaunay tetrahedra per second for the triangulation of 1 billion randomly generated points.-
dc.languageeng-
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/finel-
dc.relation.ispartofFinite Elements in Analysis and Design-
dc.title3D Delaunay triangulation of 1 billion points on a PC-
dc.typeArticle-
dc.identifier.emailLo, SH: hreclsh@hkucc.hku.hk-
dc.identifier.authorityLo, SH=rp00223-
dc.identifier.doi10.1016/j.finel.2015.05.003-
dc.identifier.volume102-103-
dc.identifier.spage65-
dc.identifier.epage73-
dc.publisher.placeNetherlands-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats