8#ifndef IGL_COPYLEFT_CGAL_PROJECTED_CDT_H 
    9#define IGL_COPYLEFT_CGAL_PROJECTED_CDT_H 
   10#include "../../igl_inline.h" 
   12#include <CGAL/Plane_3.h> 
   13#include <CGAL/Point_3.h> 
   14#include <CGAL/Object.h> 
   35      template <
typename Kernel, 
typename Index>
 
   37        const std::vector<CGAL::Object> & objects,
 
   38        const CGAL::Plane_3<Kernel> & P,
 
   39        std::vector<CGAL::Point_3<Kernel> >& vertices,
 
   40        std::vector<std::vector<Index> >& faces);
 
   47      template < 
typename Kernel, 
typename DerivedV, 
typename DerivedF>
 
   49        const std::vector<CGAL::Object> & objects,
 
   50        const CGAL::Plane_3<Kernel> & P,
 
   51        Eigen::PlainObjectBase<DerivedV> & V,
 
   52        Eigen::PlainObjectBase<DerivedF> & F);
 
   57#ifndef IGL_STATIC_LIBRARY 
   58#  include "projected_cdt.cpp" 
#define IGL_INLINE
Definition igl_inline.h:15
 
void projected_cdt(const std::vector< CGAL::Object > &objects, const CGAL::Plane_3< Kernel > &P, std::vector< CGAL::Point_3< Kernel > > &vertices, std::vector< std::vector< Index > > &faces)
Given a list of objects (e.g., resulting from intersecting a triangle with many other triangles),...