mirror of
https://github.com/SoftFever/OrcaSlicer.git
synced 2025-07-25 15:44:12 -06:00
2ae2672ee9
Fixing dep build script on Windows and removing some warnings. Use bundled igl by default. Not building with the dependency scripts if not explicitly stated. This way, it will stay in Fix the libigl patch to include C source files in header only mode.
274 lines
14 KiB
C++
274 lines
14 KiB
C++
// This file is part of libigl, a simple c++ geometry processing library.
|
|
//
|
|
// Copyright (C) 2018 Alec Jacobson, Marc Alexa
|
|
// Copyright (C) 2014 Daniele Panozzo <daniele.panozzo@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/.
|
|
#include "triangle_triangle_adjacency.h"
|
|
#include "vertex_triangle_adjacency.h"
|
|
#include "parallel_for.h"
|
|
#include "unique_edge_map.h"
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
|
|
// Extract the face adjacencies
|
|
template <typename DerivedF, typename TTT_type, typename DerivedTT>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency_extractTT(
|
|
const Eigen::MatrixBase<DerivedF>& F,
|
|
std::vector<std::vector<TTT_type> >& TTT,
|
|
Eigen::PlainObjectBase<DerivedTT>& TT)
|
|
{
|
|
TT.setConstant((int)(F.rows()),F.cols(),-1);
|
|
|
|
for(int i=1;i<(int)TTT.size();++i)
|
|
{
|
|
std::vector<int>& r1 = TTT[i-1];
|
|
std::vector<int>& r2 = TTT[i];
|
|
if ((r1[0] == r2[0]) && (r1[1] == r2[1]))
|
|
{
|
|
TT(r1[2],r1[3]) = r2[2];
|
|
TT(r2[2],r2[3]) = r1[2];
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename DerivedF, typename DerivedTT>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedF>& F,
|
|
Eigen::PlainObjectBase<DerivedTT>& TT)
|
|
{
|
|
const int n = F.maxCoeff()+1;
|
|
typedef Eigen::Matrix<typename DerivedTT::Scalar,Eigen::Dynamic,1> VectorXI;
|
|
VectorXI VF,NI;
|
|
vertex_triangle_adjacency(F,n,VF,NI);
|
|
TT = DerivedTT::Constant(F.rows(),3,-1);
|
|
// Loop over faces
|
|
igl::parallel_for(F.rows(),[&](int f)
|
|
{
|
|
// Loop over corners
|
|
for (int k = 0; k < 3; k++)
|
|
{
|
|
int vi = F(f,k), vin = F(f,(k+1)%3);
|
|
// Loop over face neighbors incident on this corner
|
|
for (int j = NI[vi]; j < NI[vi+1]; j++)
|
|
{
|
|
int fn = VF[j];
|
|
// Not this face
|
|
if (fn != f)
|
|
{
|
|
// Face neighbor also has [vi,vin] edge
|
|
if (F(fn,0) == vin || F(fn,1) == vin || F(fn,2) == vin)
|
|
{
|
|
TT(f,k) = fn;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
|
|
template <typename DerivedF, typename TTT_type>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency_preprocess(
|
|
const Eigen::MatrixBase<DerivedF>& F,
|
|
std::vector<std::vector<TTT_type> >& TTT)
|
|
{
|
|
for(int f=0;f<F.rows();++f)
|
|
for (int i=0;i<F.cols();++i)
|
|
{
|
|
// v1 v2 f ei
|
|
int v1 = F(f,i);
|
|
int v2 = F(f,(i+1)%F.cols());
|
|
if (v1 > v2) std::swap(v1,v2);
|
|
std::vector<int> r(4);
|
|
r[0] = v1; r[1] = v2;
|
|
r[2] = f; r[3] = i;
|
|
TTT.push_back(r);
|
|
}
|
|
std::sort(TTT.begin(),TTT.end());
|
|
}
|
|
|
|
// Extract the face adjacencies indices (needed for fast traversal)
|
|
template <typename DerivedF, typename TTT_type, typename DerivedTTi>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency_extractTTi(
|
|
const Eigen::MatrixBase<DerivedF>& F,
|
|
std::vector<std::vector<TTT_type> >& TTT,
|
|
Eigen::PlainObjectBase<DerivedTTi>& TTi)
|
|
{
|
|
TTi.setConstant((int)(F.rows()),F.cols(),-1);
|
|
|
|
for(int i=1;i<(int)TTT.size();++i)
|
|
{
|
|
std::vector<int>& r1 = TTT[i-1];
|
|
std::vector<int>& r2 = TTT[i];
|
|
if ((r1[0] == r2[0]) && (r1[1] == r2[1]))
|
|
{
|
|
TTi(r1[2],r1[3]) = r2[3];
|
|
TTi(r2[2],r2[3]) = r1[3];
|
|
}
|
|
}
|
|
}
|
|
|
|
// Compute triangle-triangle adjacency with indices
|
|
template <typename DerivedF, typename DerivedTT, typename DerivedTTi>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedF>& F,
|
|
Eigen::PlainObjectBase<DerivedTT>& TT,
|
|
Eigen::PlainObjectBase<DerivedTTi>& TTi)
|
|
{
|
|
triangle_triangle_adjacency(F,TT);
|
|
TTi = DerivedTTi::Constant(TT.rows(),TT.cols(),-1);
|
|
//for(int f = 0; f<F.rows(); f++)
|
|
igl::parallel_for(F.rows(),[&](int f)
|
|
{
|
|
for(int k = 0;k<3;k++)
|
|
{
|
|
int vi = F(f,k), vj = F(f,(k+1)%3);
|
|
int fn = TT(f,k);
|
|
if(fn >= 0)
|
|
{
|
|
for(int kn = 0;kn<3;kn++)
|
|
{
|
|
int vin = F(fn,kn), vjn = F(fn,(kn+1)%3);
|
|
if(vi == vjn && vin == vj)
|
|
{
|
|
TTi(f,k) = kn;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
|
|
template <
|
|
typename DerivedF,
|
|
typename TTIndex,
|
|
typename TTiIndex>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
|
std::vector<std::vector<std::vector<TTIndex> > > & TT,
|
|
std::vector<std::vector<std::vector<TTiIndex> > > & TTi)
|
|
{
|
|
return triangle_triangle_adjacency(F,true,TT,TTi);
|
|
}
|
|
|
|
template <
|
|
typename DerivedF,
|
|
typename TTIndex>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
|
std::vector<std::vector<std::vector<TTIndex> > > & TT)
|
|
{
|
|
std::vector<std::vector<std::vector<TTIndex> > > not_used;
|
|
return triangle_triangle_adjacency(F,false,TT,not_used);
|
|
}
|
|
|
|
template <
|
|
typename DerivedF,
|
|
typename TTIndex,
|
|
typename TTiIndex>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
|
const bool construct_TTi,
|
|
std::vector<std::vector<std::vector<TTIndex> > > & TT,
|
|
std::vector<std::vector<std::vector<TTiIndex> > > & TTi)
|
|
{
|
|
using namespace Eigen;
|
|
using namespace std;
|
|
assert(F.cols() == 3 && "Faces must be triangles");
|
|
// number of faces
|
|
typedef typename DerivedF::Index Index;
|
|
typedef Matrix<typename DerivedF::Scalar,Dynamic,2> MatrixX2I;
|
|
typedef Matrix<typename DerivedF::Index,Dynamic,1> VectorXI;
|
|
MatrixX2I E,uE;
|
|
VectorXI EMAP;
|
|
vector<vector<Index> > uE2E;
|
|
unique_edge_map(F,E,uE,EMAP,uE2E);
|
|
return triangle_triangle_adjacency(E,EMAP,uE2E,construct_TTi,TT,TTi);
|
|
}
|
|
|
|
template <
|
|
typename DerivedE,
|
|
typename DerivedEMAP,
|
|
typename uE2EType,
|
|
typename TTIndex,
|
|
typename TTiIndex>
|
|
IGL_INLINE void igl::triangle_triangle_adjacency(
|
|
const Eigen::MatrixBase<DerivedE> & E,
|
|
const Eigen::MatrixBase<DerivedEMAP> & EMAP,
|
|
const std::vector<std::vector<uE2EType> > & uE2E,
|
|
const bool construct_TTi,
|
|
std::vector<std::vector<std::vector<TTIndex> > > & TT,
|
|
std::vector<std::vector<std::vector<TTiIndex> > > & TTi)
|
|
{
|
|
using namespace std;
|
|
using namespace Eigen;
|
|
typedef typename DerivedE::Index Index;
|
|
const size_t m = E.rows()/3;
|
|
assert((size_t)E.rows() == m*3 && "E should come from list of triangles.");
|
|
// E2E[i] --> {j,k,...} means face edge i corresponds to other faces edges j
|
|
// and k
|
|
TT.resize (m,vector<vector<TTIndex> >(3));
|
|
if(construct_TTi)
|
|
{
|
|
TTi.resize(m,vector<vector<TTiIndex> >(3));
|
|
}
|
|
|
|
// No race conditions because TT*[f][c]'s are in bijection with e's
|
|
// Minimum number of items per thread
|
|
//const size_t num_e = E.rows();
|
|
// Slightly better memory access than loop over E
|
|
igl::parallel_for(
|
|
m,
|
|
[&](const Index & f)
|
|
{
|
|
for(Index c = 0;c<3;c++)
|
|
{
|
|
const Index e = f + m*c;
|
|
//const Index c = e/m;
|
|
const vector<uE2EType> & N = uE2E[EMAP(e)];
|
|
for(const auto & ne : N)
|
|
{
|
|
const Index nf = ne%m;
|
|
// don't add self
|
|
if(nf != f)
|
|
{
|
|
TT[f][c].push_back(nf);
|
|
if(construct_TTi)
|
|
{
|
|
const Index nc = ne/m;
|
|
TTi[f][c].push_back(nc);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
},
|
|
1000ul);
|
|
|
|
|
|
}
|
|
|
|
#ifdef IGL_STATIC_LIBRARY
|
|
// Explicit template instantiation
|
|
// generated by autoexplicit.sh
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);
|
|
// generated by autoexplicit.sh
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, 3, 0, -1, 3>, int>(Eigen::MatrixBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, std::vector<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, std::allocator<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > > >&);
|
|
// generated by autoexplicit.sh
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);
|
|
// generated by autoexplicit.sh
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&);
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> >&);
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> >&);
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, -1, 0, -1, -1>, long, long>(Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, std::vector<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > >, std::allocator<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > > > >&, std::vector<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > >, std::allocator<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > > > >&);
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, -1, 0, -1, -1>, int>(Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, std::vector<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, std::allocator<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > > >&);
|
|
#ifdef WIN32
|
|
template void igl::triangle_triangle_adjacency<class Eigen::Matrix<int, -1, -1, 0, -1, -1>, __int64, __int64>(class Eigen::MatrixBase<class Eigen::Matrix<int, -1, -1, 0, -1, -1>> const &, class std::vector<class std::vector<class std::vector<__int64, class std::allocator<__int64>>, class std::allocator<class std::vector<__int64, class std::allocator<__int64>>>>, class std::allocator<class std::vector<class std::vector<__int64, class std::allocator<__int64>>, class std::allocator<class std::vector<__int64, class std::allocator<__int64>>>>>> &, class std::vector<class std::vector<class std::vector<__int64, class std::allocator<__int64>>, class std::allocator<class std::vector<__int64, class std::allocator<__int64>>>>, class std::allocator<class std::vector<class std::vector<__int64, class std::allocator<__int64>>, class std::allocator<class std::vector<__int64, class std::allocator<__int64>>>>>> &);
|
|
template void igl::triangle_triangle_adjacency<class Eigen::Matrix<int, -1, -1, 0, -1, -1>, class Eigen::Matrix<int, -1, 1, 0, -1, 1>, unsigned __int64, int, int>(class Eigen::MatrixBase<class Eigen::Matrix<int, -1, -1, 0, -1, -1>> const &, class Eigen::MatrixBase<class Eigen::Matrix<int, -1, 1, 0, -1, 1>> const &, class std::vector<class std::vector<unsigned __int64, class std::allocator<unsigned __int64>>, class std::allocator<class std::vector<unsigned __int64, class std::allocator<unsigned __int64>>>> const &, bool, class std::vector<class std::vector<class std::vector<int, class std::allocator<int>>, class std::allocator<class std::vector<int, class std::allocator<int>>>>, class std::allocator<class std::vector<class std::vector<int, class std::allocator<int>>, class std::allocator<class std::vector<int, class std::allocator<int>>>>>> &, class std::vector<class std::vector<class std::vector<int, class std::allocator<int>>, class std::allocator<class std::vector<int, class std::allocator<int>>>>, class std::allocator<class std::vector<class std::vector<int, class std::allocator<int>>, class std::allocator<class std::vector<int, class std::allocator<int>>>>>> &);
|
|
#endif
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, 2, 0, -1, 2>, Eigen::Matrix<long, -1, 1, 0, -1, 1>, long, long, long>(Eigen::MatrixBase<Eigen::Matrix<int, -1, 2, 0, -1, 2> > const&, Eigen::MatrixBase<Eigen::Matrix<long, -1, 1, 0, -1, 1> > const&, std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > > const&, bool, std::vector<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > >, std::allocator<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > > > >&, std::vector<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > >, std::allocator<std::vector<std::vector<long, std::allocator<long> >, std::allocator<std::vector<long, std::allocator<long> > > > > >&);
|
|
template void igl::triangle_triangle_adjacency<Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, 1, 0, -1, 1>, unsigned long, int, int>(Eigen::MatrixBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::MatrixBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > const&, std::vector<std::vector<unsigned long, std::allocator<unsigned long> >, std::allocator<std::vector<unsigned long, std::allocator<unsigned long> > > > const&, bool, std::vector<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, std::allocator<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > > >&, std::vector<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > >, std::allocator<std::vector<std::vector<int, std::allocator<int> >, std::allocator<std::vector<int, std::allocator<int> > > > > >&);
|
|
#endif
|