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
Hi, we are currently doing an offset (buffer) operation by a very small amount in order to take a whole load of polygons, some of which are abutting each other, and return a simplified list of fewer polygons, with the abutting ones merged into a whole.
It occurs to me that this is quite computationally inefficient though, and perhaps there's a better way to do it? We're currently using Clipper1 but planning our upgrade to Clipper2, so answers that apply in both versions would be wonderful.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
Hi, we are currently doing an offset (buffer) operation by a very small amount in order to take a whole load of polygons, some of which are abutting each other, and return a simplified list of fewer polygons, with the abutting ones merged into a whole.
It occurs to me that this is quite computationally inefficient though, and perhaps there's a better way to do it? We're currently using Clipper1 but planning our upgrade to Clipper2, so answers that apply in both versions would be wonderful.
Thanks!
Beta Was this translation helpful? Give feedback.
All reactions