CGAL users discussion list

Hi at all!

I'm using the Triangulation_3 data structure for simulating deformable 
models. The advantage of that data structure is the simple access for 
information about neighbors. 

I constructed different models, in my case simple bars, by inserting 
equidistant points in a Delaunaytriangulation. Using the I/O functionality of 
the data structures i can load and save these Triangulations. 

Now i want to simulate other models. I've got the tetrahedral mesh as list of 
points and tetrahedra referring to the points. I've already spent a long time 
for an incremental construction of the tetrahedral mesh. But i failed, 
because of the very complex neighbor information especially of infinite 
tetrahedrons. 

Is there any existing algorithm for that kind of problem? Or can anybody give 
me a hint how to construct the tetrahedral mesh properly? 

Best regards, 
Daniel Weber