1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
|
/****************************************************************************
*
* 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:
* Test vpPolygon class.
*
* Authors:
* Julien Dufour
*
*****************************************************************************/
/*!
\example testPolygon2.cpp
\brief Test vpPolygon class.
*/
#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
|