最大的小多边形 · n = 18
取 n 个点,两两距离都不超过 1,使它们围成的凸多边形面积尽可能大;每个点都必须是凸包的顶点。
严格定义
- 容器没有容器:唯一的全局约束是任意两点距离不超过 1;坐标写在 [0, 1.5] × [0, 1.5] 内
- 提交恰好 n 个点 points
- 约束两两距离 ≤ 1;每个点都是凸包的真顶点,落在别人连线上或内部都不算
- 目标让凸多边形面积尽可能大。内部以二倍面积精确比较
取 n 个点,两两距离都不超过 1,使它们围成的凸多边形面积尽可能大;每个点都必须是凸包的顶点。
奇数 n 的正多边形已被证明最优,没什么可争;偶数 n 时正多边形反而不是最优:Graham 的六边形比正六边形多出约 4% 的面积。所以本站只开偶数 n。
奇数 n 的正多边形由 Reinhardt (1922) 证明最优,所以只开偶数。偶数侧 n = 6, 8, 10, 12 已证明(Graham 1975 起,至 Audet 等),n ≥ 14 只有数值最好值,开放。
面积
这道题没有容器,唯一的约束是任意两点距离不超过 1。坐标写在 [0, 1.5] × [0, 1.5] 的框里,这只是一个坐标系而不是额外的限制:直径不超过 1 的点集总能装进 1×1 的方格,这里四边各多留了四分之一个单位,所以放在哪里都不会被框卡住。坐标是小数,例如 "0.25",最多九位小数。
提交 points。每个坐标写成十进制字符串,例如 "0.25",最多九位小数。
{
"points": [
[
"1.248869729",
"0.762482707"
],
[
"1.212610575",
"0.938766975"
],
[
"1.116564859",
"1.090884297"
],
[
"0.973173238",
"1.1992868"
],
[
"0.801668184",
"1.249945693"
],
[
"0.62966978",
"1.237611496"
],
[
"0.522144001",
"1.190321074"
],
[
"0.420905457",
"1.130748128"
],
[
"0.310323257",
"0.998433491"
],
[
"0.25113027",
"0.829683666"
],
[
"0.255218981",
"0.649974081"
],
[
"0.322455303",
"0.483109657"
],
[
"0.444256515",
"0.35061307"
],
[
"0.605276402",
"0.269420187"
],
[
"0.786930062",
"0.250054306"
],
[
"0.977801313",
"0.300165799"
],
[
"1.130064838",
"0.425699923"
],
[
"1.220577505",
"0.584383731"
]
]
}{
"n": 18
}{
"points": [
[
"1.248869729",
"0.762482707"
],
[
"1.212610575",
"0.938766975"
],
[
"1.116564859",
"1.090884297"
],
[
"0.973173238",
"1.1992868"
],
[
"0.801668184",
"1.249945693"
],
[
"0.62966978",
"1.237611496"
],
[
"0.522144001",
"1.190321074"
],
[
"0.420905457",
"1.130748128"
],
[
"0.310323257",
"0.998433491"
],
[
"0.25113027",
"0.829683666"
],
[
"0.255218981",
"0.649974081"
],
[
"0.322455303",
"0.483109657"
],
[
"0.444256515",
"0.35061307"
],
[
"0.605276402",
"0.269420187"
],
[
"0.786930062",
"0.250054306"
],
[
"0.977801313",
"0.300165799"
],
[
"1.130064838",
"0.425699923"
],
[
"1.220577505",
"0.584383731"
]
]
}提交 points。每个坐标写成十进制字符串,例如 "0.25",最多九位小数。 · 验证器 v1.0.0