You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
50 lines
1.7 KiB
50 lines
1.7 KiB
// This file is part of libigl, a simple c++ geometry processing library.
|
|
//
|
|
// Copyright (C) 2013 Alec Jacobson <alecjacobson@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 "invert_diag.h"
|
|
|
|
template <typename DerivedX, typename MatY>
|
|
IGL_INLINE void igl::invert_diag(
|
|
const Eigen::SparseCompressedBase<DerivedX>& X,
|
|
MatY& Y)
|
|
{
|
|
typedef typename DerivedX::Scalar Scalar;
|
|
#ifndef NDEBUG
|
|
Eigen::SparseMatrix<Scalar> tmp = X;
|
|
Eigen::SparseVector<Scalar> dX = tmp.diagonal().sparseView();
|
|
// Check that there are no zeros along the diagonal
|
|
assert(dX.nonZeros() == dX.size());
|
|
#endif
|
|
// http://www.alecjacobson.com/weblog/?p=2552
|
|
|
|
|
|
if((void *)&Y != (void *)&X)
|
|
{
|
|
Y = X;
|
|
}
|
|
// Iterate over outside
|
|
for(int k=0; k<Y.outerSize(); ++k)
|
|
{
|
|
// Iterate over inside
|
|
for(typename MatY::InnerIterator it (Y,k); it; ++it)
|
|
{
|
|
if(it.col() == it.row())
|
|
{
|
|
Scalar v = it.value();
|
|
assert(v != 0);
|
|
v = ((Scalar)1.0)/v;
|
|
Y.coeffRef(it.row(),it.col()) = v;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#ifdef IGL_STATIC_LIBRARY
|
|
// Explicit template instantiation
|
|
template void igl::invert_diag<Eigen::SparseMatrix<double, 0, int>, Eigen::SparseMatrix<double, 0, int> >(Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int>> const&, Eigen::SparseMatrix<double, 0, int>&);
|
|
template void igl::invert_diag<Eigen::SparseMatrix<float, 0, int>, Eigen::SparseMatrix<float, 0, int> >(Eigen::SparseCompressedBase<Eigen::SparseMatrix<float, 0, int>> const&, Eigen::SparseMatrix<float, 0, int>&);
|
|
#endif
|
|
|