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
Is your feature request related to a problem? Please describe.
Part of #231 , ST_Distance requires linestring-polygon distance.
Describe the solution you'd like
Computing the shortest segment distance between all pairs of segment and polygon should be sufficient. This also checks if the edges between two geometries intersects.
Consider using a block-wise algorithm due to geometry complexity.
The content you are editing has changed. Please copy your edits and refresh the page.
This PR adds `linestring-polygon` distance API. This API divides up the work into two parts: point-in-polygon test and a load-balanced all-pairs segment-segment distance compute kernel.
Closes#1027
Depends on #1026
Contributes to #757
Authors:
- Michael Wang (https://github.com/isVoid)
Approvers:
- Mark Harris (https://github.com/harrism)
- H. Thomson Comer (https://github.com/thomcom)
URL: #1011
Is your feature request related to a problem? Please describe.
Part of #231 ,
ST_Distance
requires linestring-polygon distance.Describe the solution you'd like
Computing the shortest segment distance between all pairs of segment and polygon should be sufficient. This also checks if the edges between two geometries intersects.
Consider using a block-wise algorithm due to geometry complexity.
Tasks
The text was updated successfully, but these errors were encountered: