mirror of
https://github.com/SoftFever/OrcaSlicer.git
synced 2025-10-25 17:51:10 -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.
127 lines
4.5 KiB
C++
127 lines
4.5 KiB
C++
// This file is part of libigl, a simple c++ geometry processing library.
|
|
//
|
|
// Copyright (C) 2017 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 "sparse_cached.h"
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
#include <array>
|
|
#include <unordered_map>
|
|
#include <map>
|
|
#include <utility>
|
|
|
|
template <typename DerivedI, typename Scalar>
|
|
IGL_INLINE void igl::sparse_cached_precompute(
|
|
const Eigen::MatrixBase<DerivedI> & I,
|
|
const Eigen::MatrixBase<DerivedI> & J,
|
|
Eigen::VectorXi& data,
|
|
Eigen::SparseMatrix<Scalar>& X)
|
|
{
|
|
// Generates the triplets
|
|
std::vector<Eigen::Triplet<double> > t(I.size());
|
|
for (unsigned i = 0; i<I.size(); ++i)
|
|
t[i] = Eigen::Triplet<double>(I[i],J[i],1);
|
|
|
|
// Call the triplets version
|
|
sparse_cached_precompute(t,X,data);
|
|
}
|
|
|
|
template <typename Scalar>
|
|
IGL_INLINE void igl::sparse_cached_precompute(
|
|
const std::vector<Eigen::Triplet<Scalar> >& triplets,
|
|
Eigen::VectorXi& data,
|
|
Eigen::SparseMatrix<Scalar>& X)
|
|
{
|
|
// Construct an empty sparse matrix
|
|
X.setFromTriplets(triplets.begin(),triplets.end());
|
|
X.makeCompressed();
|
|
|
|
std::vector<std::array<int,3> > T(triplets.size());
|
|
for (unsigned i=0; i<triplets.size(); ++i)
|
|
{
|
|
T[i][0] = triplets[i].col();
|
|
T[i][1] = triplets[i].row();
|
|
T[i][2] = i;
|
|
}
|
|
|
|
std::sort(T.begin(), T.end());
|
|
|
|
data.resize(triplets.size());
|
|
|
|
int t = 0;
|
|
|
|
for (unsigned k=0; k<X.outerSize(); ++k)
|
|
{
|
|
unsigned outer_index = *(X.outerIndexPtr()+k);
|
|
unsigned next_outer_index = (k+1 == X.outerSize()) ? X.nonZeros() : *(X.outerIndexPtr()+k+1);
|
|
|
|
for (unsigned l=outer_index; l<next_outer_index; ++l)
|
|
{
|
|
int col = k;
|
|
int row = *(X.innerIndexPtr()+l);
|
|
int value_index = l;
|
|
assert(col < X.cols());
|
|
assert(col >= 0);
|
|
assert(row < X.rows());
|
|
assert(row >= 0);
|
|
assert(value_index >= 0);
|
|
assert(value_index < X.nonZeros());
|
|
|
|
std::pair<int,int> p_m = std::make_pair(row,col);
|
|
|
|
while (t<T.size() && (p_m == std::make_pair(T[t][1],T[t][0])))
|
|
data[T[t++][2]] = value_index;
|
|
}
|
|
}
|
|
assert(t==T.size());
|
|
|
|
}
|
|
|
|
template <typename Scalar>
|
|
IGL_INLINE void igl::sparse_cached(
|
|
const std::vector<Eigen::Triplet<Scalar> >& triplets,
|
|
const Eigen::VectorXi& data,
|
|
Eigen::SparseMatrix<Scalar>& X)
|
|
{
|
|
assert(triplets.size() == data.size());
|
|
|
|
// Clear it first
|
|
for (unsigned i = 0; i<data.size(); ++i)
|
|
*(X.valuePtr() + data[i]) = 0;
|
|
|
|
// Then sum them up
|
|
for (unsigned i = 0; i<triplets.size(); ++i)
|
|
*(X.valuePtr() + data[i]) += triplets[i].value();
|
|
}
|
|
|
|
template <typename DerivedV, typename Scalar>
|
|
IGL_INLINE void igl::sparse_cached(
|
|
const Eigen::MatrixBase<DerivedV>& V,
|
|
const Eigen::VectorXi& data,
|
|
Eigen::SparseMatrix<Scalar>& X)
|
|
{
|
|
assert(V.size() == data.size());
|
|
|
|
// Clear it first
|
|
for (unsigned i = 0; i<data.size(); ++i)
|
|
*(X.valuePtr() + data[i]) = 0;
|
|
|
|
// Then sum them up
|
|
for (unsigned i = 0; i<V.size(); ++i)
|
|
*(X.valuePtr() + data[i]) += V[i];
|
|
}
|
|
|
|
|
|
#ifdef IGL_STATIC_LIBRARY
|
|
#if EIGEN_VERSION_AT_LEAST(3,3,0)
|
|
template void igl::sparse_cached<double>(std::vector<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::StorageIndex>, std::allocator<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::StorageIndex> > > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1> const&, Eigen::SparseMatrix<double, 0, int>&);
|
|
template void igl::sparse_cached_precompute<double>(std::vector<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::StorageIndex>, std::allocator<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::StorageIndex> > > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&, Eigen::SparseMatrix<double, 0, int>&);
|
|
#else
|
|
template void igl::sparse_cached<double>(std::vector<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::Index>, std::allocator<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::Index> > > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1> const&, Eigen::SparseMatrix<double, 0, int>&);
|
|
template void igl::sparse_cached_precompute<double>(std::vector<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::Index>, std::allocator<Eigen::Triplet<double, Eigen::SparseMatrix<double, 0, int>::Index> > > const&, Eigen::Matrix<int, -1, 1, 0, -1, 1>&, Eigen::SparseMatrix<double, 0, int>&);
|
|
#endif
|
|
#endif
|