Implement all binary operations that depend only on point-in-polygon

[thomcom]

Closes #722
Closes #835

Description

This PR begins the refactoring of binary operations code to support every binary operation and combination of inputs. A new test file is created, tests/binops/test_pip_only_binpreds.py that contains a size 1 and a size 31 case for each binop combination that should work with only .contains_properly. Three binary predicates are partially implemented in this PR: overlaps, intersects, and within.

The following tests are implemented in this binpred:

• test_polygon_overlaps_point
• test_max_polygons_overlaps_max_points
• test_polygon_overlaps_polygon
• test_max_polygon_overlaps_max_points
• test_point_intersects_polygon_interior
• test_max_points_intersects_max_polygons_interior
• test_point_within_polygon
• test_max_points_within_max_polygons
• test_linestring_within_polygon
• test_max_linestring_within_max_polygon
• test_polygon_within_polygon
• test_max_polygons_within_max_polygons
• test_polygon_overlaps_linestring
• test_max_polygons_overlaps_max_linestrings

Checklist

• I am familiar with the Contributing Guidelines.
• New or existing tests cover these changes.
• The documentation is up to date with these changes.

[isVoid]

Initial pass to the code. Strategy pattern does makes sense here.

[isVoid]

Where's .contains_properly?

NM, it's from the last PR.

[thomcom]

rerun tests

[isVoid]

rerun tests

[thomcom]

Thanks Mark, I updated the docs as you requested.

[harrism]

More doc suggestions, but pre-approving.

[thomcom]

@gpucibot merge