arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.01543cs.CGcs.GR
收藏

Oexp(N)复杂度下E2最大距离算法分析与实验结果

Algorithm for Finding an Exact Maximum Distance in E2 with Oexp(N) Complexity: Analysis and Experimental Results

Vaclav Skala

摘要:

本文描述了一种新的快速,简单和强大的算法,O(N)的预期复杂度,使减少运行时间需要找到两个点的最大距离在E2。它可以很容易地修改为E3的情况下,一般。为了验证算法的有效性,在不同的数据集上对算法进行了实验,实验结果表明,与基于蛮力法、凸包法和凸包直径法的标准算法相比,该算法具有更好的性能。该算法提供了一个显着的速度提高应用程序,当中型和大型数据集处理。对于E2中1000万点的随机分布点,该算法比标准的Brute force算法快10000倍以上,比凸包直径计算快4倍以上。所提出的算法的速度增长与处理的点的数量。

英文摘要:

This paper describes a novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run time needed to find the maximum distance of two points in E2. It can be easily modified for the E3 case in general. The proposed algorithm has been evaluated experimentally on larger different datasets in order to verify it and prove expected properties of it. Experiments proved the advantages of the proposed algorithm over the standard algorithms based on the Brute force, convex hull or convex hull diameters approaches. The proposed algorithm gives a significant speed-up to applications, when medium and large data sets are processed. It is over 10 000 times faster than the standard Brute force algorithm for 10 mil. points randomly distributed points in E2 and over 4 times faster than convex hull diameter computation. The speed-up of the proposed algorithm grows with the number of points processed.

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

↑