CGAL users discussion list

[Tianyun Su <>]

Hi, Andreas,
I am very sorry for reply so late.
Thank you for your kind recommendation and I'll try this function in
our project.
Best regard!

Tianyun

On Tue, Mar 22, 2016 at 4:05 PM, Andreas Fabri
<>
 wrote:
>
> Instead of a circulator, there is a function incident_cells()
> http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Triangulation__3.html#a4aaef5614eda5f25fe0c7f01174e40d8
> that writes into a container, e.g
>
> std::vector<Cell_handle> neighbors;
> t.incident_cells(v, std::back_inserter(neighbors));
>
> best,
>
> andreas
>
> On 22/03/2016 07:04, Tianyun Su wrote:
>>
>> Dear all,
>> I want to visit all cells incident to a given vertex in 3D
>> triangulation data structure. In 2D Triangulation Data Structure,
>> there is vertex_circulator to implement the function. But in
>> 3D triangulation data structure, there is no vertex_circulator. If
>> there is another function to visit all cells incident to a given
>> vertex in 3D triangulation data structure?
>>
>> Thanks.
>>
>> Tianyun
>>
>
> --
> Andreas Fabri, PhD
> Chief Officer, GeometryFactory
> Editor, The CGAL Project
>
> phone: +33.492.954.912    skype: andreas.fabri
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
>
>