CGAL users discussion list

Hi Satyajit,

If I understand well, using the following method of Triangulation_3 
should solve your problem.

Triangle          t.triangle ( const Cell_handle c, int i)
		Returns the triangle formed by the three vertices of facet (c,i). The 
triangle is oriented so that its normal points to the inside of cell c.
Precondition: 	t.dimension() greater or equal 2 and i in {0,1,2,3} in 
dimension 3, i = 3 in dimension 2, and the facet is finite.

use it with i = the index of the infinite vertex in your infinite cell.

In this method, we take care of whether i is even or odd.
The user manual explains this orientation issue.

best
        Monique Teillaud

Satyajit Sarangi wrote:

> I don't understand why the triangles somehow point to some interior 
> point of the point cloud. I mean the interior triangles. Essentially it 
> should be the convex hull but thats not what I am getting. I am only 
> including the triangles which are in my "TriangleList" for rendering. 
> Please see the screenshot attached. Laurent, I will definitely try out 
> the convex hull approach but I am trying to see if one of my filtration 
> algorithm works on the delaunay and hence need it. I know its an 
> overkill but right now I have to see both the approaches.
> Thanks and Regards,
> Satyajit