CGAL users discussion list

["coz.mars123" <>]

Thank you, this solved the problem.
Sebastien Loriot (GeometryFactory) wrote
> Did you include
> 
> #include <CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h>
> 
> ?
> 
> 
> Best,
> 
> Sebastien.
> 
> On 12/10/20 2:25 PM, "coz.mars123" (

> coz.mars123@

>  via 
> cgal-discuss Mailing List) wrote:
>> Hi,
>>
>> I'd like to iterate over edges of a Delaunay triangulation and get the
>> adjacent faces. The triangulation is the following:
>>
>> typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
>> typedef K::Point_3   Point;
>> typedef K::Vector_3   Normal;
>> typedef std::pair<Normal, unsigned int> Info;
>> typedef CGAL::Projection_traits_xy_3
> <K>
>   Gt;
>> typedef CGAL::Triangulation_vertex_base_with_info_2&lt;Info, Gt&gt; Vb;
>> typedef CGAL::Constrained_triangulation_face_base_with_info_2
> <unsigned int,
>>
>  Gt>  Fb;
>> typedef CGAL::Triangulation_data_structure_2&lt;Vb,Fb&gt; Tds;
>> typedef CGAL::Constrained_Delaunay_triangulation_2&lt;Gt, Tds&gt;
>> Delaunay;
>>
>> I found this topic
>> http://cgal-discuss.949826.n4.nabble.com/How-to-find-the-adjacent-faces-of-every-edge-td4663625.html
>> related to my question.
>>
>> However, it doesn't work in my case. When I use boost::graph_traits:
>>
>> typedef boost::graph_traits
> <Delaunay>
>  GraphTraits;
>> typedef typename GraphTraits::face_descriptor face_descriptor;
>>
>> A compilation error occurs: directed_category is not a member of
>> CGAL::Delaunay_triangulation_2&lt;Gt,Tds&gt;.
>>
>> Thank you for your help!
>>
>>
>>
>> --
>> Sent from: http://cgal-discuss.949826.n4.nabble.com/
>>
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss





--
Sent from: http://cgal-discuss.949826.n4.nabble.com/