CGAL users discussion list

[Manuel Caroli <>]

Hi,

doesn't e.g. vertices.front()->point() work?

http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3--Vertex.html

best

Manuel


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