Kürzester Weg

IMP10

Lösung

α

Lot

α'

β'

A = (-3.0976233044234127, -1.2643942318020867)
C = (3.5377033923589716, 0.17806809358538822)
f = Line(A, C)
B = (-2.4960512509750936, 0.5575435701561544)
L = (3.0100390937554504, 1.0401319130530817)
W = Point(f)
g = Segment(L, W)
h = Segment(W, B)
s: g + h
D = (-4.6362497848367195, 3.171237354872102)
E = (9.038293059836542, -3.9690710280113057)
B' = Mirror(B, f)
i = Segment(B', L)
j = Segment(B, B')
F = Intersect(j, f)
α = Angle(W, F, B)
a = false
k = OrthogonalLine(W, f)
G = Point(k)
H = Point(k)
l = Segment(H, G)
β = Angle(G, W, B)
γ = Angle(L, W, G)
I = Point(f)
δ = Angle(H, W, I)
b = false
Text6: "Weg=" + (LaTeX[s]) + "~LE"
Text2: " \overline{LW}=" + (LaTeX[g]) + "~LE"
Text3: "\overline{WB}=" + (LaTeX[h]) + "~LE"
ε = Angle(W, B', B)
ζ = Angle(B', B, W)