<p>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.</p>
<p>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?</p>
<p><a href="https://i.sstatic.net/AozCc.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/AozCc.png" alt="enter image description here" /></a></p>
<p>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.</p>

CC BY-SA 4.0
2023-02-16T11:03:03.790Z
do you know which vertices should be connection vertices? Or should the algorithm find it out itself?
Thomas
CC BY-SA 4.0
2023-02-16T19:11:15.210Z
The algorithm needs to find out. If I knew there would be no need to ask this :p
Makogan
CC BY-SA 4.0
2023-02-17T14:58:07.207Z
Will the boundaries each be planar, convex polygons, or more general than that?
Kevin Reid
CC BY-SA 4.0
2023-02-17T19:51:12.903Z
Neither co planar nor convex
Makogan
<computational-geometry><mesh><geometry>
Stitching 2 boundaries together
Makogan
# Stitching 2 boundaries together

(Asked by: username_0 on 2023-02-16)

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](https://i.sstatic.net/AozCc.png)](https://i.sstatic.net/AozCc.png)

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.

**Tags:** computational-geometry, mesh, geometry

> **Comments:**
> **username_1**: do you know which vertices should be connection vertices? Or should the algorithm find it out itself?  
> **username_0**: The algorithm needs to find out. If I knew there would be no need to ask this :p  
> **username_2**: Will the boundaries each be planar, convex polygons, or more general than that?  
> **username_0**: Neither co planar nor convex  

---

## 0 answers

