/**************************************************************************** * VCGLib o o * * Visual and Computer Graphics Library o o * * _ O _ * * Copyright(C) 2004 \/)\/ * * Visual Computing Lab /\/| * * ISTI - Italian National Research Council | * * \ * * All rights reserved. * * * * This program is free software; you can redistribute it and/or modify * * it under the terms of the GNU General Public License as published by * * the Free Software Foundation; either version 2 of the License, or * * (at your option) any later version. * * * * This program is distributed in the hope that it will be useful, * * but WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * * GNU General Public License (http://www.gnu.org/licenses/gpl.txt) * * for more details. * * * ****************************************************************************/ #ifndef EIGEN_VCGLIB #define EIGEN_VCGLIB // TODO enable the vectorization // #define EIGEN_DONT_VECTORIZE #define EIGEN_MATRIXBASE_PLUGIN #define EIGEN_MATRIX_PLUGIN // forward declarations namespace Eigen { template struct ei_traits; template struct ei_is_same_type; template struct ei_lexi_comparison; template::ret, bool SameSize = Derived1::SizeAtCompileTime==Derived2::SizeAtCompileTime> struct ei_import_selector; template::RowsAtCompileTime, int Cols = ei_traits::ColsAtCompileTime, int StorageOrder = ei_traits::Flags&1, int MRows = ei_traits::MaxRowsAtCompileTime, int MCols = ei_traits::MaxColsAtCompileTime> struct ei_to_vcgtype; } #include "base.h" #include "../../eigenlib/Eigen/LU" #include "../../eigenlib/Eigen/Geometry" #include "../../eigenlib/Eigen/Array" #include "../../eigenlib/Eigen/Core" // add support for unsigned char and short int namespace Eigen { template<> struct NumTraits { typedef unsigned char Real; typedef float FloatingPoint; enum { IsComplex = 0, HasFloatingPoint = 0, ReadCost = 1, AddCost = 1, MulCost = 1 }; }; template<> struct NumTraits { typedef short int Real; typedef float FloatingPoint; enum { IsComplex = 0, HasFloatingPoint = 0, ReadCost = 1, AddCost = 1, MulCost = 1 }; }; // WARNING this is a default version provided so that Intersection() stuff can compile. // Indeed, the compiler try to instanciate all versions of Intersection() leading to // the instanciation of Eigen::Matrix !!! template struct NumTraits { struct wrong_type { wrong_type() { assert(0 && "Eigen: you are using a wrong scalar type" ); } }; typedef wrong_type Real; typedef wrong_type FloatingPoint; enum { IsComplex = 0, HasFloatingPoint = 0, ReadCost = 0, AddCost = 0, MulCost = 0 }; }; // implementation of Lexicographic order comparison // TODO should use meta unrollers template struct ei_lexi_comparison { inline static bool less(const Derived1& a, const Derived2& b) { return (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0) b.coeff(1)) : (a.coeff(0)>b.coeff(0)); } inline static bool lessEqual(const Derived1& a, const Derived2& b) { return (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0)<=b.coeff(0)); } inline static bool greaterEqual(const Derived1& a, const Derived2& b) { return (a.coeff(1)!=b.coeff(1))?(a.coeff(1)> b.coeff(1)) : (a.coeff(0)>=b.coeff(0)); } }; template struct ei_lexi_comparison { inline static bool less(const Derived1& a, const Derived2& b) { return (a.coeff(2)!=b.coeff(2))?(a.coeff(2)< b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0) b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)> b.coeff(1)) : (a.coeff(0)>b.coeff(0)); } inline static bool lessEqual(const Derived1& a, const Derived2& b) { return (a.coeff(2)!=b.coeff(2))?(a.coeff(2)< b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0)<=b.coeff(0)); } inline static bool greaterEqual(const Derived1& a, const Derived2& b) { return (a.coeff(2)!=b.coeff(2))?(a.coeff(2)> b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)> b.coeff(1)) : (a.coeff(0)>=b.coeff(0)); } }; template struct ei_lexi_comparison { inline static bool less(const Derived1& a, const Derived2& b) { return (a.coeff(3)!=b.coeff(3))?(a.coeff(3)< b.coeff(3)) : (a.coeff(2)!=b.coeff(2))?(a.coeff(2)< b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0) b.coeff(3)) : (a.coeff(2)!=b.coeff(2))?(a.coeff(2)> b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)> b.coeff(1)) : (a.coeff(0)>b.coeff(0)); } inline static bool lessEqual(const Derived1& a, const Derived2& b) { return (a.coeff(3)!=b.coeff(3))?(a.coeff(3)< b.coeff(3)) : (a.coeff(2)!=b.coeff(2))?(a.coeff(2)< b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)< b.coeff(1)) : (a.coeff(0)<=b.coeff(0)); } inline static bool greaterEqual(const Derived1& a, const Derived2& b) { return (a.coeff(3)!=b.coeff(3))?(a.coeff(3)> b.coeff(3)) : (a.coeff(2)!=b.coeff(2))?(a.coeff(2)> b.coeff(2)): (a.coeff(1)!=b.coeff(1))?(a.coeff(1)> b.coeff(1)) : (a.coeff(0)>=b.coeff(0)); } }; // implementation of Import template struct ei_import_selector { static void run(Derived1& a, const Derived2& b) { a = b; } }; template struct ei_import_selector { static void run(Derived1& a, const Derived2& b) { a = b.template cast(); } }; template struct ei_import_selector { static void run(Derived1& a, const Derived2& b) { EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived1); EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived1); EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived2); EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived2); enum { Size1 = Derived1::SizeAtCompileTime, Size2 = Derived2::SizeAtCompileTime }; assert(Size1<=4 && Size2<=4); a.coeffRef(0) = Scalar(b.coeff(0)); if (Size1>1) { if (Size2>1) a.coeffRef(1) = Scalar(b.coeff(1)); else a.coeffRef(1) = 0; } if (Size1>2) { if (Size2>2) a.coeffRef(2) = Scalar(b.coeff(2)); else a.coeffRef(2) = 0; } if (Size1>3) { if (Size2>3) a.coeffRef(3) = Scalar(b.coeff(3)); else a.coeffRef(3) = 0; } } }; // default implementation of ei_to_vcgtype // the specialization are with template struct ei_to_vcgtype { typedef Matrix type; }; } #define VCG_EIGEN_INHERIT_ASSIGNMENT_OPERATOR(Derived, Op) \ template \ Derived& operator Op(const Eigen::MatrixBase& other) \ { \ Base::operator Op(other.derived()); return *this;\ } \ Derived& operator Op(const Derived& other) \ { \ Base::operator Op(other); return *this;\ } #define VCG_EIGEN_INHERIT_SCALAR_ASSIGNMENT_OPERATOR(Derived, Op) \ template \ Derived& operator Op(const Other& scalar) \ { \ Base::operator Op(scalar); return *this;\ } #define VCG_EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Derived) \ VCG_EIGEN_INHERIT_ASSIGNMENT_OPERATOR(Derived, =) \ VCG_EIGEN_INHERIT_ASSIGNMENT_OPERATOR(Derived, +=) \ VCG_EIGEN_INHERIT_ASSIGNMENT_OPERATOR(Derived, -=) \ VCG_EIGEN_INHERIT_SCALAR_ASSIGNMENT_OPERATOR(Derived, *=) \ VCG_EIGEN_INHERIT_SCALAR_ASSIGNMENT_OPERATOR(Derived, /=) namespace vcg { template typename Eigen::ei_traits::Scalar Angle(const Eigen::MatrixBase& p1, const Eigen::MatrixBase & p2) { EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived1) EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived2) EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived1) EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived2) EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(Derived1,Derived2) typedef typename Eigen::ei_traits::Scalar Scalar; Scalar w = p1.norm()*p2.norm(); if(w==0) return Scalar(-1); Scalar t = (p1.dot(p2))/w; if(t>1) t = 1; else if(t<-1) t = -1; return vcg::math::Acos(t); } template typename Eigen::ei_traits::Scalar AngleN(const Eigen::MatrixBase& p1, const Eigen::MatrixBase & p2) { EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived1) EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived2) EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived1) EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived2) EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(Derived1,Derived2) typedef typename Eigen::ei_traits::Scalar Scalar; Scalar t = (p1.dot(p2)); if(t>1) t = 1; else if(t<-1) t = -1; return vcg::math::Acos(t); } template inline typename Eigen::ei_traits::Scalar Norm( const Eigen::MatrixBase& p) { return p.norm(); } template inline typename Eigen::ei_traits::Scalar SquaredNorm( const Eigen::MatrixBase& p) { return p.squaredNorm(); } template inline typename Eigen::ei_traits::Scalar Distance(const Eigen::MatrixBase& p1, const Eigen::MatrixBase & p2) { return (p1-p2).norm(); } template inline typename Eigen::ei_traits::Scalar SquaredDistance(const Eigen::MatrixBase& p1, const Eigen::MatrixBase & p2) { return (p1-p2).squaredNorm(); } template inline const Eigen::CwiseUnaryOp::Scalar>, Derived> Abs(const Eigen::MatrixBase& p) { return p.cwise().abs(); } /** \deprecated use transposeInPlace() or transpose() */ template EIGEN_DEPRECATED inline Eigen::Matrix& Transpose(const Eigen::Matrix& m) { return m.transposeInPlace(); return m; } template inline const Eigen::CwiseBinaryOp::Scalar>, Derived, Eigen::NestByValue > LowClampToZero(const Eigen::MatrixBase& p) { return p.cwise().max(Derived::Zero().nestByValue()); } } #endif