Is your feature request related to a problem? Please describe.
Part of #231 , ST_Distance requires polygon-polygon distances.
Describe the solution you'd like
Computing all pairs segment-segment shortest distance should be sufficient. This will compute any possible intersections too.
Consider blockwise algorithm due to geometric complexity.
Is your feature request related to a problem? Please describe. Part of #231 , ST_Distance requires polygon-polygon distances.
Describe the solution you'd like Computing all pairs segment-segment shortest distance should be sufficient. This will compute any possible intersections too.
Consider blockwise algorithm due to geometric complexity.