CODEWITHSUNDEEP
pythontriangulationdelaunay
Eduardo
Eduardo

Reputation: 1265

Is there a Python library to do constrained triangulations in 3D?

I have a function whose range is a non-convex, simply connected region in R3. When I sample the function I know if the resulting point is on the surface of the region or not. I'd like to triangulate those samples subject to the surface constrains, i.e., the resulting tetrahedra should not "hide" surface points. The hull would not be convex, of course.

I searched around for a library. So far I found Triangle, but it only works in R2. I also found TetGen, which works in R3, but it requires to provide the surface triangulation (which I don't have). Also, as far as I can see, these C/C++ libraries do not have Python bindings.

Any suggestions? Thanks!

Upvotes: 0

Views: 2516

Answers (1)

gue
gue

Reputation: 2028

You may take a look at CGAL it has python-bindings.

One side note: If you need the surface triangulation (which seems to be a 2D problem), you may take each face, project it to 2D, triangulate it, and back to your 3D face.

EDIT due to comment: CGAL does "only" 3D triangulation. 3D constrained triangulation requires Steiner points. Since not every input can be triangulated in 3D (Schönhardt polyhedron as the classical counter-example).

Maybe you can take a look at MeshPy it looks like it has what you are looking for: "MeshPy provides Python interfaces to three well-regarded mesh generators, Triangle by J. Shewchuk, TetGen by Hang Si, and gmsh by Christophe Geuzaine and Jean-Francois Remacle."

Upvotes: 0

Related Questions