文摘
We present a data-parallel algorithm for the construction of Delaunay triangulations on the sphere. Our method combines a variant of the classical Bowyer-Watson point insertion algorithm [2, 14] with the recently published parallelization technique by Jacobsen et al. [7]. It resolves a breakdown situation of the latter approach and is suitable for practical implementation due to its compact formulation. Some complementary aspects are discussed such as the parallel workload, floating-point arithmetics and an application to interpolation of scattered data.