A = (-1.52, 0.64)
B = (2.7, 5.04)
C = (6.74, -0.9)
polígono1, c, a, b = Polygon(A, B, C)
d_1, e_1 = AngularBisector(b, a)
f_1, g = AngularBisector(c, a)
h, i = AngularBisector(c, b)
I = Intersect(e_1, i)
d = OrthogonalLine(I, a)
D = Intersect(d, a)
e = Circle(I, D)
E = Intersect(e, c, 1.0)
F = Intersect(e, b, 1.0)
polígono2, f, e_2, d_2 = Polygon(E, D, F)
j = Line(B, F)
k = Line(A, D)
Ge = Intersect(j, k)
l = Line(Ge, e_2)
m = Line(Ge, f)
n = Line(Ge, d_2)
G = Intersect(n, c)
H = Intersect(m, c)
J = Intersect(l, b)
K = Intersect(n, b)
L = Intersect(m, a)
M = Intersect(l, a)
p = Circle(I, G)

Tool: Adams (circunferencia) (command Adams)
Triángulo
Input: polígono1
Output: p

A = (-2.82, 1.44)
B = (0.62, 4.2)
C = (2.24, 1.54)
polígono1, c, a, b = Polygon(A, B, C)
d_1, e_1 = AngularBisector(b, a)
h, i = AngularBisector(c, b)
I = Intersect(e_1, i)
d = OrthogonalLine(I, a)
D = Intersect(d, a)
e = Circle(I, D)
E = Intersect(e, c, 1.0)
F = Intersect(e, b, 1.0)
polígono2, f, e_2, d_2 = Polygon(E, D, F)
j = Line(B, F)
k = Line(A, D)
Ge = Intersect(j, k)
n = Line(Ge, d_2)
G = Intersect(n, c)
p = Circle(I, G)