Here's a curious set of vertices for a tetrahedron: {{-22, -25, 4}, {-12, 15, -6}, {8, 5, -6}, {18, -15, 24}}
The Fermat point of a tetrahedron minimizes the total distances from the point to the vertices. There is a general method for finding the Fermat point of polygons using the Weiszfeld algorithm.
The six edge lengths of this tetrahedron are different. The Fermat point is at the origin.
Find a second tetrahedron with six different edge lengths, integer coordinates away from the origin, and a Fermat point at the origin. The second tetrahedron should not be a variation of the first tetrahedron.
For thousands of other differently-edged integer-vertex tetrahedra I've looked at, the Fermat point requires the algebraic roots of three sextic to octic polynomials. And then there's this one integer solution.
For a triangle, the projection of the vertices onto a circle centered on the Fermat point splits the circle into 3 equal arcs.
For a tetrahedron, a projection of the vertices onto a sphere centered on the Fermat point splits the sphere into 4 equal spherical triangles. (Is this known?)
Incenter - tiny sphere near Fermat
Centroid - green {-2, -5, 4}
Circumcenter - cyan {-(33/4), -(5/2), 71/4}
Twelve point - yellow {1/12, -(35/6), -(7/12)}
Symmedian - pink {42/89, 315/89, -(144/89)}
Fermat - red {0,0,0}
Monge - magenta {17/4, -(15/2), -(39/4)}
This diagram made with code from Tetrahedron Centers
