Euclidean Steiner Graph for 4 points
Author: Farrar

Euclidean Steiner Graph for 4 points constructed with Fermat points.

A = Intersect(xAxis, yAxis)
B = Point(yAxis)
C = (1, 1)
D = Point(xAxis)
P = (0.5, 0.5)
a = Segment(A, P)
b = Segment(P, B)
c = Segment(P, C)
d = Segment(P, D)
e: a + b + c + d
F = (0.5, 1.1)
f = Line(P, F)
G = Point(f)
g = Segment(B, G)
h = Segment(G, C)
H = Point(f)
i = Segment(A, H)
j = Segment(H, D)
k = Segment(H, G)
l: g + h + i + j + k
poly1, d_1, a_1, e_1 = Polygon(A, P, D)
poly2, m, a_2, e_2, I = Polygon(A, P, 3.0)
poly3, n, e_3, d_2, J = Polygon(P, D, 3.0)
poly4, p, d_3, a_3, K = Polygon(D, A, 3.0)
q = Segment(A, J)
r = Segment(I, D)
s = Segment(K, P)
L = Intersect(r, q)
poly5, c_1, b_1, p_1 = Polygon(B, P, C)
poly6, t, p_2, b_2, E = Polygon(P, B, 3.0)
poly7, f_1, c_2, p_3, M = Polygon(C, P, 3.0)
poly8, g_1, b_3, c_3, N = Polygon(B, C, 3.0)
h_1 = Segment(B, M)
i_1 = Segment(E, C)
O = Intersect(h_1, i_1)
j_1 = Segment(N, P)
k_1 = Segment(A, L)
l_1 = Segment(D, L)
m_1 = Segment(L, O)
n_1 = Segment(O, B)
q_1 = Segment(O, C)