I have a system of inequalities representing the area between pairs of concentric ellipses, as seen in the following diagram: Link to the graph on desmos I want to calcualte the coordinates of the vertices of the polygon approximating the unshaded area. The ultimate goal is to calculate the minimum bounding circle of this polygon: I've researched a similar question dealing with linear expressions which uses scipy.optimize.linprog, however I do not believe that this would be usable in this case I am dealing with quadratic equations and am not trying to find maximum or minimum values for an expression.