vpRect.cpp

/****************************************************************************
 *
 * 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:
 * Defines a rectangle in the plane.
 *
 *
*****************************************************************************/
 
#include <visp3/core/vpDebug.h>
#include <visp3/core/vpRect.h>
 
vpRect::vpRect() : left(0), top(0), width(0), height(0) { }
 
vpRect::vpRect(double l, double t, double w, double h) : left(l), top(t), width(w), height(h) { }
 
vpRect::vpRect(const vpImagePoint &topLeft, double w, double h)
  : left(topLeft.get_u()), top(topLeft.get_v()), width(w), height(h)
{ }
 
vpRect::vpRect(const vpImagePoint &topLeft, const vpImagePoint &bottomRight)
  : left(topLeft.get_u()), top(topLeft.get_v()), width(0), height(0)
{
  this->left = topLeft.get_u();
  this->top = topLeft.get_v();
 
  setBottom(bottomRight.get_v());
  setRight(bottomRight.get_u());
}
 
vpRect::vpRect(const vpRect &r) : left(0), top(0), width(0), height(0) { *this = r; }
 
vpRect &vpRect::operator=(const vpRect &r)
{
  this->left = r.left;
  this->top = r.top;
  this->width = r.width;
  this->height = r.height;
  return *this;
}
 
vpRect::vpRect(const std::vector<vpImagePoint> &ip) : left(0), top(0), width(0), height(0) { set(ip); }
 
bool vpRect::isInside(const vpImagePoint &ip) const
{
  return ((ip.get_i() <= this->getBottom()) && (ip.get_i() >= this->getTop()) && (ip.get_j() <= this->getRight()) &&
          (ip.get_j() >= this->getLeft()));
}
 
void vpRect::set(double l, double t, double w, double h)
{
  left = l;
  top = t;
  width = w;
  height = h;
}
 
void vpRect::set(const vpImagePoint &topLeft, double w, double h)
{
  left = topLeft.get_u();
  top = topLeft.get_v();
  width = w;
  height = h;
}
 
void vpRect::set(const std::vector<vpImagePoint> &ip)
{
  if (ip.size() < 1) {
    throw(vpException(vpException::dimensionError, "At least 1 point is requested to build a rectangle"));
  }
  double minu, maxu;
  double minv, maxv;
  maxu = ip[0].get_u();
  maxv = ip[0].get_v();
  minu = maxu;
  minv = maxv;
 
  size_t ip_size = ip.size();
  for (size_t i = 1; i < ip_size; ++i) {
    double u = ip[i].get_u();
    double v = ip[i].get_v();
    if (u < minu) {
      minu = u;
    }
    else if (u > maxu) {
      maxu = u;
    }
    if (v < minv) {
      minv = v;
    }
    else if (v > maxv) {
      maxv = v;
    }
  }
 
  setLeft(minu);
  setTop(minv);
  setRight(maxu);
  setBottom(maxv);
}
 
void vpRect::set(const vpImagePoint &topLeft, const vpImagePoint &bottomRight)
{
  this->left = topLeft.get_u();
  this->top = topLeft.get_v();
 
  setBottom(bottomRight.get_v());
  setRight(bottomRight.get_u());
}
 
void vpRect::set(const vpRect &r) { *this = r; }
 
bool vpRect::operator==(const vpRect &r) const
{
  // --comment: return top == r.top and left == r.left and width == r.width and height == r.height
  return ((std::fabs(top - r.top) <= (std::fabs(top) * std::numeric_limits<double>::epsilon())) &&
          (std::fabs(left - r.left) <= (std::fabs(left) * std::numeric_limits<double>::epsilon())) &&
          (std::fabs(width - r.width) <= (std::fabs(width) * std::numeric_limits<double>::epsilon())) &&
          (std::fabs(height - r.height) <= (std::fabs(height) * std::numeric_limits<double>::epsilon())));
}
 
bool vpRect::operator!=(const vpRect &r) const
{
  // --comment: return (top != r.top || left != r.left || width != r.width || height !=
  // --comment: r.height);
  // --comment:  return (std::fabs(top-r.top) >
  // --comment:  std::fabs(top)*std::numeric_limits<double>::epsilon()
  // --comment:          || std::fabs(left-r.left) >
  // --comment:          std::fabs(left)*std::numeric_limits<double>::epsilon()
  // --comment:          || std::fabs(width-r.width) >
  // --comment:          std::fabs(width)*std::numeric_limits<double>::epsilon()
  // --comment:          || std::fabs(height-r.height) >
  // --comment:          std::fabs(height)*std::numeric_limits<double>::epsilon()
  return !(*this == r);
}
 
VISP_EXPORT bool inRectangle(const vpImagePoint &ip, const vpRect &rect)
{
  return ((ip.get_i() <= rect.getBottom()) && (ip.get_i() >= rect.getTop()) && (ip.get_j() <= rect.getRight()) &&
          (ip.get_j() >= rect.getLeft()));
}
 
VISP_EXPORT std::ostream &operator<<(std::ostream &os, const vpRect &r)
{
  os << r.getLeft() << ", " << r.getTop() << ", " << r.getWidth() << ", " << r.getHeight();
  return os;
}