If I understand your requirement correctly you want to find edges which are curved and which, on their convex side, 'enclose' a light region of the diagram ?
I translate your requirement into:
A curve is accepted if any straight line drawn between two points on the curve lies entirely within a light region of the diagram.
That should be fairly straightforward to implement. If the curves comprise many points checking every straight line between each pair of points will be extremely tedious, but you might be satisfied with checking enough straight lines.
But you'll have to define what enough is for yourself.
If, as OP has commented, a curve may include segments which meet the requirement and segments which don't and they are to be separated into a compliant curve and a non-compliant curve, this approach should be adaptable though I can see the processing becoming quite onerous as the number of lines used to check for convexity becomes large.