A

B

D

C

F

E

G

H

I

A = (-3, -4)
B = (-2, -3)
C = (-3, -2)
D = (-4, -3)
E = (-1, -2)
F = (-2, -1)
G = (-3, 0)
H = (-4, -1)
I = (-5, -2)
a = Segment(A, E)
b = Segment(E, G)
c = Segment(G, I)
d = Segment(I, A)
e = Segment(B, H)
f = Segment(D, F)
veelhoek1, a_1, e_1, g, i = Polygon(A, E, G, I)
u_2 = Vector(F, F + F - B)
u = Vector(H, H + H - D)
u_1 = Vector(G, G + (G - C) / 2)
v = Vector(I, I + I - D)
v_1 = Vector(H, H + H - C)
v_2 = Vector(G, G + G - F)
w = Vector(E, E + E - B)
w_2 = Vector(G, G + G - H)
w_1 = Vector(F, F + F - C)
J = (1.6972116767138439, -0.9090361302747684)
K = (2.923029191784613, 1.1339930615098472)
L = (0.7369879565750745, 0.7049569312350781)
M = (2.0240963473993823, 1.6651806513738474)
veelhoek2, j, k, m, l = Polygon(J, K, M, L)
S_r = Intersect(Line[J, K], Line[L, M])
q = Segment(M, S_r)
r = Segment(K, S_r)
S_l = Intersect(Line[J, L], Line[K, M])
n = Segment(L, S_l)
p = Segment(M, S_l)
h = Line(S_l, S_r)
S = Intersect(Line[M, J], h)
s = Segment(J, S)
t = Segment(K, S)
N = Intersect(q, t)
O = Intersect(r, Line[S_l, N])
b_1 = Segment(O, S_l)
P = Intersect(b_1, s)
Q = Intersect(p, Line[S_r, P])
R = Intersect(n, Line[S_r, P])
c_1 = Segment(R, S_r)