I have a 3D object bounded by Polygons. Is there a standard algorithm that tests if the volume is closed e.g. no polygon is missing?Example: I have a cube bounded by six squares. The algorithm should detect if one of those squares is missing. It would be perfect, if also the minimal surface could be calculated to complement an existing (open) surface to a closed one. It would be even more perfect if that minimal surface could be returned in terms of a minimal set of convex polygons.
test if a polygon-surface is closed (+ additional nice-to-have requirements)
ds.algorithms;topology