CGAL users discussion list

[pbarletta <>]

Hi,
      I have 2 triangulations (A and B) and I would like to compute the
volume of the intersections between triangulation *A* and some cells of
triangulation *B*. These intersecting cells are only a few.
      The 3 cases are possible:
            1 vertex of the cell is inside the triangulation *A*.
            2 vertices of the cell is inside the triangulation *A*.
            3 vertices of the cell is inside the triangulation *A*.

      I'm wondering what would be the best approach:

         -- Computing the intersection points to construct new polyhedrons
and then calculate their volume?
         -- Converting the intersecting cells (and the triangulation *A*) to
Nef_Polyhedrons and then obtain the intersection, which may be converted
back to a polyhedron to calculate its volume? 
         -- Any other option I'm not thinking of?

    I started off with the 1st option, but since CGAL::intersection() does
not take cells as inputs, and there is the chance that the intersecting cell
traverse more than 1 cell of the triangulation *A*, I started doubting.

Any help is appreciated.
    



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Intersection-between-Delaunay-triangulations-tp4662395.html
Sent from the cgal-discuss mailing list archive at Nabble.com.