95 lines
3.3 KiB
C
95 lines
3.3 KiB
C
|
// This file is part of libigl, a simple c++ geometry processing library.
|
||
|
|
//
|
||
|
|
// Copyright (C) 2015 Qingnan Zhou <qnzhou@gmail.com>
|
||
|
|
//
|
||
|
|
// This Source Code Form is subject to the terms of the Mozilla Public License
|
||
|
|
// v. 2.0. If a copy of the MPL was not distributed with this file, You can
|
||
|
|
// obtain one at http://mozilla.org/MPL/2.0/.
|
||
|
|
//
|
||
|
|
#ifndef IGL_COPYLEFT_CGAL_REMESH_INTERSECTIONS_H
|
||
|
|
#define IGL_COPYLEFT_CGAL_REMESH_INTERSECTIONS_H
|
||
|
|
|
||
|
|
#include "../../igl_inline.h"
|
||
|
|
#include <Eigen/Dense>
|
||
|
|
#include "CGAL_includes.hpp"
|
||
|
|
|
||
|
|
namespace igl
|
||
|
|
{
|
||
|
|
namespace copyleft
|
||
|
|
{
|
||
|
|
namespace cgal
|
||
|
|
{
|
||
|
|
// Remesh faces according to results of intersection detection and
|
||
|
|
// construction (e.g. from `igl::copyleft::cgal::intersect_other` or
|
||
|
|
// `igl::copyleft::cgal::SelfIntersectMesh`)
|
||
|
|
//
|
||
|
|
// Inputs:
|
||
|
|
// V #V by 3 list of vertex positions
|
||
|
|
// F #F by 3 list of triangle indices into V
|
||
|
|
// T #F list of cgal triangles
|
||
|
|
// offending #offending map taking face indices into F to pairs of order
|
||
|
|
// of first finding and list of intersection objects from all
|
||
|
|
// intersections
|
||
|
|
// stitch_all if true, merge all vertices with the same coordinate.
|
||
|
|
// Outputs:
|
||
|
|
// VV #VV by 3 list of vertex positions, if stitch_all = false then
|
||
|
|
// first #V vertices will always be V
|
||
|
|
// FF #FF by 3 list of triangle indices into V
|
||
|
|
// IF #intersecting face pairs by 2 list of intersecting face pairs,
|
||
|
|
// indexing F
|
||
|
|
// J #FF list of indices into F denoting birth triangle
|
||
|
|
// IM / stitch_all = true #VV list from 0 to #VV-1
|
||
|
|
// \ stitch_all = false #VV list of indices into VV of unique vertices.
|
||
|
|
//
|
||
|
|
template <
|
||
|
|
typename DerivedV,
|
||
|
|
typename DerivedF,
|
||
|
|
typename Kernel,
|
||
|
|
typename DerivedVV,
|
||
|
|
typename DerivedFF,
|
||
|
|
typename DerivedJ,
|
||
|
|
typename DerivedIM>
|
||
|
|
IGL_INLINE void remesh_intersections(
|
||
|
|
const Eigen::MatrixBase<DerivedV> & V,
|
||
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
||
|
|
const std::vector<CGAL::Triangle_3<Kernel> > & T,
|
||
|
|
const std::map<
|
||
|
|
typename DerivedF::Index,
|
||
|
|
std::vector<
|
||
|
|
std::pair<typename DerivedF::Index, CGAL::Object> > > & offending,
|
||
|
|
bool stitch_all,
|
||
|
|
Eigen::PlainObjectBase<DerivedVV> & VV,
|
||
|
|
Eigen::PlainObjectBase<DerivedFF> & FF,
|
||
|
|
Eigen::PlainObjectBase<DerivedJ> & J,
|
||
|
|
Eigen::PlainObjectBase<DerivedIM> & IM);
|
||
|
|
// Same as above except stitch_all is assumed "false"
|
||
|
|
template <
|
||
|
|
typename DerivedV,
|
||
|
|
typename DerivedF,
|
||
|
|
typename Kernel,
|
||
|
|
typename DerivedVV,
|
||
|
|
typename DerivedFF,
|
||
|
|
typename DerivedJ,
|
||
|
|
typename DerivedIM>
|
||
|
|
IGL_INLINE void remesh_intersections(
|
||
|
|
const Eigen::MatrixBase<DerivedV> & V,
|
||
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
||
|
|
const std::vector<CGAL::Triangle_3<Kernel> > & T,
|
||
|
|
const std::map<
|
||
|
|
typename DerivedF::Index,
|
||
|
|
std::vector<
|
||
|
|
std::pair<typename DerivedF::Index, CGAL::Object> > > & offending,
|
||
|
|
Eigen::PlainObjectBase<DerivedVV> & VV,
|
||
|
|
Eigen::PlainObjectBase<DerivedFF> & FF,
|
||
|
|
Eigen::PlainObjectBase<DerivedJ> & J,
|
||
|
|
Eigen::PlainObjectBase<DerivedIM> & IM);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#ifndef IGL_STATIC_LIBRARY
|
||
|
|
# include "remesh_intersections.cpp"
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif
|