Adds pairwise_point_polygon_distance benchmark

[isVoid]

Description

This PR separates the pairwise_point_polygon_distance benchmark portion of PR #1002. While that PR is only left for nvtx3 experiments.

Original PR description:

This PR adds pairwise point polygon distance benchmark. Depends on #998

Point-polygon distance performance can be affected by many factors, because the geometry is complex in nature. I benchmarked these questions:

1. How does the algorithm scales with simple multipolygons?
2. How does it scales with complex multipolygons?

How does the algorithm scales with simple multipolygons?

The benchmark uses the most simple multipolygon, 3 sides per polygon, 0 hole and 1 polygon per multipolygon.

Float32

Num multipolygon	Throughput (#multipolygons / s)
1	28060.32971
100	2552687.469
10000	186044781
1000000	1047783101
100000000	929537385.2

Float64

Num multipolygon	Throughput (#multipolygons / s)
1	28296.94817
100	2491541.218
10000	179379919.5
1000000	854678939.9
100000000	783364410.7

The chart shows that with simple polygons and simple multipoint (1 point per multipoint), the algorithm scales pretty nicely. Throughput is maxed out at near 1M pairs.

How does the algorithm scales with complex multipolygons?

The benchmark uses a complex multipolygon, 100 edges per ring, 10 holes per polygon and 3 polygons per multipolygon.

float32

Num multipolygon	Throughput (#multipolygons / s)
1000	158713.2377
10000	345694.2642
100000	382849.058

float64

Num multipolygon	Throughput (#multipolygons / s)
1000	148727.1246
10000	353141.9758
100000	386007.3016

The algorithm reaches max throughput at near 10K pairs. About 100X lower than the simple multipolygon example.

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]

/merge