Baum=O

Radius Kreisstraße

Leinenlänge

Pascal'sche Schnecken

Q ziehen

Tangenten geometrisch an

Tangente in P_2

Tangente in P_1

θ

a = 2 (slider from -5 to 5, step 0.1)
k = 2.4 (slider from -5 to 5)
pascal: (x^(2) + y^(2) - ((2 * a) * x))^(2) = (k^(2) * (x^(2) + y^(2)))
A, B, C = Intersect(pascal, yAxis)
kreisstrasse: (x - a)^(2) + y^(2) = a^(2)
Q = Point(kreisstrasse)
i = Line(B, Q)
leine = Circle(Q, k)
P_1, P_2 = Intersect(leine, i)
r = Segment(B, P_2)
f = Segment(Q, P_1)
g = Segment(Q, P_2)
Ortslinie1 = Locus(P_1, Q)
Ortslinie2 = Locus(P_2, Q)
D = (-4.5, -1.5)
E = (-3.3200683548564447, -1.5)
h = OrthogonalLine(B, i)
N, F = Intersect(kreisstrasse, h)
d1, p_2, b, n = Polygon(B, N, P_2)
j = OrthogonalLine(P_2, b)
G = Point(j)
α = Angle(N, P_2, G)
β = Angle(N, B, P_2)
c = true
d2, p_1, b_1, n_1 = Polygon(B, N, P_1)
l = OrthogonalLine(P_1, b_1)
d = true
I = Point(l)
γ = Angle(N, P_1, I)
O': ((2 * a), 0)
θ = Angle(O', B, Q)
ε = Angle(B, O', N)
m = Segment(Q, O')
p = Segment(O', N)
q = Segment(Q, N)