P66 · 装箱与覆盖 · 经典问题 · 难

最小面积三角形内的单位圆装箱 · n = 37

文献中也称circles in arbitrary trianglesunit circles in a minimum-area trianglecircle packing in a triangle of variable shape

在任意三角形中放置 n 个半径为 1、内部互不重叠的圆;三角形的三个顶点也是答案的一部分。让这个三角形的面积尽可能小。

子题n = 37
目标最小化 三角形面积

严格定义

  • 容器容器是形状不预先固定的非退化三角形;三个顶点和所有圆心都位于 0 到 200 的坐标框内
  • 提交三个按逆时针顺序排列的三角形顶点,以及恰好 n 个圆心
  • 每个圆的半径固定为 1;圆的内部两两不相交,相切允许
  • 容纳每个圆都完整落在三角形内,可以与边相切
  • 目标让三角形面积尽可能小
挑战这个纪录
已验证构造37 个半径为 1 的圆

帮助理解

容器也是变量

普通装箱只移动圆;这里连三条边的方向都能改变。一条边转动一点,可能同时释放多个接触,也可能让整套构形失稳。

难点是接触结构

候选最优解通常由圆—圆、圆—边相切关系卡死。真正的搜索不是把圆平均铺开,而是在大量可能的接触图之间找到对的那一张。

从非平凡实例开始

Friedman 的公开表给出了 n≤50 的当前最好已知构形。n=1、2 已证明,n=3 仍是简单的等边三角形排布,因此本站从 n=4 开放;匹配公开构形只是到达前沿,打破它们才是新纪录。

查看来源
最小面积三角形内的单位圆装箱 n = 37 的当前纪录构型,144.936031294801118248
当前第一名

144.936031294801118248

三角形面积

已追平已知最好
答案来源Tej Stead
解题方式公开参考构造
挑战这个纪录
ANSWER FORMAT

答案怎么写

坐标单位就是圆的半径:每个圆半径固定为 1。三个顶点和所有圆心都写在 0≤x,y≤200 的坐标框内,顶点必须逆时针排列。

提交按逆时针排列的三个顶点 triangle,以及恰好 n 个圆心 centers。圆的半径固定为 1;所有数写成最多九位小数的字符串。

当前第一名的答案

{
  "centers": [
    [
      "7.732050879",
      "11.392304950"
    ],
    [
      "9.243187909",
      "10.082165664"
    ],
    [
      "6.732050870",
      "9.660254127"
    ],
    [
      "9.720801470",
      "8.140031436"
    ],
    [
      "5.732050860",
      "7.928203303"
    ],
    [
      "7.732050879",
      "7.928203303"
    ],
    [
      "11.711030198",
      "7.942573374"
    ],
    [
      "13.222167228",
      "6.632434088"
    ],
    [
      "4.732050851",
      "6.196152480"
    ],
    [
      "6.732050870",
      "6.196152480"
    ],
    [
      "8.732206275",
      "6.196242202"
    ],
    [
      "10.734135466",
      "6.197386635"
    ],
    [
      "13.718672660",
      "4.695043464"
    ],
    [
      "5.732050860",
      "4.464101656"
    ],
    [
      "3.732050842",
      "4.464101656"
    ],
    [
      "7.732050879",
      "4.464101656"
    ],
    [
      "9.732050897",
      "4.464101675"
    ],
    [
      "11.732050916",
      "4.464101656"
    ],
    [
      "15.706883948",
      "4.478211851"
    ],
    [
      "17.218020978",
      "3.168072565"
    ],
    [
      "2.732050833",
      "2.732050833"
    ],
    [
      "4.732050851",
      "2.732050833"
    ],
    [
      "6.732050870",
      "2.732050833"
    ],
    [
      "8.732050888",
      "2.732050833"
    ],
    [
      "10.732050906",
      "2.732050833"
    ],
    [
      "12.739156308",
      "2.736133964"
    ],
    [
      "14.739284436",
      "2.727854386"
    ],
    [
      "17.732615415",
      "1.235407917"
    ],
    [
      "1.732050824",
      "1.000000009"
    ],
    [
      "3.732050842",
      "1.000000009"
    ],
    [
      "5.732050860",
      "1.000000009"
    ],
    [
      "7.732050879",
      "1.000000009"
    ],
    [
      "9.732050897",
      "1.000000009"
    ],
    [
      "11.732050916",
      "1.000000009"
    ],
    [
      "13.732050934",
      "1.000000009"
    ],
    [
      "15.746517938",
      "1.000000009"
    ],
    [
      "19.718712893",
      "1.000000009"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "22.398685256",
      "0.000000000"
    ],
    [
      "7.471765037",
      "12.941476666"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看

子题参数

{
  "n": 37
}

当前第一名的答案

{
  "centers": [
    [
      "7.732050879",
      "11.392304950"
    ],
    [
      "9.243187909",
      "10.082165664"
    ],
    [
      "6.732050870",
      "9.660254127"
    ],
    [
      "9.720801470",
      "8.140031436"
    ],
    [
      "5.732050860",
      "7.928203303"
    ],
    [
      "7.732050879",
      "7.928203303"
    ],
    [
      "11.711030198",
      "7.942573374"
    ],
    [
      "13.222167228",
      "6.632434088"
    ],
    [
      "4.732050851",
      "6.196152480"
    ],
    [
      "6.732050870",
      "6.196152480"
    ],
    [
      "8.732206275",
      "6.196242202"
    ],
    [
      "10.734135466",
      "6.197386635"
    ],
    [
      "13.718672660",
      "4.695043464"
    ],
    [
      "5.732050860",
      "4.464101656"
    ],
    [
      "3.732050842",
      "4.464101656"
    ],
    [
      "7.732050879",
      "4.464101656"
    ],
    [
      "9.732050897",
      "4.464101675"
    ],
    [
      "11.732050916",
      "4.464101656"
    ],
    [
      "15.706883948",
      "4.478211851"
    ],
    [
      "17.218020978",
      "3.168072565"
    ],
    [
      "2.732050833",
      "2.732050833"
    ],
    [
      "4.732050851",
      "2.732050833"
    ],
    [
      "6.732050870",
      "2.732050833"
    ],
    [
      "8.732050888",
      "2.732050833"
    ],
    [
      "10.732050906",
      "2.732050833"
    ],
    [
      "12.739156308",
      "2.736133964"
    ],
    [
      "14.739284436",
      "2.727854386"
    ],
    [
      "17.732615415",
      "1.235407917"
    ],
    [
      "1.732050824",
      "1.000000009"
    ],
    [
      "3.732050842",
      "1.000000009"
    ],
    [
      "5.732050860",
      "1.000000009"
    ],
    [
      "7.732050879",
      "1.000000009"
    ],
    [
      "9.732050897",
      "1.000000009"
    ],
    [
      "11.732050916",
      "1.000000009"
    ],
    [
      "13.732050934",
      "1.000000009"
    ],
    [
      "15.746517938",
      "1.000000009"
    ],
    [
      "19.718712893",
      "1.000000009"
    ]
  ],
  "triangle": [
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "22.398685256",
      "0.000000000"
    ],
    [
      "7.471765037",
      "12.941476666"
    ]
  ]
}

提交按逆时针排列的三个顶点 triangle,以及恰好 n 个圆心 centers。圆的半径固定为 1;所有数写成最多九位小数的字符串。 · 验证器 v1.0.0

DISCUSSION

讨论区

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

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