arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.4809cs.CG
收藏

一种基于秩的稠密数据集凸包方法

A Rank-based Convex Hull method for Dense Data Sets

G. M. Megson, J. Cadenas

摘要:

提出了一种新的计算n个整数点的充分稠密集的凸包的二维方法。该方法采用了一个排名功能,避免直接排序的点,从而降低了整体的时间复杂度。排序的点创建一个简单的多边形链,从中可以使用合适的O(n)方法找到凸包。结果是通过将点的密度(或比率)限制为m来实现的,其中m是表示产生O(n+m)方法的点集所需的排名函数的最大值。然后,基于数据集的位长度p开发了一种快速方法,该方法进一步减少了该时间。所需的条件很容易满足的图像处理方法,确定多边形区域的壳密度是在3%的范围内。我们的实验范围的问题域表明,这是不典型的。由于该方法的复杂度与当前机器的位大小p(p=32,p=64)有关,因此该方法对于所有实际目的都是O(n)。提供了一个简短的证明。

英文摘要:

A novel 2-D method for computing the convex hull of a sufficiently dense set of n integer points is introduced. The approach employs a ranking function that avoids sorting the points directly thus reducing the overall time complexity. The ranked points create a simple polygonal chain from which the Convex Hull can be found using a suitable O(n) method. The result is achieved by placing a bound on the density (or ratio) of points to m, where m is the maximum value of the ranking function required to represent the set of points yielding an O(n+m) method. A fast method is then developed based on the bit length, p, of the data set which reduces this time further. The required conditions are easily satisfied by image processing methods which determine the Hulls of polygonal regions where the densities are in the range of 3%. Our experiments on a range problem domains show that this is not atypical. Since the complexity of the method is related to the bit size p for current machines (p=32, p=64) the method is for all practical purposes O(n). A short proof is provided.

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

↑