CGAL users discussion list

[Andreas Fabri <>]

Dennis Endt wrote:
> Andreas Fabri schrieb:
> > Dennis Endt wrote:
> > > Hi,
> > >
> > > thats my Problem:
> > > /typedef CGAL::Simple_cartesian<double> SK;
> > > typedef CGAL::Filtered_kernel<SK> FK;
> > > struct K : public FK {};
> > >
> > > typedef K::Point_3 dPoint;
> > > typedef CGAL::Delaunay_triangulation_3<K> Triangulation;
> > > typedef Triangulation::Vertex_handle Vertex_handle;
> > >
> > > Triangulation T;
> > >
> > > list<Vertex_handle> vertices; // vector to hold the points of the convex
> > > hull
> > > T.incident_vertices(T.infinite_vertex(), back_inserter(vertices)); //
> > > get the points from Delaunay/
> > >
> > > Can anyone plz tell how I get access to the points corresponding to the
> > > vertex_handles? It is very urgent.
> > >
> > > I tried everything so far...it cannot be so difficult ;)
> > >
> > > Best Dennis
> > for(list<Vertex_handle>::iterator it =  vertices.begin();
> >     it != vertices.end();
> >     ++it){
> >   std::cout (*it)->point() << std::endl;
> > }
> Thanks a lot! :)
>
> I only forgot to set the brackets. It can be so easy :)
>
> Best
> Dennis


And here comes the "official" link
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Handle_ref/Concept_Handle.html

andreas