Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces

Subject: CGAL users discussion list

List archive

[cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces


Chronological Thread 
    < Chronological >      < Thread >
  • From: "coz.mars123" <>
  • To:
  • Subject: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces
  • Date: Thu, 10 Dec 2020 07:25:26 -0600 (CST)
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=SoftFail ; spf=Pass
  • Ironport-phdr: 9a23:bnPmwR+43NlN1/9uRHKM819IXTAuvvDOBiVQ1KB30e8cTK2v8tzYMVDF4r011RmVBNqdsqIcwLCK+4nbGkU4qa6bt34DdJEeHzQksu4x2zIaPcieFEfgJ+TrZSFpVO5LVVti4m3peRMNQJW2aFLduGC94iAPERvjKwV1Ov71GonPhMiryuy+4ZLebxhKiTanfL9/Lwm6oQrPusQZnIBvNrs/xhzVr3VSZu9Y33loJVWdnxb94se/4ptu+DlOtvwi6sBNT7z0c7w3QrJEAjsmNXs15NDwuhnYUQSP/HocXX4InRdOHgPI8Qv1Xpb1siv9q+p9xCyXNtD4QLwoRTiv6bpgRRn1gykFKjE56nnahMJwgqxFoxyvuhNwzJLbboyOKPpzfL/Rcc8GSWZdQMpcUTFKDIOmb4sICuoMJehUoJX6p1oPtxe+ABOjBPn0yjNVmHP706M22PkmHA7a2wwhHsgCsHHOo9XvL6ceTP65wafTwDXMavNZwzb96IzSfh89pvGMWKt9fMzMwkYgCw3LlE+fqZD5PzyLzOQNtXCW4epuWO+hi2MqpQ9/rDexy8sxhIfEiJwZxk3E+Chlwos4O9y1RVB1b9O4DpdcqiWXOo9qTs4+TG9lpig3x78btZO9YSMExpMnxxvFZPyGdYiF+hTjW/yKLjhjgHJqZqiziAq18UilzOD3S8q60E5SoyZYltTBsmoB2hLQ58SdSfZw/12t1DeO2g3V9+pKO1o7lbDBJJ4k2rMwloQcsUDEHiLunkX7g7WadkM+9eez8OvnZqvpqoWAOI9zjwHyKqUumsqhDuQkKgUCQmyW9OCm2LDt/kD1WrZHg/wsnqTYsZ3WPcEbqbS4Aw9R3IYj8RG/DzK+3dsEmnkGLUhJeBedgIjzIFHCPe70APmkjlSjlTdk3fHGPrn7DprRKXjDla/tfaxh5E5E1Aoz0ddf6opIBbEOOv3zXlb9u8HZDh8iLwO03v3nCM5m24MFWWOPB7eZP7nIvV+J4OIvOeiMa5UPtDbzMfh2r8Lp2HQ2kFtYcaiy1oYMc1i5GO5nKgOXeynCmNAERC0BuRh4SeXwkwTYCnQbM321TeQ57ysgUdj9JYjGT4GpxreG2XHoTdVtemlaBwXUQj/TfIKeVqJUMX/AEopaijUBEIOZZcoh2BWp7VKozeYhKOPe8CkV85nk0YosvrGBpVQJ7TVxSv+l/SSVVWgtxzEHQjY32OZ0pkkvkg7Sg5g9uORREJlo390MVw47MZDGyOkjUoL9XwvAepGCT1P0Gdg=
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<Info, Gt> Vb;
typedef CGAL::Constrained_triangulation_face_base_with_info_2<unsigned int,
Gt> Fb;
typedef CGAL::Triangulation_data_structure_2<Vb,Fb> Tds;
typedef CGAL::Constrained_Delaunay_triangulation_2<Gt, Tds> 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<Gt,Tds>.

Thank you for your help!



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

Archive powered by MHonArc 2.6.19+.

Top of Page