Please use this identifier to cite or link to this item:
Title: Computing delaunay refinement using the GPU
Authors: Chen, Z 
Qi, M
Tan, TS 
Issue Date: 25-Feb-2017
Publisher: ACM
Citation: Chen, Z, Qi, M, Tan, TS (2017-02-25). Computing delaunay refinement using the GPU. I3D '17: Symposium on Interactive 3D Graphics and Games : 11:1-11:1. ScholarBank@NUS Repository.
Abstract: We propose the first working GPU algorithm for the 2D Delaunay refinement problem. Our algorithm adds Steiner points to an input planar straight line graph (PSLG) to generate a constrained Delaunay mesh with triangles having no angle smaller than an input θ. It is shown to run from a few times to an order of magnitude faster than the well-known Triangle software, which is the fastest CPU Delaunay mesh generator. Our implementation handles degeneracy and is numerically robust. It is proven to terminate with finite output size for an input PSLG with no angle smaller than 60° and θ ≤ 20:7°. In addition, we notice meshes generated by our algorithm are of similar sizes to that by Triangle, which has incorporated good consideration in keeping output small in size.
Source Title: I3D '17: Symposium on Interactive 3D Graphics and Games
ISBN: 9781450348867
DOI: 10.1145/3023368.3023373
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
refinement.pdfSupporting information1.98 MBAdobe PDF



Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.