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

轴平行矩形的格点与非格点穿透

Lattice and Non-lattice Piercing of Axis-Parallel Rectangles

Algoresearch L.L.C.(Algore研究有限公司);Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);Computer Science Institute, Faculty of Mathematics and Physics, Charles University(查理大学数学物理学院计算机研究所)

Adrian Dumitrescu, Arsenii Sagdeev, Josef Tkadlec

AI总结:

本文研究轴平行矩形的穿透问题,提出寻找最优穿透格点的多项式算法,并证明格点穿透密度与最优穿透密度存在常数间隙,且最差可差20%。

摘要:

给定平面中一族形状 ${\mathcal F}$,我们研究能够穿透(“相交”、“击中”)${\mathcal F}$ 中每个形状的所有平移的点集 $P$ 的最低可能密度。例如,如果 ${\mathcal F}$ 由两个轴平行矩形组成,则已知的最佳穿透集(即密度最低的穿透集)是格点。对于给定的有限轴平行矩形族 ${\mathcal F}$,我们提出了一种寻找最优 ${\mathcal F}$-穿透格点的算法。该算法的运行时间关于矩形数量和族中矩形的最大纵横比呈多项式。此前没有已知的针对该问题的算法。另一方面,我们证明对于每个 $n \geq 3$,存在一个由 $n$ 个轴平行矩形组成的族,使得格点所能达到的最佳穿透密度与该族的最优穿透密度之间存在正的(常数)间隙。最后,我们表明最佳格点有时可能比最优穿透集差 $20\\%$。

英文摘要:

Given a family ${\mathcal F}$ of shapes in the plane, we study what is the lowest possible density of a point set $P$ that pierces (``intersects'', ``hits'') all translates of each shape in ${\mathcal F}$. For instance, if ${\mathcal F}$ consists of two axis-parallel rectangles the best known piercing set, i.e., one with the lowest density, is a lattice. Given a finite family ${\mathcal F}$ of axis-parallel rectangles, we present an algorithm for finding an optimal ${\mathcal F}$-piercing lattice. The algorithm runs in time polynomial in the number of rectangles and the maximum aspect ratio of the rectangles in the family. No prior algorithms for this problem were known. On the other hand, we show that for every $n \geq 3$, there exists a family of $n$ axis-parallel rectangles for which the best piercing density achieved by a lattice is separated by a positive (constant) gap from the optimal piercing density for the respective family. Finally, we show that the best lattice can be sometimes worse by $20\%$ than the optimal piercing set.

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

↑