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

球面码:最大化最小角距 · n = 25

文献中也称spherical codeTammes problembest-packing points on a spheremaximin angular separation

在二维单位球面 S² 上选择 n 个点,使任意两点球心夹角的最小值最大。由于 arccos 单调递减,验证器等价地最小化任意两点内积的最大值。

严格定义

  • 容器三维欧氏空间中的单位球面 S²
  • 提交恰好 n 个 [-20,20]² 内的立体投影坐标 [u,v]
  • 映射[u,v] 精确映射为 (2u,2v,1-u²-v²)/(1+u²+v²)
  • 目标最大化最小角距;等价地最小化最大的两两内积。以有理数交叉相乘精确比较,分数为 ceil(max dot · 10¹⁸)
挑战这个纪录
已验证构造球面点的正投影视图

帮助理解

真实用途

天线波束、卫星姿态采样、球面数值积分和分子自组装都需要一组尽量彼此分离的方向。每增加一个点,原有对称结构往往整体重排。

为什么不是均匀经纬网

球面没有边界,却也不能被完全相同的小区域平铺;五边形、六边形缺陷和不同局部接触图互相竞争。所谓“平均分布”只是目标,具体怎样平均正是难题。

只留下开放区间

spherical-codes.org 将 n≤14 以及 n=24 标为已证明最优,本站不把它们作为竞技题;这里只开放表中尚未证明的 n=15…23 与 25…32,并逐行附上完整构型。

查看来源
球面码:最大化最小角距 n = 25 的当前纪录构型,0.747398629631187568
当前第一名

0.747398629631187568

最大内积

已追平已知最好
答案来源Henry Cohn's spherical-code archive
解题方式公开参考构造
挑战这个纪录
ANSWER FORMAT

答案怎么写

[u,v] 通过 (2u, 2v, 1-u²-v²)/(1+u²+v²) 表示球面上的点;这不是近似归一化,而是精确的有理参数化。

提交 points:恰好 n 个立体投影坐标 [u,v],每项是 [-20,20] 内、最多九位小数的字符串。验证器将其精确映射到单位球面。

当前第一名的答案

{
  "points": [
    [
      "-0.502791497",
      "-0.603355184"
    ],
    [
      "-0.475585273",
      "4.903834353"
    ],
    [
      "0.531102381",
      "0.088799781"
    ],
    [
      "-3.270246133",
      "-3.820735646"
    ],
    [
      "0.309641841",
      "-1.246633904"
    ],
    [
      "1.141924245",
      "0.173483804"
    ],
    [
      "0.025394664",
      "0.90294306"
    ],
    [
      "1.769087076",
      "-2.099860777"
    ],
    [
      "2.583569098",
      "0.774217173"
    ],
    [
      "-0.192547023",
      "-0.24577688"
    ],
    [
      "-2.234777053",
      "0.705330951"
    ],
    [
      "-0.776524574",
      "-1.417401672"
    ],
    [
      "0.58374198",
      "0.615472066"
    ],
    [
      "0.029719045",
      "-0.624432406"
    ],
    [
      "1.004120669",
      "-0.665272269"
    ],
    [
      "-0.157690691",
      "0.132756235"
    ],
    [
      "-0.967238735",
      "0.385597058"
    ],
    [
      "0.437514201",
      "-0.366419119"
    ],
    [
      "-1.210447701",
      "-0.410771424"
    ],
    [
      "-0.595934388",
      "-0.084219129"
    ],
    [
      "0.152150332",
      "-0.065429395"
    ],
    [
      "-0.373323895",
      "0.502593072"
    ],
    [
      "-0.684205493",
      "1.485381788"
    ],
    [
      "0.712173924",
      "1.560757977"
    ],
    [
      "0.174921464",
      "0.331613601"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看

子题参数

{
  "n": 25
}

当前第一名的答案

{
  "points": [
    [
      "-0.502791497",
      "-0.603355184"
    ],
    [
      "-0.475585273",
      "4.903834353"
    ],
    [
      "0.531102381",
      "0.088799781"
    ],
    [
      "-3.270246133",
      "-3.820735646"
    ],
    [
      "0.309641841",
      "-1.246633904"
    ],
    [
      "1.141924245",
      "0.173483804"
    ],
    [
      "0.025394664",
      "0.90294306"
    ],
    [
      "1.769087076",
      "-2.099860777"
    ],
    [
      "2.583569098",
      "0.774217173"
    ],
    [
      "-0.192547023",
      "-0.24577688"
    ],
    [
      "-2.234777053",
      "0.705330951"
    ],
    [
      "-0.776524574",
      "-1.417401672"
    ],
    [
      "0.58374198",
      "0.615472066"
    ],
    [
      "0.029719045",
      "-0.624432406"
    ],
    [
      "1.004120669",
      "-0.665272269"
    ],
    [
      "-0.157690691",
      "0.132756235"
    ],
    [
      "-0.967238735",
      "0.385597058"
    ],
    [
      "0.437514201",
      "-0.366419119"
    ],
    [
      "-1.210447701",
      "-0.410771424"
    ],
    [
      "-0.595934388",
      "-0.084219129"
    ],
    [
      "0.152150332",
      "-0.065429395"
    ],
    [
      "-0.373323895",
      "0.502593072"
    ],
    [
      "-0.684205493",
      "1.485381788"
    ],
    [
      "0.712173924",
      "1.560757977"
    ],
    [
      "0.174921464",
      "0.331613601"
    ]
  ]
}

提交 points:恰好 n 个立体投影坐标 [u,v],每项是 [-20,20] 内、最多九位小数的字符串。验证器将其精确映射到单位球面。 · 验证器 v1.0.0

DISCUSSION

讨论区

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

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