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
I have thousands of polygons that may partially or completely overlap each other. It is necessary to merge the overlapping ones so that the result doesn't contain a hole. If the result contains a hole, then I just subtract one polygon from the other to remove the common part. Simply speaking:
I do Union in pairs. If the result has a hole, then I do Difference.
It works, but it painfully sloooow. Probably there are faster algo?
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
Uh oh!
There was an error while loading. Please reload this page.
-
I have thousands of polygons that may partially or completely overlap each other. It is necessary to merge the overlapping ones so that the result doesn't contain a hole. If the result contains a hole, then I just subtract one polygon from the other to remove the common part. Simply speaking:
I do Union in pairs. If the result has a hole, then I do Difference.
It works, but it painfully sloooow. Probably there are faster algo?
Beta Was this translation helpful? Give feedback.
All reactions