Add Header Only API pairwise_linestring_intersection

[isVoid]

Description

This PR adds header only API pairwise_linestring_intersection. Closes #765 .

Depends on #813 #818 #819 #851

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]

Do we have a concern about dropping duplicates and making it harder for the user to identify which points intersect or their count?

Unfortunately, the original requirement for the output of intersection is unclear about what the user really expects here. I went afar to return the most cleaned-up output that the algorithm can return. (So does geopandas) It could be an early-optimization. It could be likely that it's not what the user wants. If you think the design is not meeting the need, feel free to file an issue to track.

My question is, does this intersection function help your binary predicate use case?

[thomcom]

I'm sure this helps with implementing a great deal of binary predicates! I'm not exactly sure how, yet. I'm a little worried about a case of $\forall p\ \in \lambda_1 \cap \lambda_2$ if it is required. This definitely covers None and any cases, which, without looking closely at dozens of intersection predicate calls yet, probably covers most of them.

[thomcom]

My questions are mostly general and for the purpose of understanding what's coming my way soon. :) I see @harrism already approved, I will approve if you want to get this merged before the week ends.

[isVoid]

@gpucibot merge