1

2

.

.

.

“eine” Lösung

A = (-9, 6)
B = (9, 6)
a = Segment(A, B)
C = (9, -6)
b = Segment(B, C)
D = (-9, -6)
c = Segment(C, D)
d = Segment(D, A)
E = (-4.48, 1.58)
Vieleck1, a_1, b_1, c_1, d_1 = Polygon(A, B, C, D)
F = (3.12, -0.84)
G = (5.98, 1.02)
e = Line(E, F)
f = OrthogonalLine(E, d)
H = Intersect(d, d_1)
I = Intersect(f, d)
g = Circle(I, E)
J, K = Intersect(g, f)
h = Line(D, C)
i = OrthogonalLine(K, f)
L = Intersect(h, i)
k = Circle(L, K)
M, N = Intersect(k, i)
j = OrthogonalLine(F, b)
O = Intersect(j, b)
p = Circle(O, F)
P, Q = Intersect(p, j)
l = Line(Q, N)
R = Intersect(h, c)
S = Intersect(l, h)
m = Line(S, K)
T = Intersect(m, d)
U = Intersect(l, b)
n = Segment(E, T)
q = Segment(T, S)
r = Segment(S, U)
s = Segment(U, F)
V = Point(n)
u = Vector(E, V)