最大宽度空正方形和矩形环
Maximum-Width Empty Square and Rectangular Annulus
摘要:
非正式地说,环带是一个环形区域,通常用两个同心圆来描述。最大宽度空环带问题要求找到一个具有最大可能宽度的特定形状的环带,该环带避开平面中给定的一组$n$点。这个问题也可以被解释为在输入点中找到环形讨厌设施的最佳位置的问题。在本文中,我们研究了最大宽度空环问题的正方形和矩形变体,并提出了第一个非平凡算法。具体来说,我们的算法运行在$O(n^3)$和$O(n^2 \log n)$时间计算一个最大宽度空轴平行的正方形和矩形环,分别。这两种算法都只使用$O(n)$空间。
英文摘要:
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$ points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular variants of the maximum-width empty anuulus problem, and present first nontrivial algorithms. Specifically, our algorithms run in $O(n^3)$ and $O(n^2 \log n)$ time for computing a maximum-width empty axis-parallel square and rectangular annulus, respectively. Both algorithms use only $O(n)$ space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。