Mesh cleanup
This operation cleans up meshes generated by marching cubes or surface nets. It addresses common non-manifold topological issues, including:
-
“Dovetail” edges:
-
“Sticky” vertices, where too many faces meet at a single point:
The operation runs in an iterative loop, up to n times, or until no further issues are detected.
While it has a time complexity of O(n²) and isn't the fastest, the performance is acceptable for a one-time cleanup step.