Please use this identifier to cite or link to this item:
https://doi.org/10.1109/PACT.2019.00039
Title: | Computing three-dimensional constrained delaunay refinement using the GPU | Authors: | Chen, Z Tan, TS |
Keywords: | cs.GR cs.GR |
Issue Date: | 1-Sep-2019 | Publisher: | IEEE | Citation: | Chen, Z, Tan, TS (2019-09-01). Computing three-dimensional constrained delaunay refinement using the GPU. 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT) 2019-September : 408-419. ScholarBank@NUS Repository. https://doi.org/10.1109/PACT.2019.00039 | Abstract: | We propose the first GPU algorithm for the 3D constrained Delaunay refinement problem. For an input of a piecewise linear complex G and a constant B, it produces, by adding Steiner points, a constrained Delaunay triangulation conforming to G and containing tetrahedra mostly with radiusedge ratios smaller than B. Our implementation of the algorithm shows that it can be an order of magnitude faster than the best CPU software while using similar quantities of Steiner points to produce triangulations of comparable qualities. It thus reduces the computing time of triangulation refinement from possibly an hour to a few seconds or minutes for possible use in interactive applications. | Source Title: | 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT) | URI: | https://scholarbank.nus.edu.sg/handle/10635/225179 | ISBN: | 9781728136134 | ISSN: | 1089-795X | DOI: | 10.1109/PACT.2019.00039 |
Appears in Collections: | Elements Staff Publications |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
gqm3d.pdf | Published version | 1.14 MB | Adobe PDF | CLOSED | None |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.