vpMath.h

/*
 * ViSP, open source Visual Servoing Platform software.
 * Copyright (C) 2005 - 2023 by Inria. All rights reserved.
 *
 * This software 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.
 * See the file LICENSE.txt at the root directory of this source
 * distribution for additional information about the GNU GPL.
 *
 * For using ViSP with software that can not be combined with the GNU
 * GPL, please contact Inria about acquiring a ViSP Professional
 * Edition License.
 *
 * See https://visp.inria.fr for more information.
 *
 * This software was developed at:
 * Inria Rennes - Bretagne Atlantique
 * Campus Universitaire de Beaulieu
 * 35042 Rennes Cedex
 * France
 *
 * If you have questions regarding the use of this file, please contact
 * Inria at visp@inria.fr
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 * Description:
 * Simple mathematical function not available in the C math library (math.h).
 */
 
#ifndef vpMATH_HH
#define vpMATH_HH
 
#include <visp3/core/vpConfig.h>
 
#include <algorithm>
#include <climits>
#include <limits>
#if defined(_WIN32)
// Define _USE_MATH_DEFINES before including <math.h> to expose these macro
// definitions for common math constants.  These are placed under an #ifdef
// since these commonly-defined names are not part of the C or C++ standards
#ifndef _USE_MATH_DEFINES
#define _USE_MATH_DEFINES
#endif
#endif
#include <math.h>
#include <vector>
 
#if defined(VISP_HAVE_FUNC_ISNAN) || defined(VISP_HAVE_FUNC_STD_ISNAN) || defined(VISP_HAVE_FUNC_ISINF) ||             \
    defined(VISP_HAVE_FUNC_STD_ISINF) || defined(VISP_HAVE_FUNC_STD_ROUND)
#include <cmath>
#endif
 
#if defined(_WIN32) // Not defined in Microsoft math.h
 
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
 
#ifndef M_PI_2
#define M_PI_2 (M_PI / 2.0)
#endif
 
#ifndef M_PI_4
#define M_PI_4 (M_PI / 4.0)
#endif
 
#endif
 
#include <visp3/core/vpException.h>
#include <visp3/core/vpImagePoint.h>
 
class vpPoint;
class vpHomogeneousMatrix;
class vpColVector;
class vpRotationVector;
class vpRxyzVector;
class vpTranslationVector;
 
class VISP_EXPORT vpMath
{
public:
  static inline double deg(double rad) { return (rad * 180.0) / M_PI; }
 
  static vpColVector deg(const vpRotationVector &r);
  static vpColVector deg(const vpColVector &r);
 
  static inline double rad(double deg) { return (deg * M_PI) / 180.0; }
 
  static vpColVector rad(const vpColVector &r);
 
  static inline double sqr(double x) { return x * x; }
 
  //  factorial of x
  static inline double fact(unsigned int x);
 
  // combinaison
  static inline long double comb(unsigned int n, unsigned int p);
 
  template <typename T> static inline T clamp(const T &v, const T &lower, const T &upper)
  {
#if (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_17)
    return std::clamp(v, lower, upper);
#else
    if (upper < lower) {
      throw vpException(vpException::badValue, "clamp: lower bound is greater than upper bound");
    }
    return (v < lower) ? lower : (upper < v) ? upper : v;
#endif
  }
 
  //   round x to the nearest integer
  static inline int round(double x);
 
  //   return the sign of x (+-1)
  static inline int sign(double x);
 
  // test if a number equals 0 (with threshold value)
  static inline bool nul(double x, double threshold = 0.001);
 
  // test if two numbers are equals (with a user defined threshold)
  static inline bool equal(double x, double y, double threshold = 0.001);
 
  // test if a number is greater than another (with a user defined threshold)
  static inline bool greater(double x, double y, double threshold = 0.001);
 
  template <class Type> static Type maximum(const Type &a, const Type &b) { return (a > b) ? a : b; }
 
  template <class Type> static Type minimum(const Type &a, const Type &b) { return (a < b) ? a : b; }
 
  template <class Type> static Type abs(const Type &x) { return (x < 0) ? -x : x; }
 
  // sinus cardinal
  static double sinc(double x);
  static double sinc(double sinx, double x);
  static double mcosc(double cosx, double x);
  static double msinc(double sinx, double x);
 
  // sigmoid
  static inline double sigmoid(double x, double x0 = 0., double x1 = 1., double n = 12.);
 
  template <class Type> static void swap(Type &a, Type &b)
  {
    Type tmp = b;
    b = a;
    a = tmp;
  }
 
  static bool isNaN(double value);
  static bool isNaN(float value);
  static bool isInf(double value);
  static bool isInf(float value);
  static bool isFinite(double value);
  static bool isFinite(float value);
  static bool isNumber(const std::string &str);
 
  static double lineFitting(const std::vector<vpImagePoint> &imPts, double &a, double &b, double &c);
 
  template <typename _Tp> static inline _Tp saturate(unsigned char v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(char v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(unsigned short v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(short v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(unsigned v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(int v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(float v) { return _Tp(v); }
  template <typename _Tp> static inline _Tp saturate(double v) { return _Tp(v); }
 
  static double getMean(const std::vector<double> &v);
  static double getMedian(const std::vector<double> &v);
  static double getStdev(const std::vector<double> &v, bool useBesselCorrection = false);
 
  static int modulo(int a, int n);
 
  static vpHomogeneousMatrix ned2ecef(double lonDeg, double latDeg, double radius);
  static vpHomogeneousMatrix enu2ecef(double lonDeg, double latDeg, double radius);
  static vpHomogeneousMatrix enu2ned(const vpHomogeneousMatrix &enu_M);
 
  template <typename T> static std::vector<double> linspace(T start_in, T end_in, unsigned int num_in)
  {
    std::vector<double> linspaced;
 
    double start = static_cast<double>(start_in);
    double end = static_cast<double>(end_in);
    double num = static_cast<double>(num_in);
 
    if (std::fabs(num) < std::numeric_limits<double>::epsilon()) {
      return linspaced;
    }
    if (std::fabs(num - 1) < std::numeric_limits<double>::epsilon()) {
      linspaced.push_back(start);
      return linspaced;
    }
 
    double delta = (end - start) / (num - 1);
 
    for (int i = 0; i < num - 1; i++) {
      linspaced.push_back(start + delta * i);
    }
    linspaced.push_back(end); // I want to ensure that start and end
    // are exactly the same as the input
    return linspaced;
  }
 
  static std::vector<std::pair<double, double> > computeRegularPointsOnSphere(unsigned int maxPoints);
  static std::vector<vpHomogeneousMatrix>
    getLocalTangentPlaneTransformations(const std::vector<std::pair<double, double> > &lonlatVec, double radius,
      vpHomogeneousMatrix(*toECEF)(double lonDeg, double latDeg, double radius));
 
  static vpHomogeneousMatrix lookAt(const vpColVector &from, const vpColVector &to, vpColVector tmp);
 
private:
  static const double ang_min_sinc;
  static const double ang_min_mc;
};
 
// Begining of the inline functions definition
 
double vpMath::fact(unsigned int x)
{
  if ((x == 1) || (x == 0))
    return 1;
  return x * fact(x - 1);
}
 
long double vpMath::comb(unsigned int n, unsigned int p)
{
  if (n == p)
    return 1;
  return fact(n) / (fact(n - p) * fact(p));
}
 
int vpMath::round(double x)
{
#if defined(VISP_HAVE_FUNC_STD_ROUND)
  return (int)std::round(x);
#elif defined(VISP_HAVE_FUNC_ROUND)
  //:: to design the global namespace and avoid to call recursively
  // vpMath::round
  return (int)::round(x);
#else
  return (x > 0.0) ? ((int)floor(x + 0.5)) : ((int)ceil(x - 0.5));
#endif
}
 
int vpMath::sign(double x)
{
  if (fabs(x) < std::numeric_limits<double>::epsilon())
    return 0;
  else {
    if (x < 0)
      return -1;
    else
      return 1;
  }
}
 
bool vpMath::nul(double x, double threshold) { return (fabs(x) < threshold); }
 
bool vpMath::equal(double x, double y, double threshold) { return (nul(x - y, threshold)); }
 
bool vpMath::greater(double x, double y, double threshold) { return (x > (y - threshold)); }
 
double vpMath::sigmoid(double x, double x0, double x1, double n)
{
  if (x < x0)
    return 0.;
  else if (x > x1)
    return 1.;
  double l0 = 1. / (1. + exp(0.5 * n));
  double l1 = 1. / (1. + exp(-0.5 * n));
  return (1. / (1. + exp(-n * ((x - x0) / (x1 - x0) - 0.5))) - l0) / (l1 - l0);
}
 
// unsigned char
template <> inline unsigned char vpMath::saturate<unsigned char>(char v)
{
  // On big endian arch like powerpc, char implementation is unsigned
  // with CHAR_MIN=0, CHAR_MAX=255 and SCHAR_MIN=-128, SCHAR_MAX=127
  // leading to (int)(char -127) = 129.
  // On little endian arch, CHAR_MIN=-127 and CHAR_MAX=128 leading to
  // (int)(char -127) = -127.
  if (std::numeric_limits<char>::is_signed)
    return (unsigned char)(((std::max))((int)v, 0));
  else
    return (unsigned char)((unsigned int)v > SCHAR_MAX ? 0 : v);
}
 
template <> inline unsigned char vpMath::saturate<unsigned char>(unsigned short v)
{
  return (unsigned char)((std::min))((unsigned int)v, (unsigned int)UCHAR_MAX);
}
 
template <> inline unsigned char vpMath::saturate<unsigned char>(int v)
{
  return (unsigned char)((unsigned int)v <= UCHAR_MAX ? v : v > 0 ? UCHAR_MAX : 0);
}
 
template <> inline unsigned char vpMath::saturate<unsigned char>(short v) { return saturate<unsigned char>((int)v); }
 
template <> inline unsigned char vpMath::saturate<unsigned char>(unsigned int v)
{
  return (unsigned char)((std::min))(v, (unsigned int)UCHAR_MAX);
}
 
template <> inline unsigned char vpMath::saturate<unsigned char>(float v)
{
  int iv = vpMath::round(v);
  return saturate<unsigned char>(iv);
}
 
template <> inline unsigned char vpMath::saturate<unsigned char>(double v)
{
  int iv = vpMath::round(v);
  return saturate<unsigned char>(iv);
}
 
// char
template <> inline char vpMath::saturate<char>(unsigned char v) { return (char)((std::min))((int)v, SCHAR_MAX); }
 
template <> inline char vpMath::saturate<char>(unsigned short v)
{
  return (char)((std::min))((unsigned int)v, (unsigned int)SCHAR_MAX);
}
 
template <> inline char vpMath::saturate<char>(int v)
{
  return (char)((unsigned int)(v - SCHAR_MIN) <= (unsigned int)UCHAR_MAX ? v : v > 0 ? SCHAR_MAX : SCHAR_MIN);
}
 
template <> inline char vpMath::saturate<char>(short v) { return saturate<char>((int)v); }
 
template <> inline char vpMath::saturate<char>(unsigned int v)
{
  return (char)((std::min))(v, (unsigned int)SCHAR_MAX);
}
 
template <> inline char vpMath::saturate<char>(float v)
{
  int iv = vpMath::round(v);
  return saturate<char>(iv);
}
 
template <> inline char vpMath::saturate<char>(double v)
{
  int iv = vpMath::round(v);
  return saturate<char>(iv);
}
 
// unsigned short
template <> inline unsigned short vpMath::saturate<unsigned short>(char v)
{
  // On big endian arch like powerpc, char implementation is unsigned
  // with CHAR_MIN=0, CHAR_MAX=255 and SCHAR_MIN=-128, SCHAR_MAX=127
  // leading to (int)(char -127) = 129.
  // On little endian arch, CHAR_MIN=-127 and CHAR_MAX=128 leading to
  // (int)(char -127) = -127.
  if (std::numeric_limits<char>::is_signed)
    return (unsigned char)(((std::max))((int)v, 0));
  else
    return (unsigned char)((unsigned int)v > SCHAR_MAX ? 0 : v);
}
 
template <> inline unsigned short vpMath::saturate<unsigned short>(short v)
{
  return (unsigned short)((std::max))((int)v, 0);
}
 
template <> inline unsigned short vpMath::saturate<unsigned short>(int v)
{
  return (unsigned short)((unsigned int)v <= (unsigned int)USHRT_MAX ? v : v > 0 ? USHRT_MAX : 0);
}
 
template <> inline unsigned short vpMath::saturate<unsigned short>(unsigned int v)
{
  return (unsigned short)((std::min))(v, (unsigned int)USHRT_MAX);
}
 
template <> inline unsigned short vpMath::saturate<unsigned short>(float v)
{
  int iv = vpMath::round(v);
  return vpMath::saturate<unsigned short>(iv);
}
 
template <> inline unsigned short vpMath::saturate<unsigned short>(double v)
{
  int iv = vpMath::round(v);
  return vpMath::saturate<unsigned short>(iv);
}
 
// short
template <> inline short vpMath::saturate<short>(unsigned short v) { return (short)((std::min))((int)v, SHRT_MAX); }
template <> inline short vpMath::saturate<short>(int v)
{
  return (short)((unsigned int)(v - SHRT_MIN) <= (unsigned int)USHRT_MAX ? v : v > 0 ? SHRT_MAX : SHRT_MIN);
}
template <> inline short vpMath::saturate<short>(unsigned int v)
{
  return (short)((std::min))(v, (unsigned int)SHRT_MAX);
}
template <> inline short vpMath::saturate<short>(float v)
{
  int iv = vpMath::round(v);
  return vpMath::saturate<short>(iv);
}
template <> inline short vpMath::saturate<short>(double v)
{
  int iv = vpMath::round(v);
  return vpMath::saturate<short>(iv);
}
 
// int
template <> inline int vpMath::saturate<int>(float v) { return vpMath::round(v); }
 
template <> inline int vpMath::saturate<int>(double v) { return vpMath::round(v); }
 
// unsigned int
// (Comment from OpenCV) we intentionally do not clip negative numbers, to
// make -1 become 0xffffffff etc.
template <> inline unsigned int vpMath::saturate<unsigned int>(float v) { return (unsigned int)vpMath::round(v); }
 
template <> inline unsigned int vpMath::saturate<unsigned int>(double v) { return (unsigned int)vpMath::round(v); }
 
#endif