GPredicates: GPU Implementation of Robust and Adaptive Floating-Point Predicates for Computational Geometry

Geometric algorithms rely on predicates, among them, the 2D and 3D orientation and incircle tests are important ones. Shewchuk's adaptive floating-point predicate is a well-known C implementation, which is embedded in many computational geometry algorithm libraries. Recently, GPU with its enormous parallel computing power has been used widely in many disciplines for general purpose computation, including computational geometry. In this paper, we propose GPredicates, a CUDA implementation of the geometric predicates, which can be used as the GPU version of Shewchuk's work. In the GPredicates, the original predicate program is split into two GPU kernels: a fast check and an exact check kernel. In most cases, the fast check is enough, only a few threads go into the exact check which requires a lot more temporary memory. Furthermore, we use on-the-fly compaction on the shared memory to collect all threads that need to go into the exact check kernel to speed up the compaction time. According to our experiments in constructing 2D and 3D Delaunay triangulation and 2D constrained Delaunay triangulation for both synthetic and real-world datasets, such a GPU technique can speed up the computing time for predicates by 3 to 4 times and can be used as the GPU version of Shewchuk's work for other computational geometry problems.

Abstract licence: CC BY-NC-ND

16 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.