arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.3454cs.CG
收藏

一种在GPU上加速凸包计算的简单预处理方法

A Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU

Gang Mei

摘要:

一种加速点集凸包计算的有效策略是通过丢弃内部点来过滤输入点。在本文中,我们提出了这样一个简单而有效的预处理方法,通过利用GPU。我们的方法背后的基本思想是丢弃位于由16个端点形成的凸多边形内的点。由于点集的极值点在所有点旋转相同角度时不会发生变化,因此可以在原始点集中找到四组具有最小或最大x或y坐标的极值点。这16个端点然后用于形成凸多边形。我们检查所有输入点,并丢弃位于凸多边形内部的点。我们使用剩余的点来计算期望的凸包。实验结果表明:采用该预处理算法时,与不采用该方法的情况相比,平均加速比约为4倍~ 5倍,最佳情况下加速比约为5倍~ 6倍。此外,在大多数实验测试中,超过99%的输入点可以被丢弃。

英文摘要:

An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a straightforward and efficient preprocessing approach by exploiting the GPU. The basic idea behind our approach is to discard the points that locate inside a convex polygon formed by 16 extreme points. Due to the fact that the extreme points of a point set do not alter when all points are rotated in the same angle, four groups of extreme points with min or max x or y coordinates can be found in the original point set and three rotated point sets. These 16 extreme points are then used to form a convex polygon. We check all input points and discard the points that locate inside the convex polygon. We use the remaining points to calculate the expected convex hull. Experimental results show that: when employing the proposed preprocessing algorithm, it achieves the speedups of about 4x ~5x on average and 5x ~ 6x in the best cases over the cases where the proposed approach is not used. In addition, more than 99% input points can be discarded in most experimental tests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑