# Computational Geometry - Triangulation

I'm trying to triangulate complex 3D objects, that may have holes in them. Now I tried going over the problem myself, after a few hours I didn't get anything that would work all of the time, so I've been searching around and without much luck. Does anyone know of any algorithms, or free libraries, that would suit my needs. Links to any relevant documentation would be appreciated as well.

Also as a note, I'm a self taught programmer/cs-tist.

I have a set of points and I need to provide a game engine the shape in triangles. I get these points from a shape, I then add points to add area, subtract area, or split the shape. After modifying/adding points I need to give the game engine the shape in triangles as well as other information. Holes could be anywhere in any shape.

• Can you expand on what you mean by "complex 3D objects"? How are you representing the objects currently? Commented Jul 16, 2016 at 5:26
• Are you dealing only with closed surfaces with holes (such as a bagel or doughnut) or also with holes that lead to the interior of the surface (such as a sphere with a hole leading inside)? Commented Jul 17, 2016 at 10:35
• A given collection of points can be connected into a wide variety of different shape surfaces. Could you explain how these points are produced or how they relate to the intended surface? Commented Jul 17, 2016 at 10:51
• Would using some algorithm like marching cubes over a density field work for you? You could populate a density field with contributions from the points and then sample from that. Commented Aug 6, 2016 at 22:10