CGAL users discussion list

[Jiongxin Jin <>]

Thank you for your clarification, Laurent.
Actually, that is exactly what I did after reading the source code a bit.
Just because I cannot find any document, I am not sure whether it is
the correct way to do.
(For example, future versions of CGAL may change the implementation of 
handles.)
Now I think I just cast them to handles anyway. :)

Regards,
James

On Sun, Mar 21, 2010 at 2:47 AM, Laurent Rineau (GeometryFactory)
<>
 wrote:
> Le Samedi 20 Mars 2010 16:29:15, J. Jin a écrit :
>> Dear all,
>>
>> I want to know whether there is a general way to convert an
>> iterator/circulator to a handle.
>
> Most CGAL iterators/circulators type are castable to the corresponding 
> handle
> implicitly.
>
>> Consider the following example.
>> I want to traverse in a mesh with type Triangulation_data_structure_2 for
>> some vertex in a breadth first search manner.
>> I start with a vertex(suppose I have its handle), so I can use circulators
>> to check all its neighbors.
>> But... here is the problem. How can I continue?
>> The method incident_vertices needs an input of type Vertex_handle, but what
>> I got is of type Vertex_circulator.
>
> You can use circulators and iterators as if they were handles.
>
> --
> Laurent Rineau, PhD
> Release Manager of the CGAL Project       http://www.cgal.org/
> R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
>
>