CGAL users discussion list

[Pranav <>]

I want to create a tetrahedral mesh which can have hole/cavity inside it(at
intermediate stages of computation in an algorithm). For this I am trying to
use  Linear cell complex(LCC)
<http://doc.cgal.org/latest/Linear_cell_complex/index.html>  :

I want to perform the following:
1. Compute intersection between a triangle and all tetrahedrons in LCC.  
2. Remove all intersecting tetrahedrons from LCC.(which forms a cavity)
3. Replace them with another set of tetrahedrons.(these must be exactly
aligned with the cavity boundary, to completely fill the hole)

*For task 1:*
I need to traverse through all tetrahedrons. I do not find any iterator sort
of functionality for LCC. Do I need to use a standard graph traversal
algorithm over /beta_3/ links of darts to traverse all tetrahedrons?

*For Task 2:*
Here, I think /remove_cell()/ function has to be used to remove the
intersecting 3-cells.

*For Task 3:*
Although, I do find /make_tetrahedron()/ function that can be used to add a
new tetrahedron into LCC, but can it assure that these new tetrahedrons are
exactly aligned with the boundary of previously created cavity?




--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Implementing-tetrahedral-mesh-with-cavities-using-Linear-cell-complex-tp4659399.html
Sent from the cgal-discuss mailing list archive at Nabble.com.