DGtal 1.3.0
Loading...
Searching...
No Matches
testPlaneProbingTetrahedronEstimator.cpp
Go to the documentation of this file.
1
31#include <iostream>
32#include <vector>
33#include "DGtal/base/Common.h"
34#include "ConfigTest.h"
35#include "DGtalCatch.h"
36#include "DGtal/helpers/StdDefs.h"
37#include "DGtal/arithmetic/IntegerComputer.h"
38#include "DGtal/geometry/surfaces/DigitalPlanePredicate.h"
39#include "DGtal/geometry/surfaces/estimation/PlaneProbingTetrahedronEstimator.h"
41
42using namespace std;
43using namespace DGtal;
44
46// Functions for testing class PlaneProbingTetrahedronEstimator.
48
49static const Z3i::Vector NORMALS[100] = {
50 {1, 117, 148}, {1, 118, 149}, {1, 120, 25}, {1, 120, 152}, {1, 121, 153}, {1, 122, 154}, {1, 123, 155}, {1, 123, 156}, {1, 124, 26}, {1, 124, 157},
51 {1, 125, 26}, {1, 125, 158}, {1, 126, 77}, {1, 126, 159}, {1, 127, 160}, {1, 127, 161}, {1, 128, 27}, {1, 128, 162}, {1, 129, 27}, {1, 129, 163},
52 {1, 130, 164}, {1, 130, 165}, {1, 131, 165}, {1, 131, 166}, {1, 132, 28}, {1, 132, 166}, {1, 132, 167}, {1, 133, 28}, {1, 133, 168}, {1, 134, 169},
53 {1, 134, 170}, {1, 135, 170}, {1, 135, 171}, {1, 136, 171}, {1, 136, 172}, {1, 137, 29}, {1, 137, 173}, {1, 137, 174}, {1, 138, 174}, {1, 138, 175},
54 {1, 139, 175}, {1, 139, 176}, {1, 140, 176}, {1, 140, 177}, {1, 140, 178}, {1, 141, 30}, {1, 141, 178}, {1, 141, 179}, {1, 142, 179}, {1, 142, 180},
55 {1, 143, 180}, {1, 143, 181}, {1, 144, 182}, {1, 144, 183}, {1, 145, 183}, {1, 145, 184}, {1, 146, 184}, {1, 146, 185}, {1, 147, 186}, {1, 147, 187},
56 {1, 148, 187}, {1, 148, 188}, {1, 149, 188}, {1, 149, 189}, {1, 150, 190}, {1, 151, 191}, {1, 151, 192}, {1, 152, 192}, {1, 152, 193}, {1, 153, 194},
57 {1, 154, 195}, {1, 154, 196}, {1, 155, 196}, {1, 155, 197}, {1, 156, 198}, {1, 157, 199}, {1, 173, 30}, {1, 174, 30}, {1, 175, 30}, {1, 178, 31},
58 {1, 179, 31}, {1, 180, 31}, {1, 181, 31}, {1, 184, 32}, {1, 185, 32}, {1, 186, 32}, {1, 187, 32}, {1, 188, 32}, {1, 189, 33}, {1, 190, 33},
59 {1, 191, 33}, {1, 192, 33}, {1, 193, 33}, {1, 194, 33}, {1, 194, 34}, {1, 195, 34}, {1, 196, 34}, {1, 197, 34}, {1, 198, 34}, {1, 199, 34},
60};
61
62static const Z3i::Vector NORMALS_BIG[2] = {
63 {1, 59438, 82499}, {2071, 8513, 6444},
64};
65
66template < typename Integer, ProbingMode mode >
67struct TestPlaneProbingTetrahedronEstimator
68{
71 using Point = typename DigitalPlane::Vector;
73
74 template < typename F >
75 static void compute (Point const& n, F const& f)
76 {
77 Point o(0, 0, 0);
78 std::array<Point, 3> frame = { Point(1, 0, 0), Point(0, 1, 0), Point(0, 0, 1) };
79
80 DigitalPlane plane(n, 0, n.norm1());
81 Estimator estimator(o, frame, plane);
82
83 f(estimator);
84 }
85};
86
87TEST_CASE("Testing PlaneProbingTetrahedronEstimator")
88{
89 SECTION("H-algorithm should return the correct normal, but a non-reduced basis")
90 {
91 int nbOk = 0;
92
93 for (const auto& n: NORMALS) {
94 TestPlaneProbingTetrahedronEstimator<int, ProbingMode::H>::compute
95 (n,
97 auto estimated = estimator.compute();
98 bool isReducedH = estimator.isReduced();
99
100 if (estimated == n && !isReducedH)
101 {
102 nbOk++;
103 }
104 });
105 }
106
107 REQUIRE(nbOk == 100);
108 }
109
110 SECTION("R and R1 algorithm should return the correct, same normal and the final basis should be reduced")
111 {
113
114 int nbOk = 0;
115 Point estimatedR, estimatedR1;
116 bool isReducedR = false, isReducedR1 = false;
117
118 for (const auto& n: NORMALS) {
119 TestPlaneProbingTetrahedronEstimator<int, ProbingMode::R>::compute
120 (n,
122 estimatedR = estimator.compute();
123 isReducedR = estimator.isReduced();
124 });
125
126 TestPlaneProbingTetrahedronEstimator<int, ProbingMode::R1>::compute
127 (n,
129 estimatedR1 = estimator.compute();
130 isReducedR1 = estimator.isReduced();
131 });
132
133 if (estimatedR == n && estimatedR1 == estimatedR &&
134 isReducedR && isReducedR1)
135 {
136 nbOk++;
137 }
138 }
139
140 REQUIRE(nbOk == 100);
141 }
142
143#ifdef WITH_GMP
144 SECTION("H and R algorithm should return the correct normal, R-algorithm a reduced basis with BigInteger")
145 {
147
148 int nbOk = 0;
149 Point estimatedH, estimatedR;
150 bool isReducedH = false, isReducedR = false;
151
152 for (const auto& n: NORMALS_BIG) {
153 TestPlaneProbingTetrahedronEstimator<BigInteger, ProbingMode::H>::compute
154 (n,
156 estimatedH = estimator.compute();
157 isReducedH = estimator.isReduced();
158 });
159
160 TestPlaneProbingTetrahedronEstimator<BigInteger, ProbingMode::R>::compute
161 (n,
163 estimatedR = estimator.compute();
164 isReducedR = estimator.isReduced();
165 });
166
167 if (estimatedH == n && estimatedR == estimatedH && !isReducedH && isReducedR)
168 {
169 nbOk++;
170 }
171 }
172
173 REQUIRE(nbOk == 2);
174 }
175#endif
176}
177
Aim: Representing digital planes, which are digitizations of Euclidean planes, as point predicates.
Aim: A class that locally estimates a normal on a digital set using only a predicate "does a point x ...
Quantity compute(std::vector< PointOnProbingRay > const &aNeighbors)
DGtal is the top-level namespace which contains all DGtal functions and types.
STL namespace.
MyPointD Point
Definition: testClone2.cpp:383
TEST_CASE("Testing PlaneProbingTetrahedronEstimator")
static const Z3i::Vector NORMALS_BIG[2]
static const Z3i::Vector NORMALS[100]
SECTION("Testing constant forward iterators")
REQUIRE(domain.isInside(aPoint))