title: Computing 2D constrained delaunay triangulation using the GPU.
abstract: We propose the first graphics processing unit (GPU) solution to compute the 2D constrained Delaunay triangulation (CDT) of a planar straight line graph (PSLG) consisting of points and edges. There are many existing CPU algorithms to solve the CDT problem in computational geometry, yet there has been no prior approach to solve this problem efficiently using the parallel computing power of the GPU. For the special case of the CDT problem where the PSLG consists of just points, which is simply the normal Delaunay triangulation (DT) problem, a hybrid approach using the GPU together with the CPU to partially speed up the computation has already been presented in the literature. Our work, on the other hand, accelerates the entire computation on the GPU. Our implementation using the CUDA programming model on NVIDIA GPUs is numerically robust, and runs up to an order of magnitude faster than the best sequential implementations on the CPU. This result is reflected in our experiment with both randomly generated PSLGs and real-world GIS data having millions of points and edges.
authors.affiliation: National University of Singapore, Singapore. qimeng@comp.nus.edu.sg
authors.forename: Meng
authors.initials: M
authors.lastname: Qi
authors.forename: Thanh-Tung
authors.initials: TT
authors.lastname: Cao
authors.forename: Tiow-Seng
authors.initials: TS
authors.lastname: Tan
mesh_terms: D000465:Algorithms; D003196:Computer Graphics / Q000295:instrumentation*; D007089:Image Enhancement / Q000295:instrumentation / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000295:instrumentation* / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000295:instrumentation / Q000379:methods; D009716:Numerical Analysis, Computer-Assisted / Q000295:instrumentation*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted / Q000295:instrumentation*