Starting from an intersection of the vertices of a tetrahedron with a sphere;
Is it possible to recursively divide the 4 spherical triangles into 4*4 = 16 smaller triangles according to the pattern below?:
Is self-similarity preserved when dividing the spherical triangle into 4 equal spherical triangles? In other words, can you keep dividing the spherical triangles ad infinitum?
[EDIT:] Due to spherical Excess the angles of the smaller spherical triangle will be different than the larger spherical triangle. If a spherical triangle is defined by angles a,b,c, alpha, beta, gamma is it possible to find equations to determine these angles using the number of divisions? Inother words the number of times a large spherical triangle has been partitioned in 4 spherical triangles?



Let $u$ and $v$ be two points on the unit sphere. The midpoint of the arc between them is found from the midpoint in space $u+v\over2$, then normalizing it - stretching it to have unit length.
The points of a regular tetrahedron might be $$A(c,s,0), B(c,-s,0), C(-c,0,s), D(-c,0,-s)\\c=\sqrt{1\over3},s=\sqrt{2\over3}$$ All points are a distance $\sqrt{8/3}$ from each other.
The midpoints between the first three points of the tetrahedron are:
Midpoint of $AB$ is $(1,0,0)$;
Midpoint of $BC$ is $(0,-\sqrt{1\over2},\sqrt{1\over2})$;
Midpoint of of AC is $(0,\sqrt{1\over2},\sqrt{1\over2})$
These three points are perpendicular to each other, so the middle triangle when you quarter $\Delta ABC$ has three right angles. The other three have angles $120^\circ,45^\circ,45^\circ$.