Let n be a given number.

The data I have is a set of (x,y) points plotting the contour of a polygon on each z slice, giving multiple images that can be stacked on the z axis to get a polyhedron.

How can I find all the spheres of diameter n that can fit inside this polyhedron without intersecting each other (specifically, I need to find the set of their centres)? Are there any useful Python libraries in tackling this problem, so I do not need to write all the code from scratch?