Let us say we have 2 boundaries of 2 meshes that are roughly aligned, for example 2 generalized cylinders (sweeping surfaces) with a small gap in between. And let us say we want to connect them to each other.

The 2 don't necessarily have the same number of points. Is there an algorithm to find a triangulation of the space between the 2 boundaries?

enter image description here

Somtehing like this image, where we find connections between the boundaries such that the resulting graph forms a well behaved watertight manifold connecting the 2.

  • $\begingroup$ do you know which vertices should be connection vertices? Or should the algorithm find it out itself? $\endgroup$
    – Thomas
    Feb 16 at 11:03
  • $\begingroup$ The algorithm needs to find out. If I knew there would be no need to ask this :p $\endgroup$
    – Makogan
    Feb 16 at 19:11
  • $\begingroup$ Will the boundaries each be planar, convex polygons, or more general than that? $\endgroup$
    – Kevin Reid
    Feb 17 at 14:58
  • $\begingroup$ Neither co planar nor convex $\endgroup$
    – Makogan
    Feb 17 at 19:51


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.