# Convert itk::PointSet to an triangular itk::Mesh

**URL:** <https://discourse.itk.org/t/convert-itk-pointset-to-an-triangular-itk-mesh/6440>\
**Category:** Algorithms\
**Tags:** itk, mesh, pointset\
**Created:** [February 14, 2024, 10:23pm UTC](https://discourse.itk.org/t/convert-itk-pointset-to-an-triangular-itk-mesh/6440 "2024-02-14T22:23:10Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![HnHd](https://discourse.itk.org/user_avatar/discourse.itk.org/hnhd/32/3791_2.png) [@HnHd](https://discourse.itk.org/u/HnHd)\
**Post date:** [February 14, 2024, 10:23pm UTC](https://discourse.itk.org/t/convert-itk-pointset-to-an-triangular-itk-mesh/6440/1 "2024-02-14T22:23:10Z")

</div>

Hello everyone,

I have a 3D itk::PointSet that I need to save as an .stl file. My plan is to convert the PointSet into a mesh and then save it as an .stl file. However, I’m currently facing a challenge in defining the cells of the mesh.  
I’m thinking about using the Delaunay triangulation algorithm. Before proceeding, I wanted to ask if this algorithm has already been implemented in the library, as I couldn’t find it in the documentation. Perhaps I might have overlooked something.

Thank you in advance!

---

<div class="post-metadata">

**Author:** ![dzenanz](https://discourse.itk.org/user_avatar/discourse.itk.org/dzenanz/32/1093_2.png) [@dzenanz](https://discourse.itk.org/u/dzenanz)\
**Post date:** [February 15, 2024, 7:25pm UTC](https://discourse.itk.org/t/convert-itk-pointset-to-an-triangular-itk-mesh/6440/2 "2024-02-15T19:25:02Z")

</div>

I don’t think that ITK has a Delaunay implementation. Generally, ITK does not have a lot of mesh processing algorithms. It leaves that to other libraries, such as VTK. Take a look at [vtkDelaunay3D class](https://vtk.org/doc/nightly/html/classvtkDelaunay3D.html).