检测点集中的所有正多边形
Detecting all regular polygons in a point set
摘要:
本文分析了在n个点集上求正多边形的时间复杂度。我们结合了两种不同的方法来找到规则多边形,这取决于它们的边数。我们的结果取决于参数alpha,它已被用来限制可以由n个点形成的等腰三角形的最大数量。这个界限已经被表示为O(n^{2+2alpha+ n}),并且alpha的当前最佳值是~0.068。我们的算法通过扫描点集的直线来找到具有O(n^alpha)边缘的多边形,而通过随机采样来找到更大的多边形。我们可以找到所有正多边形的高概率在O(n^{2+alpha+ alpha})的期望时间为每个正的n。这与Brass的O(n^{2+2alpha+ n})确定性算法相比很好。
英文摘要:
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha, which has been used to bound the maximum number of isosceles triangles that can be formed by n points. This bound has been expressed as O(n^{2+2alpha+epsilon}), and the current best value for alpha is ~0.068. Our algorithm finds polygons with O(n^alpha) edges by sweeping a line through the set of points, while larger polygons are found by random sampling. We can find all regular polygons with high probability in O(n^{2+alpha+epsilon}) expected time for every positive epsilon. This compares well to the O(n^{2+2alpha+epsilon}) deterministic algorithm of Brass.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。