gScan:在GPU上加速Graham扫描
gScan: Accelerating Graham Scan on the GPU
摘要:
本文提出了一种基于GPU的Graham扫描快速实现方法。该算法由两个阶段组成:(1)在GPU上进行两轮预处理;(2)在CPU上完成凸包的求解。我们首先丢弃位于由四个端点组成的四边形内的内部点,根据角度对剩余的点进行排序,然后将它们划分为左区域和右区域。对于每个区域,我们使用所提出的预处理方法进行第二轮滤波,以进一步丢弃内部点。通过计算CPU上剩余点的凸包,最终得到期望的凸包。我们直接使用Thrust库提供的并行排序、归约和分区,以提高效率和简化性。实验结果表明,对于20 M点,我们的实现比Qhull实现获得了6倍~ 7倍的加速比。
英文摘要:
This paper presents a fast implementation of the Graham scan on the GPU. The proposed algorithm is composed of two stages: (1) two rounds of preprocessing performed on the GPU and (2) the finalization of finding the convex hull on the CPU. We first discard the interior points that locate inside a quadrilateral formed by four extreme points, sort the remaining points according to the angles, and then divide them into the left and the right regions. For each region, we perform a second round of filtering using the proposed preprocessing approach to discard the interior points in further. We finally obtain the expected convex hull by calculating the convex hull of the remaining points on the CPU. We directly employ the parallel sorting, reduction, and partitioning provided by the library Thrust for better efficiency and simplicity. Experimental results show that our implementation achieves 6x ~ 7x speedups over the Qhull implementation for 20M points.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。