Howto find the largest empty circle amid a set of points, and in an enclosing polygon?

Howto find the largest empty circle or Maximum Inscribed Circle amid a set of points, and in an enclosing polygon by python code?

Someone here :point_down: has used OpenCV to do it in the 2D plane. If you don’t use OpenCV, what should you do in the 3D space?

Find largest circle that fits within a set of points given a starting point (numpy)

Our is a very hard computational geometry problem. Probably there are easier ways to achieve what your need. What is your end goal?