[FEA]: Implement binary predicates that depend on equals

[thomcom]

Is this a new feature, an improvement, or a change to existing functionality?

New Feature

How would you describe the priority of this feature request

Critical (currently preventing usage)

Please provide a clear description of problem you would like to solve.

Is your feature request related to a problem? Please describe.
Some spatial predicates depend only on the outcome of point-in-polygon.

Describe the solution you'd like
I can work on these predicates in python while the equals and intersects basic predicates are being worked on.

Equality/Intersection/PIP table
Legend:
x: False/impossible
e: uses equality
i: uses intersection
p: uses pip

	x(p, p)	x(p, l)	x(p, P)	x(l, p)	x(l, l)	x(l, P)	x(P, p)	x(P, l)	x(P, P)
Equals	e	x	x	x	e	e	e	e	e
Disjoint	e	e	e	i	i	ip	ep	ep	ep
Touches	e	e	p	i	i	ip	ip	ip	ip
Contains	e	x	x	i	e	x	p	p	p
Covers	e	x	x	i	e	x	ip	ip	ip
Intersects	e	e	p	i	i	i	ip	ip	ip
Within	e	e	p	x	e	p	x	x	p
CoveredBy	e	e	p	x	e	p	x	x	p
Crosses	e	x	x	i	i	i	p	i	i
Overlaps	e	x	x	i	i	i	p	i	i

#832 (comment)

Describe any alternatives you have considered

No response

Additional context

No response