8#ifndef IGL_COPYLEFT_CGAL_PROJECTED_DELAUNAY_H
9#define IGL_COPYLEFT_CGAL_PROJECTED_DELAUNAY_H
10#include "../../igl_inline.h"
11#include "CGAL_includes.hpp"
27 template <
typename Kernel>
29 const CGAL::Triangle_3<Kernel> & A,
30 const std::vector<CGAL::Object> & A_objects_3,
31 CGAL::Constrained_triangulation_plus_2<
32 CGAL::Constrained_Delaunay_triangulation_2<
34 CGAL::Triangulation_data_structure_2<
35 CGAL::Triangulation_vertex_base_2<Kernel>,
36 CGAL::Constrained_triangulation_face_base_2<Kernel> >,
37 CGAL::Exact_intersections_tag> > & cdt);
41#ifndef IGL_STATIC_LIBRARY
42# include "projected_delaunay.cpp"
#define IGL_INLINE
Definition igl_inline.h:15
void projected_delaunay(const CGAL::Triangle_3< Kernel > &A, const std::vector< CGAL::Object > &A_objects_3, CGAL::Constrained_triangulation_plus_2< CGAL::Constrained_Delaunay_triangulation_2< Kernel, CGAL::Triangulation_data_structure_2< CGAL::Triangulation_vertex_base_2< Kernel >, CGAL::Constrained_triangulation_face_base_2< Kernel > >, CGAL::Exact_intersections_tag > > &cdt)
Compute 2D delaunay triangulation of a given 3d triangle and a list of intersection objects (points,...