Parking Problem
Author: Toni Chehlarova  d22178
Date: 2015

u_1 = 117.9 (slider from d + (2 * g) to d + (2 * g) + 25.7 + 29.7 + 100, step 0.1)
α = 0.6283185307179586 rad (slider from 1*° to 89*°, step 1*°)
A = Intersect(xAxis, yAxis)
o_1 = 146 (slider from (2 * g) + d to (2 * g) + d + 100, step 0.1)
B: (o_1, 0)
q_3 = Circle(B, u_1)
A' = Rotate(A, 180° - α, B)
a_2 = Ray(B, A')
I_2 = Intersect(q_3, a_2)
h = Segment(B, I_2)
d = 92 (slider from (2 * g) to 300, step 0.1)
g = 12 (slider from 0 to 100, step 0.1)
G: (x(A), g)
u = Vector(A, G)
B' = Translate(B, u)
B'' = Rotate(B', (-α), B)
v = Vector(B, B'')
B'_1 = Translate(B, v)
C' = Translate(I_2, v)
h' = Segment(B'_1, C')
b_2 = 57.8 (slider from 0 to 100, step 0.1)
D: (x(I_2) + (3 * b_2), y(I_2))
i = Segment(I_2, D)
j, l = AngularBisector(h, i)
H = Intersect(l, h')
d_1 = Segment(B'', H)
c = PolyLine(A, B, I_2, D)
E = Point(c)
b_1 = OrthogonalLine(E, h)
M = Intersect(b_1, d_1)
s_3 = Segment(M, H)
f_1 = Circle(M, d)
f = Segment(A, B)
A'_1 = Translate(A, u)
f' = Segment(A'_1, B')
e = OrthogonalLine(E, f)
F = Intersect(e, f')
r_3 = Segment(F, B')
q = Circle(F, d)
P = Intersect(f_1, s_3)
g_1 = Segment(M, P)
c_1 = Circle(M, g)
A_1, C = Intersect(c_1, g_1)
β = Angle(A, B, A')
k = Circle(F, E)
p = CircleArc(B, B'', B')
K = Intersect(q, p)
s = Circle(K, g)
L, N = Intersect(q, h')
t = Circle(L, g)
m = Segment(F, L)
n = Segment(F, K)
r = Circle(N, g)
e_1 = Segment(F, N)
w = Vector(I_2, H)
C'_1 = Translate(I_2, w)
D' = Translate(D, w)
i' = Segment(C'_1, D')
h_1 = Circle(P, g)
Q, I = Intersect(f_1, i')
i_1 = Segment(M, Q)
k_1 = Circle(Q, g)
R = Intersect(e, i')
p_1 = Circle(R, g)
R_1: (x(R) + d, y(R))
q_1 = Circle(R_1, g)
j_1 = Segment(R, R_1)
J = Intersect(q, r_3)
r_1 = Circle(J, g)
a_1 = Segment(F, J)
B1: (x(B) + 20, 0)
γ = Angle(I_2, B, B1)
o = true
S = Intersect(a_1, c)
T, U = Intersect(m, c)
e_2 = Ray(A_1, B'')
B_1 = Intersect(c_1, i_1)
d_2 = Ray(B_1, M)
i_2 = Ray(M, P)
f_2 = Ray(B_1, M)
E_1 = Intersect(k_1, i_1)
k_2 = Ray(E_1, Q)
J_1, K_1 = Intersect(h, c)
L_1, M_1 = Intersect(h, c)
N_1, A_2 = Intersect(k, n)
O_1 = Intersect(s, n)
n_2 = Ray(N_1, F)
r_2 = Ray(O_1, K)
S_1 = Intersect(k, e_1)
T_1 = Intersect(r, e_1)
c_3 = Ray(T_1, N)
d_3 = Ray(S_1, F)
W_1 = Intersect(e_1, f)
Z_1 = Intersect(h, e_1)
D_2 = Intersect(t, m)
E_2 = Intersect(k, m)
i_3 = Ray(D_2, L)
j_3 = Ray(E_2, F)
m_3 = Ray(A_2, F)
разстояниеEh = Distance(E, h)
t_3 = Segment(M, I)
c_4 = Circle(I, g)
M_2 = Intersect(c_4, t_3)
N_2 = Intersect(c_1, t_3)
a_4 = Ray(M_2, I)
b_4 = Ray(N_2, M)