2D Delaunay triangulation in CGAL using an arbitrary plane -

i new using cgal, , wondering if cgal supports 2d delaunay triangulation of 3d points using arbitrary plane. example on cgal's documentation lists projection_traits_xy_3<r>, projection_traits_yz_3<r>, , projection_traits_xz_3<r>, in other words, projection on xy plane, yz plane , xz plane. there way can define arbitrary projection plane instead of using xy, yz , xz planes?

thanks,

there template < class kernel > class triangulation_2_filtered_projection_traits_3 not documented , defined in header: cgal/triangulation_2_filtered_projection_traits_3.h.

you construct traits class plane normal , pass traits triangulation.

something following should work:

 typedef cgal::exact_predicates_inexact_constructions_kernel k;  typedef cgal::triangulation_2_filtered_projection_traits_3<k> p_traits;  typedef cgal::delaunay_triangulation_2< p_traits > dt2;  std::vector< k::point_3 > points  p_traits traits( k::vector_3(1,1,1) );  dt2 dt2(traits);  dt2.insert(points.begin(), points.end());