Lines Matching refs:row
102 int row; // Board row index
115 int row, col; // row and column of this quad
155 static int icvTrimRow(CvCBQuad **quads, int count, int row, int dir);
486 // Checks that each board row and column is pretty much monotonous curve:
487 // It analyzes each row and each column of the chessboard as following:
488 // for each corner c lying between end points in the same row/column it checks that
490 // of the neighbor corners in the same row/column.
573 start->row = 0;
585 int row = q->row;
587 row_hist[row+HSIZE]++;
590 if (row > row_max) row_max = row;
591 if (row < row_min) row_min = row;
598 switch(i) // adjust col, row for this quad
601 row--; col--; break;
605 row += 2; break;
613 PRINTF("col: %d row: %d\n", col, row);
616 neighbor->row = row;
673 PRINTF("Trimming top row\n");
678 PRINTF("Trimming bottom row\n");
693 int row = quads[i]->row;
696 switch(j) // adjust col, row for this quad
699 row--; col--; break;
703 row += 2; break;
710 row <= row_max && row >= row_min)
713 PRINTF("Adding inner: col: %d row: %d\n", col, row);
717 neighbor->row = row;
894 icvTrimRow(CvCBQuad **quads, int count, int row, int dir)
902 PRINTF("index: %d cur: %d\n", row, quads[i]->row);
904 if (quads[i]->ordered && quads[i]->row == row)
1229 if( a->row == 0 )
1232 a->row = row_flag;
1234 else if( a->row > row_flag )
1235 a->row = row_flag;
1265 if( corners[i]->row == ROW1 )
1267 else if( !first2 && corners[i]->row == ROW2 )
1301 cur->row = 0;
1304 first = below; // remember the first corner in the next row
1305 // find and store the first row (or column)
1308 right->row = 0;
1319 if( c && c->row > 0 )
1351 cur->row = i;
1360 // and that has a neighbor from the previous row
1364 if( c && c->row > i )
1368 if( c->neighbors[kk] && c->neighbors[kk]->row == i-1 )
1404 // check if we need to revert the order in each row
