You need something similar to Triangulation from the Collection of examples from discourse.threejs.org ( from 2018 discourse.threejs.hofk.de )
- but in 3D with polar coordinates. Instead of the plane you have the surface of the unit sphere. The points are projected onto this sphere.
After triangulation the original values of the radius are restored.
The original post @prisoner849
In delaunator.js the algorithm is commented quite well. You can try to transfer it.
// pick a seed point close to the center
// find the point closest to the seed
// find the third point which forms the smallest circumcircle with the first two
// swap the order of the seed points for counter-clockwise orientation
and so on
Some reading Delaunay triangulation - Wikipedia