mirror of
https://github.com/QIDITECH/QIDISlicer.git
synced 2026-02-06 02:41:52 +03:00
update bundled_deps
This commit is contained in:
43
bundled_deps/libigl/igl/orth.h
Normal file
43
bundled_deps/libigl/igl/orth.h
Normal file
@@ -0,0 +1,43 @@
|
||||
// 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/.
|
||||
#ifndef IGL_ORTH_H
|
||||
#define IGL_ORTH_H
|
||||
|
||||
#include "igl_inline.h"
|
||||
#include <Eigen/Dense>
|
||||
|
||||
namespace igl
|
||||
{
|
||||
// ORTH Orthogonalization.
|
||||
// ORTH(A,Q) produces Q as an orthonormal basis for the range of A.
|
||||
// That is, Q'*Q = I, the columns of Q span the same space as
|
||||
// the columns of A, and the number of columns of Q is the
|
||||
// rank of A.
|
||||
//
|
||||
//
|
||||
// The algorithm uses singular value decomposition, SVD, instead of orthogonal
|
||||
// factorization, QR. This doubles the computation time, but
|
||||
// provides more reliable and consistent rank determination.
|
||||
// Closely follows MATLAB implementation in orth.m
|
||||
//
|
||||
// Inputs:
|
||||
// A m by n matrix
|
||||
// Outputs:
|
||||
// Q m by n matrix with orthonormal columns spanning same column space as
|
||||
// A
|
||||
//
|
||||
// Known bugs: Implementation listed as "Broken"
|
||||
IGL_INLINE void orth(const Eigen::MatrixXd &A, Eigen::MatrixXd &Q);
|
||||
}
|
||||
|
||||
|
||||
#ifndef IGL_STATIC_LIBRARY
|
||||
# include "orth.cpp"
|
||||
#endif
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user