Skip to Content.
Sympa Menu

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

Subject: CGAL users discussion list

List archive

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


Chronological Thread 
  • From: Sebastien Loriot <>
  • To:
  • Subject: Re: [cgal-discuss] Iterate over edges of a Delaunay triangulation and get adjacent faces
  • Date: Thu, 10 Dec 2020 14:41:17 +0100
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:gfdTxxSDlNbAEOb92uugSIL4ktpsv+yvbD5Q0YIujvd0So/mwa6zYRON2/xhgRfzUJnB7Loc0qyK6v+mADxYqszd+Fk5M7V0HycfjssXmwFySOWkMmbcaMDQUiohAc5ZX0Vk9XzoeWJcGcL5ekGA6ibqtW1aFRrwLxd6KfroEYDOkcu3y/qy+5rOaAlUmTaxe7x/IAi0oAnLq8UbgpduJqkvxhbGv3BFZ/lYyWR0KFyJgh3y/N2w/Jlt8yRRv/Iu6ctNWrjkcqo7ULJVEi0oP3g668P3uxbDSxCP5mYHXWUNjhVIGQnF4wrkUZr3ryD3q/By2CiePc3xULA0RTGv5LplRRP0lCsKMSMy/WfKgcJyka1bugqsqQFhzY7aYI+bN/Rwca3SctwYWWVPUd1cVzBDD46mc4cDE+QMMOReooLgp1UOtxy+BQy0Ce3y1DBHnWX53bYm0+QgDw7G2hErEdQJsHTOrdX1M7sSWv2ywanTyTXDaOlW2Tb66IjUaBwhpPWMUKl/ccrU00YvFgfFgk+MpoziOjOYz+IAuHWU4OR8T+ygkXInqx1vrTi1wMchkpTEi4EbxF7E+it0wog4KMC6RUN7btOoDIZduz2VOoZqXM8sQ2FmtSg0x7AbtpC2YTUGxYglyhPRa/GKb4aG7xzlWe2MLzl4g3dld6i+hxa06UWgxez8VtW00FZXtSVJiMXDtncI1xDL7MiIUOBy8Vyl2TmRzQzc9uZEIUUymKHGKJAh2qY9moQPvUnHBCP7m0X7gLWIekk65+Sk8eXqb7f+qpOCLYB4lhzyP6EwlcCjG+s1NxYCU3SG9em52rDs51P1TKlPg/A0iabUs5LXKMEFqaO3AwJV3IMu5AijAzi6ytsVmHcHI0xbdx+DiYXiJkvAL+riDfilhlShiDdryO7CPr3mGpjNK2LMkLblfbpk5U9c0hc/wclR559VCLwNOv3zWkj2tNzXCh82LRa4zPrgCNV4zo8eWGSPDbGFMK7Kr1OE+uYiL/OPaYIVojrxNeYp6+P0gXI4m1IRZayp0oEWaHC8EPRmOUKZYX/0j9caFWcKuRA+TO3tiF2eSzJTYnKyUrkz5jE+Eo2mDIPDSpqxj7yG2Se3BodWaXxeClCQDXfocJ2JVOsDaC2IJs9tiyELVbm6S4A9yBGurxT6xqF8LuvU/y0YrYjs2MJ05+3VjxEy9CZ7A96T02GXHClImTYDSDYymax+ukdg0Uyr0K5igvUeG8YAyelOV1IBOJTV1PB7Bta6fgXbf9CVAAK9RtK8ADYtCNc169ALakd5Xd6li0aQjGKRH7YJmunTV9QP+aXG0i2pfpov+zP9zKAkymIebI5XL2T/3/xw8gHSA8jClEDLz//7J5RZ5zbE8SK49UTLuUhZVABqVqCcBCIQY0LXqZLy4UaQFubzW4RiCRNIzIu5EoUPatDtig8bFvLqOdCbfHjo3mnuWlCHwbSDaIescGIYjn3Q

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/




Archive powered by MHonArc 2.6.19+.

Top of Page