圆盘内的最小三角形 · n = 14
在半径 1 的圆内放置 n 个点,使任意三点构成的三角形中最小的那个面积尽可能大。
严格定义
- 容器容器是半径 1 的圆,圆心在 (1, 1),所以坐标范围是 0 到 2。
- 提交恰好 n 个点,任意三点不共线
- 约束每个点都在容器内或边界上
- 目标让任意三点构成的三角形中最小的面积尽可能大。内部以二倍面积精确比较
在半径 1 的圆内放置 n 个点,使任意三点构成的三角形中最小的那个面积尽可能大。
把点撒得均匀并不够:任何三点都不能接近共线,而近共线恰恰是看起来整齐的排布最容易犯的错。最优构形往往不对称,连形状都难猜。
最小三角形的面积
容器是半径 1 的圆,圆心在 (1, 1),所以坐标范围是 0 到 2。坐标直接写成小数,例如 "0.5",最多九位小数。
提交 points。每个坐标写成十进制字符串,例如 "0.5"。
{
"points": [
[
"1.8",
"1"
],
[
"1.720775094",
"1.347106991"
],
[
"1.498791841",
"1.625465186"
],
[
"1.178016747",
"1.77994233"
],
[
"0.821983253",
"1.77994233"
],
[
"0.501208159",
"1.625465186"
],
[
"0.279224906",
"1.347106991"
],
[
"0.2",
"1"
],
[
"0.279224906",
"0.652893009"
],
[
"0.501208159",
"0.374534814"
],
[
"0.821983253",
"0.22005767"
],
[
"1.178016747",
"0.22005767"
],
[
"1.498791841",
"0.374534814"
],
[
"1.720775094",
"0.652893009"
]
]
}{
"n": 14
}{
"points": [
[
"1.8",
"1"
],
[
"1.720775094",
"1.347106991"
],
[
"1.498791841",
"1.625465186"
],
[
"1.178016747",
"1.77994233"
],
[
"0.821983253",
"1.77994233"
],
[
"0.501208159",
"1.625465186"
],
[
"0.279224906",
"1.347106991"
],
[
"0.2",
"1"
],
[
"0.279224906",
"0.652893009"
],
[
"0.501208159",
"0.374534814"
],
[
"0.821983253",
"0.22005767"
],
[
"1.178016747",
"0.22005767"
],
[
"1.498791841",
"0.374534814"
],
[
"1.720775094",
"0.652893009"
]
]
}提交 points。每个坐标写成十进制字符串,例如 "0.5"。 · 验证器 v1.0.0