N = (2, -2)
F = Point(Segment[N, (x(N) + 12, y(N))])
H = Point(Segment[N, F])
P = (3, 1)
f = Segment(F, P)
f_1 = Ray(N, P)
t = Line(H, f_1)
U = Intersect(f, t)
r: y = y(U)
g: y = y(P)
a = Line(F, f_1)
Z = Intersect(r, a)
T = Intersect(a, g)
W = Intersect(g, t)
V = Intersect(r, f_1)
veelhoek1, p, q, b = Polygon(V, U, P)
veelhoek2, g_1, h_1, i_1, j_1 = Polygon(N, H, U, V)
veelhoek3, i, j, k = Polygon(U, F, H)
veelhoek5, l, m, n = Polygon(Z, F, U)
veelhoek4, w_1, t_1, z_2, u_3 = Polygon(W, T, Z, U)
veelhoek6, p_1, w, u = Polygon(W, U, P)
I = (-2.743979409328058, -3.793397129186583)