testPolygon2.cpp

Test vpPolygon class.

/****************************************************************************
 *
 * ViSP, open source Visual Servoing Platform software.
 * Copyright (C) 2005 - 2022 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 http://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:
 * Test vpPolygon class.
 *
 * Authors:
 * Julien Dufour
 *
 *****************************************************************************/
#include <visp3/core/vpPolygon.h>
 
// Core
#include <visp3/core/vpConfig.h>
#include <visp3/core/vpRect.h>
 
#ifdef VISP_HAVE_CATCH2
#define CATCH_CONFIG_RUNNER
#include <catch.hpp>
 
#ifdef VISP_HAVE_OPENCV
TEST_CASE("Check OpenCV-bsed convex hull")
{
  SECTION("From vpRect")
  {
    const vpRect rect{0, 0, 200, 400};
    const std::vector<vpImagePoint> rect_corners{rect.getTopLeft(), rect.getTopRight(), rect.getBottomRight(),
                                                 rect.getBottomLeft()};
 
    vpPolygon poly{};
    poly.buildFrom(rect_corners, true);
 
#if (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_14)
    for (const auto &poly_corner : poly.getCorners()) {
      REQUIRE(std::find(cbegin(rect_corners), cend(rect_corners), poly_corner) != cend(rect_corners));
    }
#elif (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_11)
    for (const auto &poly_corner : poly.getCorners()) {
      REQUIRE(std::find(begin(rect_corners), end(rect_corners), poly_corner) != end(rect_corners));
    }
#else
    for (std::vector<vpImagePoint>::const_iterator it = poly.getCorners().begin(); it != poly.getCorners().end();
         ++it) {
      REQUIRE(std::find(rect_corners.begin(), rect_corners.end(), *it) != rect_corners.end());
    }
#endif
  }
}
#endif
 
int main(int argc, char *argv[])
{
  Catch::Session session;
  session.applyCommandLine(argc, argv);
 
  return session.run();
}
#else
// Fallback to classic tests
 
bool testConvexHull()
{
#ifdef VISP_HAVE_OPENCV
  const vpRect rect(0, 0, 200, 400);
  std::vector<vpImagePoint> rect_corners;
  rect_corners.push_back(rect.getTopLeft());
  rect_corners.push_back(rect.getTopRight());
  rect_corners.push_back(rect.getBottomRight());
  rect_corners.push_back(rect.getBottomLeft());
 
  vpPolygon poly;
  poly.buildFrom(rect_corners, true);
 
#if (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_14)
  for (const auto &poly_corner : poly.getCorners()) {
    if (std::find(cbegin(rect_corners), cend(rect_corners), poly_corner) == cend(rect_corners)) {
      return false;
    }
  }
#elif (VISP_CXX_STANDARD >= VISP_CXX_STANDARD_11)
  for (const auto &poly_corner : poly.getCorners()) {
    if (std::find(begin(rect_corners), end(rect_corners), poly_corner) == end(rect_corners)) {
      return false;
    }
  }
#else
  for (std::vector<vpImagePoint>::const_iterator it = poly.getCorners().begin(); it != poly.getCorners().end(); ++it) {
    if (std::find(rect_corners.begin(), rect_corners.end(), *it) == rect_corners.end()) {
      return false;
    }
  }
#endif
 
#endif
 
  return true;
}
 
int main()
{
  if (! testConvexHull()) {
    return EXIT_FAILURE;
  }
 
  return EXIT_SUCCESS;
}
#endif