覆盖海量点集的单位圆盘覆盖算法实验
Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets
摘要:
给定平面上的一组$n$点,单位圆盘覆盖(UDC)问题要求计算覆盖这些点所需的最小单位圆盘数以及圆盘的放置。该问题是NP-难的,在过去的三十年中已经设计了几种近似算法。在本文中,我们已经设计和实验比较了这些算法在大量点集上的实际性能。我们的目标是调查哪些算法运行速度快,并在实践中给出良好的近似。我们提出了一个简单的$7$近似算法的UDC,运行在$O(n)$预期的时间,并使用$O(s)$额外的空间,其中$s$表示的大小生成的封面。在我们的实验中,它被证明是最快的。我们还提出了两种方法来减少它生成的封面的大小,而不会减慢它。据我们所知,这是第一个工作,实验比较几何覆盖算法。使用大规模点集(数百万)进行的实验揭示了它们的实际用途。我们通过GitHub -https://github.com/ghoshanirban/UnitDiskCoverAlgorithms分享工程算法,以便在几何优化领域进行更广泛的使用和未来的研究。
英文摘要:
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation algorithms have been designed over the last three decades. In this paper, we have engineered and experimentally compared practical performances of some of these algorithms on massive pointsets. The goal is to investigate which algorithms run fast and give good approximation in practice. We present a simple $7$-approximation algorithm for UDC that runs in $O(n)$ expected time and uses $O(s)$ extra space, where $s$ denotes the size of the generated cover. In our experiments, it turned out to be the speediest of all. We also present two heuristics to reduce the sizes of covers generated by it without slowing it down by much. To our knowledge, this is the first work that experimentally compares geometric covering algorithms. Experiments with them using massive pointsets (in the order of millions) throw light on their practical uses. We share the engineered algorithms via GitHub - https://github.com/ghoshanirban/UnitDiskCoverAlgorithms for broader uses and future research in the domain of geometric optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。