Artificial intelligent assistant

How to “shrink” a triangle !alt textGiven any triangle (vertices are known) and a distance $X$, how can I compute the triangle that is shrunk by $X$ from the original? By shrink, I mean edges of the shrunk triangle are exactly $X$ away from the original edges. So if $X$ is large enough, the shrunk triangle doesn't exist. EDIT: the resulting triangle needs to be inside the given triangle. Attaching a picture for clarity.

Green triangle (result) is obviously a homothety of the given (blue) triangle with respect to a certain point $Q$ inside the triangle, and a certain coefficient $k$. As you wish to find $Q$ and $k$ providing the distance $X$ from the original edges, then the direction of the moveout of the vertices lays on the original triangle's bisectors (proof is trivial for every vertex of the green triangle). The intersection point of triangle bisectors is the center of the inscribed circle. So, the homothety center $Q$ is the center of the inscribed circle. The homothety coefficient $k$ is the fraction of $X$ with respect to inscribed circle radius $R$: $k=\dfrac{R}{R-X}$. Thus, given the original triangle vertices $A, B, C$, find the inscribed circle $Q, R$, then find the scale $k$, then moveout the vertices: $A'=A+(Q-A)\times k$ - same for $B, C$ - in vector form.

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy f83f0ce728433bc520cc157da472918f