Mostar la construcción

$c$

$F$

$t$

$P$

$S$

$F(2c)$

$F_2$

$F_1$

$O_1$

$O_1\left(\frac{F_1S}{2})$

$O_2$

i = true
A = (-1.4322521527662893, 4.937656794391581)
B = (8.604342008880458, 4.919375202111714)
a = Ray(A, B)
C = Point(a)
c = Segment(A, C)
F = (4.62, 0.6)
D = (1.5907768308314005, 5.0558331018959946)
E = (7.50754657094724, -0.012576271070886252)
t = Line(D, E)
P = Point(t)
S = Mirror(F, t)
b = Line(S, P)
d = Circle(F, 2 * c)
F_2, F_1 = Intersect(d, b)
O_1 = Midpoint(F_1, F)
e = Circle(O_1, Segment[F_1, S] / 2)
f = Line(F, F_1)
G, H = Intersect(e, f)
P' = Mirror(P, f)
P'_1 = Mirror(P, O_1)
h = Conic(P, P', P'_1, G, H)
O_2 = Midpoint(F, F_2)
k = Circle(O_2, Segment[F_2, S] / 2)
g = Line(F, F_2)
I, J = Intersect(k, g)
P'_2 = Mirror(P, g)
P'_3 = Mirror(P, O_2)
p = Conic(P, P'_2, P'_3, J, I)

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)