The ExclusionPolygon class stores the polygon's edges in an interval tree implementation called ExclusionPolygonEdgeTree. Each tree node stores a list of edges whose Y coordinates that are completely above, overlap, or below a "center" value. The above and below lists are recursively subdivided until no above/below edges remain. The class should provide a minSubtreeSize parameter that stops the recursive subdivision when only a small number of edges remain.