This is different than simply containing, overlapping, etc. For example, imagine a circle partially overlapping a square:
The circle and square both overlap each other, both intersect each other, but only the circle has vertices within the square. (The square only has four vertices, none of which are inside the circle. In practice, since I'm dealing with convex hulls that are creating arcs, the "circle" would be a high-N N-gon).
How can I check for this condition? I was hoping one of Shapely's polygon methods would help, but they don't seem to answer this question. I also tried using
difference in both directions and seeing which one contained all the points of the other, but this not only is very slow but is prone to making accidental holes in the output shapefiles later.
I plan to ultimately end up with a result like this, in case it is helpful:
but it'll be done to a dynamic number of dynamically placed centroid-esque shapes