var total = 6; // 可以改为任意数字测试
var R = 200, r = 190, points = [], path = 'M';
var a = 360 / total;
// 生成所有顶点
Array.from({length: total}).forEach((_, k) => {
var x = (R + r * Math.cos(Math.PI/180 * a * k)).toFixed(2),
y = (R + r * Math.sin(Math.PI/180 * a * k)).toFixed(2);
points.push([x, y]);
});
// 新的连接逻辑
for (var i = 0; i < total; i++) {
var j = (i + Math.floor(total / 2)) % total;
path += `${points[ i ][0]} ${points[ i ][1]} L ${points[j][0]} ${points[j][1]} `;
}
path += 'Z';