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
What is the best (fastest) approach to detect holes in a polygon coverage (i.e holes in a triangular mesh)?
One approach I've found is creating a polygon from the coverage (using CoverageUnion.union) and then counting its interior rings, but is there a better way?
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
-
What is the best (fastest) approach to detect holes in a polygon coverage (i.e holes in a triangular mesh)?
One approach I've found is creating a polygon from the coverage (using
CoverageUnion.union) and then counting its interior rings, but is there a better way?Beta Was this translation helpful? Give feedback.
All reactions