https://www.geogebra.org/haftendorn
Haftendorn, Buch (Springer):
Kurven erkunden und verstehen
Kap 4.4.14, Aufgabe 4.5: S. 112

Ha 2016

e = 3
a: (x^(2) + y^(2))^(2) = ((2 * e^(2)) * (x^(2) - y^(2)))
O = (0, 0)
c = Circle(O, e)
D_3, D_2, D_4, D_1 = Intersect(a, c)
M_4: ((sqrt(3) / 2 * e), e / 2 - (2 / 3 * e))
d = Circle(M_4, D_1)
d' = Mirror(d, xAxis)
d'_1 = Mirror(d, yAxis)
f = Mirror(d'_1, xAxis)
L, B, R = Intersect(a, xAxis)
K_2, K_1 = Intersect(d', xAxis)
K_4, K_3 = Intersect(f, xAxis)
k = CircleArc(M_4, K_1, K_2)
M_1 = Mirror(M_4, xAxis)
M_3 = Mirror(M_1, O)
M_2 = Mirror(M_4, O)
p = CircleArc(M_1, K_2, K_1)
q = CircleArc(M_3, K_3, K_4)
r = CircleArc(M_2, K_4, K_3)
b = Segment(D_2, D_3)
i = Segment(D_1, D_4)
N: (((2 * sqrt(2) / 3) * e), 0)
N' = Mirror(N, O)
s = Circle(N, R)
t = Circle(N', L)
f_1(x) = x
g_1(x) = (-x)
j = Segment(O, D_1)
l = Segment(O, D_4)
m = Segment(D_2, O)
n = Segment(O, D_3)
h_1(x) = x / sqrt(3)
c_1: (x - ((2 * sqrt(2) / 3) * e))^(2) + y^(2) = (2 / 9 * e^(2))
C_2, C_4 = Intersect(g_1, c)
C_3, C_1 = Intersect(f_1, c)
a_1 = Segment(C_2, C_3)
b_1 = Segment(C_1, C_4)
C: (e / sqrt(2), 0)
C' = Mirror(C, O)
B_1 = Intersect(h_1, b_1)
d_1 = OrthogonalLine(B_1, j)
u = Vector(B_1, N)
B_2 = Mirror(B_1, yAxis)
B_4 = Mirror(B_2, O)
B_3 = Mirror(B_1, O)
W: (0, e)
W' = Mirror(W, xAxis)
Vieleck1, d_3, o, d_2 = Polygon(O, D_2, D_3)
Vieleck2, d_4, o_1, d_5 = Polygon(O, D_1, D_4)
Vieleck3, w, o_2, d_6 = Polygon(O, D_1, W)
Vieleck4, o_3, w_1, d_7 = Polygon(W, D_2, O)
Vieleck5, w', o_4, d_8 = Polygon(O, D_3, W')
Vieleck6, w'_1, o_5, d_9 = Polygon(O, D_4, W')
E: (e, 0)
E': ((-e), 0)
Vieleck7, l_1, c_2, o_6, c_3 = Polygon(L, C_2, O, C_3)
Vieleck8, g, h, e_1, i_1 = Polygon(O, C_1, R, C_4)
N_1: (x(N) / 2, 0)
N_2 = Mirror(N_1, yAxis)
N_3: O
j_1 = Segment(B_1, N)
k_1 = Segment(B_2, N')
m_1 = Segment(N', B_3)
n_1 = Segment(N, B_4)
v = false