libigl_Martin/include/igl/copyleft/cgal/resolve_intersections.h

#ifndef IGL_COPYLEFT_CGAL_RESOLVE_INTERSECTIONS_H
#define IGL_COPYLEFT_CGAL_RESOLVE_INTERSECTIONS_H
#include <igl/igl_inline.h>
#include <Eigen/Core>

namespace igl
{
  namespace copyleft
  {
    // RESOLVE_INTERSECTIONS Given a list of possible intersecting segments with
    // endpoints, split segments to overlap only at endpoints
    //
    // Inputs:
    //   V  #V by 2 list of vertex positions
    //   E  #E by 2 list of segment indices into V
    // Outputs:
    //   VI  #VI by 2 list of output vertex positions, copies of V are always
    //     the first #V vertices
    //   EI  #EI by 2 list of segment indices into V, #EI ≥ #E
    //   J  #EI list of indices into E revealing "parent segments"
    //   IM  #VI list of indices into VV of unique vertices.
    namespace cgal
    {
      template <
        typename DerivedV, 
        typename DerivedE, 
        typename DerivedVI, 
        typename DerivedEI,
        typename DerivedJ,
        typename DerivedIM>
      IGL_INLINE void resolve_intersections(
        const Eigen::PlainObjectBase<DerivedV> & V,
        const Eigen::PlainObjectBase<DerivedE> & E,
        Eigen::PlainObjectBase<DerivedVI> & VI,
        Eigen::PlainObjectBase<DerivedEI> & EI,
        Eigen::PlainObjectBase<DerivedJ> & J,
        Eigen::PlainObjectBase<DerivedIM> & IM);
    }
  }
}
#ifndef IGL_STATIC_LIBRARY
#  include "resolve_intersections.cpp"
#endif
#endif