Fibonacci spiraal

Iga järgmise ruudu külg on eelmiste kahe ruutude küljete summa.

A = Intersect(xAxis, yAxis)
B = Point(xAxis)
hulknurk1, f, g, h, i, C, D = Polygon(A, B, 4)
hulknurk2, j, k, l, m, E, F = Polygon(D, C, 4)
hulknurk3, n_2, p, q, r, G, H = Polygon(E, B, 4)
hulknurk4, s, t, a, b, I, J = Polygon(F, H, 4)
hulknurk5, c, d, e, f_1, K, L = Polygon(A, J, 4)
hulknurk6, g_1, h_1, i_1, j_1, M, N = Polygon(G, L, 4)
hulknurk7, k_1, l_1, m_1, n_1, O, P = Polygon(I, N, 4)
hulknurk8, p_1, q_1, r_1, s_1, Q, R = Polygon(K, P, 4)
hulknurk9, t_1, a_1, b_1, c_1, S, T = Polygon(M, R, 4)
d_1 = CircleArc(C, E, D)
c_2 = CircleArc(E, B, H)
d_2 = CircleArc(F, H, J)
e_2 = CircleArc(A, J, L)
f_2 = CircleArc(G, L, N)
g_2 = CircleArc(I, N, P)
h_2 = CircleArc(K, P, R)
k_2 = CircleArc(M, R, T)
n = 9 (slider from 1 to 10, step 1)
If(n < 1, d_1 = true)
If(n > 0, d_1 = true)
If(n > 1, d_1 = true)
e_1 = CircleArc(C, D, B)
U = (-60.2747235340798, -32.09400226142683)
V = (61.3198587305982, -35.19129125288281)