@@ -30,8 +30,8 @@ static int _filterCornersWithoutMinMarkers(const Ptr<CharucoBoard> &_board,
30
30
int currentCharucoId = _allCharucoIds.getMat ().at < int >(i);
31
31
int totalMarkers = 0 ; // nomber of closest marker detected
32
32
// look for closest markers
33
- for (unsigned int m = 0 ; m < _board->nearestMarkerIdx [currentCharucoId].size (); m++) {
34
- int markerId = _board->getIds ()[_board->nearestMarkerIdx [currentCharucoId][m]];
33
+ for (unsigned int m = 0 ; m < _board->getNearestMarkerIdx () [currentCharucoId].size (); m++) {
34
+ int markerId = _board->getIds ()[_board->getNearestMarkerIdx () [currentCharucoId][m]];
35
35
bool found = false ;
36
36
for (unsigned int k = 0 ; k < _allArucoIds.getMat ().total (); k++) {
37
37
if (_allArucoIds.getMat ().at < int >(k) == markerId) {
@@ -133,15 +133,15 @@ static void _getMaximumSubPixWindowSizes(InputArrayOfArrays markerCorners, Input
133
133
134
134
for (unsigned int i = 0 ; i < nCharucoCorners; i++) {
135
135
if (charucoCorners.getMat ().at < Point2f >(i) == Point2f (-1 , -1 )) continue ;
136
- if (board->nearestMarkerIdx [i].size () == 0 ) continue ;
136
+ if (board->getNearestMarkerIdx () [i].size () == 0 ) continue ;
137
137
138
138
double minDist = -1 ;
139
139
int counter = 0 ;
140
140
141
141
// calculate the distance to each of the closest corner of each closest marker
142
- for (unsigned int j = 0 ; j < board->nearestMarkerIdx [i].size (); j++) {
142
+ for (unsigned int j = 0 ; j < board->getNearestMarkerIdx () [i].size (); j++) {
143
143
// find marker
144
- int markerId = board->getIds ()[board->nearestMarkerIdx [i][j]];
144
+ int markerId = board->getIds ()[board->getNearestMarkerIdx () [i][j]];
145
145
int markerIdx = -1 ;
146
146
for (unsigned int k = 0 ; k < markerIds.getMat ().total (); k++) {
147
147
if (markerIds.getMat ().at < int >(k) == markerId) {
@@ -151,7 +151,7 @@ static void _getMaximumSubPixWindowSizes(InputArrayOfArrays markerCorners, Input
151
151
}
152
152
if (markerIdx == -1 ) continue ;
153
153
Point2f markerCorner =
154
- markerCorners.getMat (markerIdx).at < Point2f >(board->nearestMarkerCorners [i][j]);
154
+ markerCorners.getMat (markerIdx).at < Point2f >(board->getNearestMarkerCorners () [i][j]);
155
155
Point2f charucoCorner = charucoCorners.getMat ().at < Point2f >(i);
156
156
double dist = norm (markerCorner - charucoCorner);
157
157
if (minDist == -1 ) minDist = dist; // if first distance, just assign it
@@ -200,7 +200,7 @@ static int _interpolateCornersCharucoApproxCalib(InputArrayOfArrays _markerCorne
200
200
// project chessboard corners
201
201
vector< Point2f > allChessboardImgPoints;
202
202
203
- projectPoints (_board->chessboardCorners , approximatedRvec, approximatedTvec, _cameraMatrix,
203
+ projectPoints (_board->getChessboardCorners () , approximatedRvec, approximatedTvec, _cameraMatrix,
204
204
_distCoeffs, allChessboardImgPoints);
205
205
206
206
@@ -257,17 +257,17 @@ static int _interpolateCornersCharucoLocalHom(InputArrayOfArrays _markerCorners,
257
257
validTransform[i] = std::abs (det) > 1e-6 ;
258
258
}
259
259
260
- unsigned int nCharucoCorners = (unsigned int )_board->chessboardCorners .size ();
260
+ unsigned int nCharucoCorners = (unsigned int )_board->getChessboardCorners () .size ();
261
261
vector< Point2f > allChessboardImgPoints (nCharucoCorners, Point2f (-1 , -1 ));
262
262
263
263
// for each charuco corner, calculate its interpolation position based on the closest markers
264
264
// homographies
265
265
for (unsigned int i = 0 ; i < nCharucoCorners; i++) {
266
- Point2f objPoint2D = Point2f (_board->chessboardCorners [i].x , _board->chessboardCorners [i].y );
266
+ Point2f objPoint2D = Point2f (_board->getChessboardCorners () [i].x , _board->getChessboardCorners () [i].y );
267
267
268
268
vector< Point2f > interpolatedPositions;
269
- for (unsigned int j = 0 ; j < _board->nearestMarkerIdx [i].size (); j++) {
270
- int markerId = _board->getIds ()[_board->nearestMarkerIdx [i][j]];
269
+ for (unsigned int j = 0 ; j < _board->getNearestMarkerIdx () [i].size (); j++) {
270
+ int markerId = _board->getIds ()[_board->getNearestMarkerIdx () [i][j]];
271
271
int markerIdx = -1 ;
272
272
for (unsigned int k = 0 ; k < _markerIds.getMat ().total (); k++) {
273
273
if (_markerIds.getMat ().at < int >(k) == markerId) {
0 commit comments