Tetrahedronation of the grid

Question

I am looking for an algorithm that receives a three-dimensional surface grid (i.e. consisting of three triangles, which are a discretization of some variety) and generates tetrahedra inside the volume of the grid.

ie, I want the three-dimensional equivalent of this 2d problem: given a closed curve, it triangulates it inside.

I apologize if this is unclear, this is the best way I could explain this.

For the case of 2d Triangle . For the 3d case, I could not find it.

Answer 1

I found GRUMMP that seems to meet all the needs mentioned in the question, and more ...

Answer 2

I had no experience using GRUMMP, but there is tetgen in the 3D version of the triangle. If you know the triangular switches, it is built to resemble it. It also has pretty decent documentation and a python shell for it and a triangle.

http://wias-berlin.de/software/tetgen/

http://mathema.tician.de/software/meshpy/

Answer 3

Pygalmesh (my CGAL based project ) can do just that.

pygalmesh-volume-from-surface elephant.vtu out.vtk --cell-size 1.0 --odt 

https://github.com/nschloe/pygalmesh/#volume-meshes-from-surface-meshes