In the figure below of points in $3$-$D$ space, suppose the lengths of the blue segments are all known. Is it possible to determine the lengths of the red segments? Each point is connected to every other point by a line segment. The triangle $XYZ$ is red (lengths unkown), but all other lengths are known (blue).
My geometry is rusty (especially in $3$-$D$), so I am not sure where to begin this problem. I would think that since $12$ of the segments are known and only $3$ are unknown, it may be possible to set up a system of equations to solve for the unknown lengths. But I am stumped on how to even create the equations. I found some equations about tetrahedra, but there is not an obvious (to me) way to combine them to create a solvable system.
The two most similar questions I found by searching are this one and this one. The first has a similar premise, but in that problem, the lengths are only known between two desired points and many other arbitrary points. The distances between the arbitrary points in that question are unknown, but they are known in my question. The second has more information about the points in a coordinate system, but in my problem no coordinates are known, just the distances between points.
If this problem can not be solved in the general case, could we add some assumptions to make it solvable? E.g. that triangles $ABC$ and $XYZ$ do not intersect, no three points are co-linear, triangle $ABC$ is/is not co-planar/parallel to triangle $XYZ$, etc.
$6$ points in