上一节讲的三叶结,举一反三,由三可到无穷,这一节讲N叶结 再次看下三叶结的公式: x = sin(t) + 2*sin(2*t)y = cos(t) - 2*cos(2*t) 将其改为: x = sin(t) + 2*sin((n-1)*t)y = cos(t) - 2*cos((n-1)*t) 就变成了N叶结了,如此简单. N叶结: vertices = t = to (*PI) n = rand_int2(, ) x = sin(t) + *sin(n*t - t) y = cos(t) -…