directriz

$F$

eje

$D$

$F(e\cdot FD)$

$M$

$U$

$V$

$P$

A = (1.2449512737080652, 2.7630959788985154)
B = (1.282, -3.1872)
d = Line(A, B)
F = (3.640985068097674, -0.13930939644742465)
C = (0.1691204102471375, 4.275530847485958)
D_1 = (3.941022754578584, 4.296962110806023)
a = Ray(C, D_1)
E = Point(a)
e = Segment(C, E)
b = OrthogonalLine(F, d)
D = Intersect(d, b)
c = Circle(D, 1)
G = Intersect(c, d, 1)
f = Circle(D, e)
g = Ray(D, G)
H = Intersect(f, g, 1)
h = Segment(F, G)
i = Line(H, h)
I = Intersect(i, b)
k = Circle(F, Segment[D, I])
M = Point(k)
U = Point(d)
l = Segment(M, U)
m = Segment(U, F)
n = Line(F, l)
V = Intersect(n, d)
p = Line(V, m)
j = Line(M, F)
P = Intersect(j, p)
lugar1 = Locus(P, M)

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)