A = (-0.86, 3.38)
a_2 = Line(A, yAxis)
B = Point(a_2)
b_2 = Segment(A, B)
φ = 1.618033988749895
C: (x(B) + φ * b_2, y(B))
c = Segment(B, C)
d = OrthogonalLine(A, a_2)
e = OrthogonalLine(C, c)
D = Intersect(d, e)
E: (x(B) + b_2, y(B))
f = OrthogonalLine(E, c)
F = Intersect(d, f)
g = Segment(A, C)
h = Segment(D, E)
G = Intersect(g, h)
H = Intersect(g, f)
i = OrthogonalLine(H, f)
I = Intersect(i, h)
j = OrthogonalLine(I, i)
J = Intersect(g, j)
k_2 = OrthogonalLine(J, j)
K = Intersect(k_2, h)
l = OrthogonalLine(K, k_2)
L = Intersect(l, g)
Vieleck1, a_1, b_1, e_1, f_1 = Polygon(A, B, E, F)
M = Intersect(e, i)
N = Intersect(j, c)
O = Intersect(k_2, f)
P = Intersect(i, l)
Vieleck2, f_2, d_1, m, h_1 = Polygon(F, D, M, H)
Vieleck3, m_1, c_1, n, i_1 = Polygon(M, C, N, I)
Vieleck4, j_1, n_1, e_2, o = Polygon(J, N, E, O)
Vieleck5, p, k_1, o_1, h_2 = Polygon(P, K, O, H)
s = 0.428 (slider from -5 to 5, step 0.01)
min = -20 (slider from -20 to 5, step 0.1)
max = 3.4 (slider from -5 to 20, step 0.1)
q = CurveCartesian(x(G) + b_2 * s * φ^(2.0 * α / 3.141592653589793) * cos(α), y(G) + b_2 * s * φ^(2.0 * α / 3.141592653589793) * sin(α), α, min, max)
Q = Point(q)
k = OsculatingCircle(Q, q)
R = Center(k)
u = Vector(R, Q)
Ortslinie1 = Locus(R, Q)
r = CircleArc(E, F, B)
t = Segment(G, F)
g_1 = Segment(G, B)
T = Intersect(r, g)
l_1 = Segment(T, G)
Test: l_1^(2.0) - g_1 * t
p_1 = OrthogonalLine(G, c)
V = Intersect(p_1, c)
a = Segment(G, V)
q_1 = OrthogonalLine(G, m_1)
S = Intersect(q_1, m_1)
b = Segment(G, S)