You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This is a preprocess step for linestring_intersection - it computes the number of results between pairs of linestrings. So we know how much space to allocate afterwards.
The text was updated successfully, but these errors were encountered:
This PR adds `intersection_count_upper_bound` and count, for each pair of the input multilinestring, how many intersecting points and overlapping segments at most the pair can produce. This is the first stage of the linestring primitive.
closes#784
Authors:
- Michael Wang (https://github.com/isVoid)
Approvers:
- Mark Harris (https://github.com/harrism)
URL: #795
This is a preprocess step for linestring_intersection - it computes the number of results between pairs of linestrings. So we know how much space to allocate afterwards.
The text was updated successfully, but these errors were encountered: