P_1 = (-0.4, -0.36)
P_2 = (4.054766861022025, -0.45997422215197825)
P_3 = (2.7296567055934635, 1.7194832703292109)
P_4 = (1.8230023887212894, 0.6733436739382401)
P_5 = (4.22912346042052, 0.8825715932164343)
a = Line(P_1, P_3)
b = Line(P_1, P_2)
c = Line(P_4, P_2)
A = Intersect(a, c)
d = Line(P_3, P_4)
B = Intersect(b, d)
d_4 = Line(A, B)
f = Line(P_5, P_2)
C = Intersect(a, f)
g = Line(P_3, P_5)
D = Intersect(b, g)
d_5 = Line(D, C)
L = Intersect(d_5, d_4)
M = Point(a)
i = Line(L, M)
N = Intersect(b, i)
j = Line(M, P_2)
k = Line(N, P_3)
P = Intersect(j, k)
polígono1, h_1, g_1, f_1 = Polygon(N, M, P)
p = Conic(P_1, P_2, P_3, P_4, P_5)

Tool: Conjugado Isogonal (command ConjugadoIsogonal)
Dar los vértices de un triángulo y un punto
Input: A, B, C, P
Output: G

P*

polígono1, c, a, b = Polygon(A, B, C)
d = OrthogonalLine(P, b)
e = OrthogonalLine(P, a)
f = OrthogonalLine(P, c)
g = Line(A, B)
h = Line(B, C)
i = Line(C, A)
D = Intersect(g, f)
E = Intersect(d, i)
F = Intersect(h, e)
k = Line(E, F)
l = Line(F, D)
n = OrthogonalLine(B, l)
p = OrthogonalLine(C, k)
G = Intersect(n, p)