【24h】

Candle in the woods

机译:在树林里的蜡烛

获取原文

摘要

We consider the problem of determining the minimum number Nd of unit disks that is required to block all rays emanating from a point P in the two-dimensional space, where each disk has at least a distance d to point P and to any other disk. We study the asymptotic behavior of Nd, as d tends to infinity. By deriving upper bounds and lower bounds, we prove that pi2/16 = lim_{d - infinity} N_d/d2 = 18/pi2, where the upper bound is based on establishing an interesting link between unit disks positioned on a regular triangular grid and Farey sequences from number theory. By positioning point P as well as the centers of the disks on the grid points of such a triangular grid, we create hexagonal rings of disks around P. We prove that we need exactly d-1 of these hexagons to block all rays emanating from P.
机译:我们考虑确定确定阻止从二维空间中的点P发出的所有光线所需的单位磁盘的最小数量Nd的问题,在二维空间中,每个磁盘到点P以及与任何其他磁盘的距离至少为d。我们研究d趋于无穷大时Nd的渐近行为。通过推导上限和下限,我们证明pi2 / 16 <= lim_ {d-> infinity} N_d / d2 <= 18 / pi2,其中上限基于在规则磁盘上的单位磁盘之间建立有趣的链接数论的三角形网格和Farey序列。通过将点P以及圆盘的中心定位在这样的三角形网格的网格点上,我们在P周围创建了圆盘的六边形环。我们证明我们需要这些六边形的d-1来阻挡从P发出的所有光线。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号