CGAL users discussion list

[Dennis Endt <>]

Hi,

I already study the manual but I didn`t find a solution.

Here is what I know:

Finite_vertices_iterator iv:
(*iv).point() to get a point

Finite_facets_iterator it:
it->first->vertex(i)->point() to get a point

Finite_edges_iterator ie:
Nothing found: I tried ie->second.point() and sth different like this.

But what is the right one?

Best,
Dennis


Monique Teillaud schrieb:
> Hi,
>
> I saw several answers to your previous questions on this list already.
> There was at least one other similar question asked in parallel, which
> was answered too.
>
> Somebody told you already how to get a point from a vertex or a
> vertex_handle.
>
> There are typedefs in the manual for
> Edge: triple<cell_handle,int,int>
> Facet: pair<cell_handle,int>
>
> Everything is detailed in the reference manual of the 3d triangulation
> chapter (with links to the 3D triangulation data structure chapter
> when appropriate)
>
> Having a look at the manual would help *a lot*.
> Best,
>     Monique
>
> Dennis Endt wrote:
>> Hi,
>>
>> I`ve a few questions and I hope anyone could help me soon.
>>
>> typedef CGAL::Simple_cartesian<double> SK;
>> typedef CGAL::Filtered_kernel<SK> FK;
>> struct K : public FK {};
>> typedef K::Point_3 Point_3;
>> typedef CGAL::Delaunay_triangulation_3<K> Triangulation;
>>
>> *Triangulation::Finite_edges_iterator*
>> How can I read out the points of an edge or the edge itself?
>> Is there any typedef for an edge regarding to the typedef for a point
>> above?
>>
>> *Triangulation::Finite_facets_iterator*
>> If there is any typedef for an edge, how can I read out the edges of a
>> facet?
>>
>> Best,
>> Dennis
>