I am trying to find the intersection point of spheres of varying radii and centred at the vertices of a tetrahedron. The script generates 10 spheres centred around each vertex. I want to do the equivalent of collisionmany but intersectionmany. So if we consider just the output from sphere0 and sphere1, I want to do the intersection sphere0_0 with sphere1_0, sphere1_1, sphere1_2 …sphere1_10 etc.
consider that because you know the Radius of both spheres (all pair of spheres) and the distance between their centers, you can also get the answer you are looking for by using math instead of Brep intersection, and draw the intersection Circles directly:
