P74 · 极值构型 · 经典问题 · 应用前沿 · 难

用 n 个等圆覆盖正三角形 · n = 34

把 n 个圆心放在单位正三角形中。每个圆心拥有相同覆盖半径；要求三角形内任何位置都至少落入一个圆盘，并让所需半径尽可能小。

子题n = 34

目标最小化覆盖半径

已知最好（未证明）0.0763874538343494465Kari J. Nurmela 的构型收录于 Nurmela（2000）Figure 4；论文连续值为 0.0763874538343494465。其最优性尚未证明；本站从论文接触图复原的九位坐标证书可验证到 0.076387454401372。

已证明下界√(A(K)/(π·34))任何布局都不低于 0.063670157357540 · 当前纪录高出下界 20.0%这里 K 是验证器使用的固定精度正三角形，A(K) 是它的面积。面积下界：n 个半径 r 的圆盘总面积至少覆盖 A(K)，所以 r ≥ √(A(K)/(πn))。页面数值按 A(K) 的精确有理值向下取整

严格定义

容器顶点为 (0,0)、(1,0)、(0.5,0.866025404) 的闭凸多边形；这是本站九位坐标格式下对正三角形的唯一明确定义
提交恰好 n 个互不重合、且位于容器内的点
分数对容器中每个位置取最近圆心距离，再取其中最大值；验证器用有理 Voronoi 多边形精确计算 $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
目标让覆盖半径尽可能小 $\min_{P} r (P)$

放大来摆，然后提交 ↗

已验证构造34 个等圆盘，共同半径 0.076387；标出的那一点是最难够到的位置，半径由它决定

帮助理解

角落和内部在争夺圆心

三个尖角必须被照顾，但把圆心都推向边界又会在中央留下空洞。最优构型通常不是简单的等距三角网格。

论文纪录与可验证构型已经接入

Nurmela（2000）汇总并扩展了 n=2–36 的高精度构型。本站已从论文 Figures 2–4 的接触图复原 n=7–36：页面同时显示论文连续值与九位坐标证书实际值。n=9、10 已证明最优，其余 n≤36 是可被挑战的 known best。论文明确没有搜索 n>36，因此 n=37–40 只提供从 n=36 逐个填补最远空洞的本站起点，不虚构外部纪录。

查看来源

当前第一名

0.076387454401372

覆盖半径

答案来源Kari J. Nurmela

解题方式公开参考构造

挑战这个纪录 ↗

ANSWER FORMAT

答案怎么写

底边从 (0,0) 到 (1,0)，顶点在 (0.5, 0.866025404)。这是正三角形在九位坐标格上的明确代表，也是验证器实际使用的边界。

提交 points：恰好 n 个圆心，每个坐标是最多九位小数的字符串。共同半径由验证器计算，越小越好。

当前第一名的答案

{
  "points": [
    [
      "0.068254853",
      "0.034297496"
    ],
    [
      "0.138870964",
      "0.124835549"
    ],
    [
      "0.186025197",
      "0.221588995"
    ],
    [
      "0.209569923",
      "0.022299049"
    ],
    [
      "0.239304014",
      "0.331115697"
    ],
    [
      "0.28294947",
      "0.123305568"
    ],
    [
      "0.296818825",
      "0.452551081"
    ],
    [
      "0.319046527",
      "0.215918857"
    ],
    [
      "0.354939029",
      "0.024626568"
    ],
    [
      "0.361628164",
      "0.341244619"
    ],
    [
      "0.374145127",
      "0.561208825"
    ],
    [
      "0.428106488",
      "0.12624725"
    ],
    [
      "0.433749094",
      "0.450292101"
    ],
    [
      "0.4341018",
      "0.675581397"
    ],
    [
      "0.497134849",
      "0.336350403"
    ],
    [
      "0.499344717",
      "0.025240731"
    ],
    [
      "0.500601667",
      "0.78964032"
    ],
    [
      "0.506230398",
      "0.560909374"
    ],
    [
      "0.540268277",
      "0.214491795"
    ],
    [
      "0.566404647",
      "0.67453928"
    ],
    [
      "0.573353015",
      "0.124317464"
    ],
    [
      "0.568461497",
      "0.447023287"
    ],
    [
      "0.623064492",
      "0.327492861"
    ],
    [
      "0.63895204",
      "0.560265411"
    ],
    [
      "0.644379156",
      "0.022696782"
    ],
    [
      "0.674145135",
      "0.2179712"
    ],
    [
      "0.698060608",
      "0.440386848"
    ],
    [
      "0.718447679",
      "0.121579064"
    ],
    [
      "0.757819088",
      "0.329426381"
    ],
    [
      "0.79031466",
      "0.022502331"
    ],
    [
      "0.810851021",
      "0.223980728"
    ],
    [
      "0.861973292",
      "0.128077848"
    ],
    [
      "0.931656262",
      "0.034120032"
    ],
    [
      "0.427804446",
      "0.247923357"
    ]
  ]
}

提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋

子题参数

{
  "n": 34
}

当前第一名的答案

{
  "points": [
    [
      "0.068254853",
      "0.034297496"
    ],
    [
      "0.138870964",
      "0.124835549"
    ],
    [
      "0.186025197",
      "0.221588995"
    ],
    [
      "0.209569923",
      "0.022299049"
    ],
    [
      "0.239304014",
      "0.331115697"
    ],
    [
      "0.28294947",
      "0.123305568"
    ],
    [
      "0.296818825",
      "0.452551081"
    ],
    [
      "0.319046527",
      "0.215918857"
    ],
    [
      "0.354939029",
      "0.024626568"
    ],
    [
      "0.361628164",
      "0.341244619"
    ],
    [
      "0.374145127",
      "0.561208825"
    ],
    [
      "0.428106488",
      "0.12624725"
    ],
    [
      "0.433749094",
      "0.450292101"
    ],
    [
      "0.4341018",
      "0.675581397"
    ],
    [
      "0.497134849",
      "0.336350403"
    ],
    [
      "0.499344717",
      "0.025240731"
    ],
    [
      "0.500601667",
      "0.78964032"
    ],
    [
      "0.506230398",
      "0.560909374"
    ],
    [
      "0.540268277",
      "0.214491795"
    ],
    [
      "0.566404647",
      "0.67453928"
    ],
    [
      "0.573353015",
      "0.124317464"
    ],
    [
      "0.568461497",
      "0.447023287"
    ],
    [
      "0.623064492",
      "0.327492861"
    ],
    [
      "0.63895204",
      "0.560265411"
    ],
    [
      "0.644379156",
      "0.022696782"
    ],
    [
      "0.674145135",
      "0.2179712"
    ],
    [
      "0.698060608",
      "0.440386848"
    ],
    [
      "0.718447679",
      "0.121579064"
    ],
    [
      "0.757819088",
      "0.329426381"
    ],
    [
      "0.79031466",
      "0.022502331"
    ],
    [
      "0.810851021",
      "0.223980728"
    ],
    [
      "0.861973292",
      "0.128077848"
    ],
    [
      "0.931656262",
      "0.034120032"
    ],
    [
      "0.427804446",
      "0.247923357"
    ]
  ]
}

提交 points：恰好 n 个圆心，每个坐标是最多九位小数的字符串。共同半径由验证器计算，越小越好。 · 验证器 v1.0.0

DISCUSSION

讨论区

聊思路、贴方法、问为什么卡住。发帖即公开署名，与纪录同一个名字；署名后的 #编号是账号的注册序号，冒不了名。发言资格与实绩绑定：破过一次纪录，就永久拥有发言权。新发言经自动审核后公开。

还没有帖子。第一个聊聊这道题的思路？