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 length of the overlap list can be considerable and providing a pair of sorted views of the list would speed up the query methods in some cases.