Subject: CGAL users discussion list
List archive
Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces
Chronological Thread
- From: Andreas Fabri <>
- To: "Sebastien Loriot ( via cgal-discuss Mailing List)" <>
- Subject: Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces
- Date: Thu, 10 Dec 2020 14:44:29 +0100
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=None ; spf=None
- Ironport-phdr: 9a23:oIDSOhY06r7bhRtp/yfXgfD/LSx+4OfEezUN459isYplN5qZps6zZh7h7PlgxGXEQZ/co6odzbaP7Oa5CTRLu8rJmUtBWaQEbwUCh8QSkl5oK+++Imq/EsTXaTcnFt9JTl5v8iLzG0FUHMHjew+a+SXqvnYdFRrlKAV6OPn+FJLMgMSrzeCy/IDYbxlViDanbr5+MRe7oR/MusQVnYduJbg9xxTUqXZUZupawn9lK0iOlBjm/Mew+5Bj8yVUu/0/8sNLTLv3caclQ7FGFToqK2866tHluhnFVguP+2ATUn4KnRpSAgjK9w/1U5HsuSbnrOV92S2aPcrrTbAoXDmp8qlmRAP0hCoBKjU063/chNBug61HoRKhvx1/zJDSYIGJL/p1Y6fRccoHSWZdQspdUipMCZ6+YYQSFeoMJftWoZfzp1UOrhWwCwejC+ztxTBUiXH7xrE63uc7HA3awAAtEdADvXLJp9v1LqcSVuW1wbHUwDXFcvxWwyny55LTchs8of+DR6l/cdDQyUIyEA7KlFOQppH/PzyLzOsNqHKX7+R6Wu20kW4nqhp8ojexyccrj4nGmJ4VykrE9CV32ok6OcG4SElhYd+kCpdfqyaaN45vT84kXmpntzo0xKcctp6nYCgF1o4nxxjHZvGbboSF4hLuWeafLDpmmX9pZLyyiwq9/0S+yeDwS8e53UtXoyZYktTBtGwA2hzN5sWbS/Zw4kms1zaP2Q3Q6uxJJ10/m6TcK54k2LEwl5wTvFzMHi/3hEX2jLKWeV4+9ue07OTnZ63qppmGOIBvkQ7+NrohltajDuQ/NwgDWXWQ9+ek1LD78kD0Qa9GguAqnqTZqpzXKtkXqrSkDwJa04sv8xKyAyu83NgFgHUKLUhJdAyHgoT0IV3CPe70APWnj1iwijtn2+rKMqH7DpnRKHXIjansfbJg605H1Ao808pf6Y9VCrAAPv3+QlP9udrFBREjKQO02fzoCNBl24MeR22PBqiZPbvPvVOS4+IvJOiBaYwPtDb4Mfcl5vrugWY+mV8AYamlx5wXaG64Hvh8JUWWf2bsjs8AEWcMoAU+UPTnhVKDXDJJenq+Q6Ix6is0BY67F4vPW4+gjb2Z0Ce+BJJWZ2RGCl6WEXfvcoWJQ+0DaCSPLc97jDMLT6OhR5Uv1R60rwD60btnI/Hb+iIGspLj0cZ65/HJlRAy+zx7FdiS032KT2FunmIEXSM53Kd6oUBl0FeMzbB4g+BEFdxU//5GTgg6OoTYz+BjFt/yWxnBccuUSFa9WdWrGioxT9I0w98WeUlxAdSijhbZ3yqrGbAZjbKLBIYs/qLZ2Hj+Othyxm7d1Kkkk1kmWtJDNWq7hq5j7wTTB5DGk0Gel6uybaQc2DTC9WedwmqUvkxUTQ19Xb/FXX8FfEfWqsr55kPYQ7+oF7snLhNNyc+EKqRUdt3klUlKSO3/NNjEf269gXu8CQ6SxryQdIrqZ3kd3CLFBUcYnAAc53KGOREjCSeguGLRECFuFUn0Y0738Ol+rmm7Tk4uwA2QYU1hzen9xhlAz8eRQfoIwrMJvm8FrC91G0r1n8nSDMCBoBYneaF0btY04VMB3mXc/xJ8N9SrIKlmw1IfaA9qpFim8hx2DoRGnoAOrWg2jUA6famX2VcEezKD1o3rIZXWLHPz9VahcfiF9EvZ1YO//KsV5f0j43vqthuoXh4r9Xl93tBOlXWV7I/LJAUfVpf8Tlwm+RFxu7bAc2824IaChi4kCrW9rjKXg4FhP+Ai0Bv1Oo4HaPrZRj+3KNUTAo2VEMJvm1WtaUhZbrkU8alqb4WjfvqCnam2IKBngjLgi2lbstgkjhC8shFkQ+uN5K4rhumC11HeBTjxi1Ksrtrml4lPeTYIDyy0zi22XNcANJ03Rp4CDCKVG+Pyw9x/g5D3XHsCrQysClQD1dOzaBSbZED6xxwW3kMS8ySq
gist.github.com
On 12/10/2020 2:41 PM, Sebastien Loriot ( via cgal-discuss Mailing List) wrote:
Did you include--
#include <CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h>
?
If yes, could you please post a complete example we could compile to reproduce the error?
You can use git.github.com to post the code.
Best,
Sebastien.
On 12/10/20 2:25 PM, "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<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/
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project
- [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces, coz.mars123, 12/10/2020
- Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces, Sebastien Loriot, 12/10/2020
- Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces, Andreas Fabri, 12/10/2020
- Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces, coz.mars123, 12/23/2020
- Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces, Sebastien Loriot, 12/10/2020
Archive powered by MHonArc 2.6.19+.