CGAL users discussion list

[Dennis Endt <>]

Hi Andreas,

I read the manual for another time and it became clear how I can get a
triangle of a facet. I think I understand how you define the geometry
and how I can work with them.

But I miss the edges of a triangle. Can I only read out the points?

I tried to compare the Point combination of the triangle counter
clockwise with them of the edges I obtained from the
finite_edge_iterator. But they didn`t match.

Is there an easy way to get the edges of a triangle?

Best
Dennis

Andreas Fabri schrieb:
> Hi Dennis,
>
> I think instead of just giving you the code sniplet that does the job,
> we tell you how to search in the manual.
>
> You looked up in the Delaunay triangulation reference manual page for
> some functionality. Fine. But as the class is derived from the class
> Triangulation_3
> (and that is marked in the beginning of the man page of
> Delaunay_triangulation_3)
> some of its functionality is inherited from the base class, and hence
> documented in the base class. And there you will find
>
>
> 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.
>
> Triangle     t.triangle ( Facet f)     Same as the previous method for
> facet f.
> Precondition:     t.dimension() greater or equal 2 and the facet is
> finite.
>
> andreas
>
>