N = (-5, -1)
J = Point(Segment[N, (x(N) + 10, y(N))])
m_1 = Segment(N, J)
H: (x(N), y(N) + Distance[N, J])
O: (x(N) + (2 * m_1), y(N))
D = Point(m_1)
C: (x(N), y(N) + Distance[N, D])
K: (x(J), y(H))
E: (x(D), y(C))
G: (x(J), y(C))
veelhoek1, a, b, c, e = Polygon(N, D, E, C)
veelhoek2, d_2, j_1, g_1, e_2 = Polygon(D, J, G, E)
F: (x(D), y(H))
veelhoek3, e_3, f_1, h_1, c_1 = Polygon(E, F, H, C)
veelhoek4, t, i_1, k_1, l_1 = Polygon(E, G, K, F)
L: (x(O), y(C))
veelhoek5, n, q, r, s = Polygon(J, O, L, G)
R = (-6.050695777788299, -2.7140966451215722)
m = Segment(N, K)