https://www.geogebra.org/haftendorn
Haftendorn, Buch (Springer):
Kurven erkunden und verstehen
Kap 4.4.4.1: S. 122

Ha 2016

B = Point(yAxis)
C = Point(xAxis)
a = OrthogonalLine(C, xAxis)
Q = Point(a)
b = OrthogonalLine(Q, a)
E = Point(b)
C' = Mirror(C, yAxis)
c = Segment(Q, C')
d = LineBisector(c)
P = Intersect(b, d)
e = Segment(P, C')
f = Segment(P, E)
g = Circle(Q, 0.5)
G, H = Intersect(g, a)
I, J = Intersect(g, b)
h = OrthogonalLine(J, b)
i = OrthogonalLine(H, a)
K = Point(f)
j = OrthogonalLine(K, f)
L = Intersect(i, j)
k = Circle(Q, 1.5)
M = (-3.5414802725438648, -0.36666666666666553)
N = Point(k)
l = OrthogonalLine(N, a)
O = Intersect(l, h)
m(x) = x ≤ -1.5
P_1, Q_1 = Intersect(k, i)
Vieleck1, n, p, h_1 = Polygon(P_1, H, N)
R, S = Intersect(k, a)
q = OrthogonalLine(R, a)
U = Intersect(m, ((-(x(q) / y(q))) * x) - z(q) / y(q), (-2.241480371512307, 1))
T = Intersect(q, h)
Vieleck2, o, n_1, p_1, l_1, k_1, d_1, r, t = Polygon(O, N, P_1, L, K, Q, R, T)
s(x) = If[x  <  3.5, sqrt((4 * x))]
f_1(x) = If[x  <  3.5, (-sqrt((4 * x)))]
A = Point(m)
D = (-2.101480382170447, 2.7333333333333374)
u = Vector(A, D)
v = Vector(D, A)
w = false