A = (0.3211800736640583, 1.472101959673928)
B = (0.03082672519261977, 0.9751922782231838)
f = Line(A, B)
C = (1.2255813953488315, 0.9518298653610766)
g = Line(B, C)
D = (1.1533582932796813, 1.8598213574493887)
h = Line(C, D)
i = Line(D, A)
E = Intersect(g, i)
j = Line(E, h)
F = Intersect(f, j)
c = Circle(F, sqrt((Distance[F, B] * Distance[F, A])))
G, H = Intersect(c, f)
t = Angle(H, E, G)
α = Angle(B, A, D)
β = Angle(C, B, A)
γ = Angle(D, C, B)
δ = Angle(A, D, C)
k = Line(E, G)
l = Line(E, H)
a: (sin(α + γ))^(2) / ((((sin(α) * sin(β)) * sin(γ)) * sin(δ)))
m = OrthogonalLine(E, f)
I = Intersect(f, m)
n = Segment(E, I)
b: (4 * (cot(t))^(2))