CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 05/09/2012 02:21 PM, horstmann wrote:
> Hi Sebastien,
>
> thanks for your fast and accurate answer.
>
> I'm still a bit confused whit the second parameter.
>
> > > - for each tetrahedron, the position of its four vertices (in ascending
> > > order).
> >
> > Triangulation::Cell_handle cell=....
> > cell->vertex(i).point(); //for i=0; i<4
> > cf [2,3]
>
> When you say "Triangulation::Cell_handle cell=.... " What should I assign to
> 'cell'?
>
> I guess I need an iterator over finite_cells, don't I ?
>
> At this moment I'm doing this:
>
>          typedef CGAL::Exact_predicates_inexact_constructions_kernel
> K;
>          typedef CGAL::Triangulation_vertex_base_with_info_3<unsigned, K> 
> Vb;
>          typedef CGAL::Triangulation_data_structure_3<Vb>                     
>     
> Tds;
>          typedef CGAL::Triangulation_3<K, Tds>::Cell_handle                   
>      Cell_handle;
>
>          ................
>          ................
>          ................
>
>          Cell_handle cell = ... ?? ;
>
>          Delaunay::Finite_cells_iterator fit;
>
>         for(fit = dt.finite_cells_begin() ; fit != dt.finite_cells_end() ; 
> fit++,
> i++)
>                 for(i=0;i<4;i++)
>                         cell->vertex(i).point();
fit->vertex(i).point() will work.

Sebastien.

> Is all of that correct? What am I missing?
> Thank you again so much !!
> EDU.
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/How-to-get-some-info-from-a-Delaunay-Triangulation-tp4617393p4620270.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.