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

穿透轴平行矩形集的所有平移

Piercing All Translates of a Set of Axis-Parallel Rectangles

Adrian Dumitrescu, Josef Tkadlec

摘要:

对于平面中的给定形状$S$,人们可以问穿透(“相交”,“命中”)$S$的所有平移的点集$P$的最低可能密度是多少。这相当于确定$S$的覆盖密度,因此已得到充分研究。在这里,我们研究的形状家庭的连接覆盖不再存在类似的问题。也就是说,我们要求一个单一的点集$P$同时穿透来自某个族$\mathcal F$的每个形状的每个平移。我们用$π_T(\mathcal F)$来表示这种$\mathcal F$穿透点集的最低可能密度。具体来说,我们专注于家庭$\mathcal F$组成的轴平行的矩形。当$|\mathcal F|=2$时,我们精确地解决了一个矩形比$2\times 1$更方形的情况,并为一个矩形宽而另一个矩形高的剩余情况给出边界(在彼此的$10\,\%$内)。当$|\mathcal F|\ge 2$时,我们提出了一个线性时间常数因子近似算法来计算$π_T(\mathcal F)$(与比率$1.895$)。

英文摘要:

For a given shape $S$ in the plane, one can ask what is the lowest possible density of a point set $P$ that pierces ("intersects", "hits") all translates of $S$. This is equivalent to determining the covering density of $S$ and as such is well studied. Here we study the analogous question for families of shapes where the connection to covering no longer exists. That is, we require that a single point set $P$ simultaneously pierces each translate of each shape from some family $\mathcal F$. We denote the lowest possible density of such an $\mathcal F$-piercing point set by $π_T(\mathcal F)$. Specifically, we focus on families $\mathcal F$ consisting of axis-parallel rectangles. When $|\mathcal F|=2$ we exactly solve the case when one rectangle is more squarish than $2\times 1$, and give bounds (within $10\,\%$ of each other) for the remaining case when one rectangle is wide and the other one is tall. When $|\mathcal F|\ge 2$ we present a linear-time constant-factor approximation algorithm for computing $π_T(\mathcal F)$ (with ratio $1.895$).

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

↑