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.

  • $\begingroup$ What data does the algorithm have to work with, in particular: how is the set of existing polygons given? $\endgroup$ – Klaus Draeger Oct 15 '13 at 14:51
  • $\begingroup$ the (ordered) coordinates of the edges are given $\endgroup$ – Simon Fromme Oct 15 '13 at 21:15
  • $\begingroup$ That's all I should add. Which polygon is linked to which, etc. is not specified. $\endgroup$ – Simon Fromme Oct 17 '13 at 2:39
  • 1
    $\begingroup$ I suppose that this is what the algorithm would need to determine first, i.e. determine which edges are common to two of the polygons. Your object is closed iff this is the case for all edges. $\endgroup$ – Klaus Draeger Oct 17 '13 at 11:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.