CGAL users discussion list

["Juan Pablo Carbajal" <>]

Hi all,
I was going to answer but I see that again, our friend Andreas was
faster. Thanks again.
I think the documentation about Vertex_handle is not clear, is maybe too 
hidden.

What is the definitive pointer to the doc on Vertex_handle? (Same
applies to Edge).

Searching in ~3500 pages of documentation is not s easy! :D
Anyway, the Library is great and is very easy to use! Just a little
rough at the beginning!

Thanks!

JPi


On Tue, Oct 7, 2008 at 5:38 PM, Andreas Fabri
<>
 wrote:
> 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;
> }
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>