Lines Matching defs:corner
43 This is improved variant of chessboard corner detection algorithm that
97 /// Corner info structure
98 /** This structure stores information about the chessboard corner.*/
101 CvPoint2D32f pt; // Coordinates of the corner
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
151 static void icvOrderQuad(CvCBQuad *quad, CvCBCorner *corner, int common);
488 // for each corner c lying between end points in the same row/column it checks that
535 // can add quads, so we need to have quad/corner arrays passed in
578 // 0,1,2,3) are in the at the same relative corner (e.g., lower right).
808 CvCBCorner* corner;
813 corner = &(*corners)[all_count*4+k];
815 memset( corner, 0, sizeof(*corner) );
816 corner->pt = pt;
817 q->corners[k] = corner;
818 corner->pt.x += dx;
819 corner->pt.y += dy;
821 // have to set exact corner
835 // have to set exact corner
982 // put quad into correct order, where <corner> has value <common>
986 icvOrderQuad(CvCBQuad *quad, CvCBCorner *corner, int common)
988 // find the corner
991 if (quad->corners[tc]->pt.x == corner->pt.x &&
992 quad->corners[tc]->pt.y == corner->pt.y)
995 // set corner order
1272 // start with a corner that belongs to a quad with a signle neighbor.
1273 // if we do not have such, start with a corner of a quad with two neighbors.
1304 first = below; // remember the first corner in the next row
1466 // for each corner of this quadrangle
1480 corner in all other quadrangles
1515 // we found a matching corner point?
1518 // If another point from our current quad is closer to the found corner
1521 // corner will get matched to closest_quad;
1539 // Check that each corner is a neighbor of different quads
1548 // check whether the closest corner to closest_corner
1575 // We've found one more corner - remember it
1591 // top left corner)
1700 // allocate quad & corner buffers
1719 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i];
1721 memset( corner, 0, sizeof(*corner) );
1722 corner->pt = pt;
1723 q->corners[i] = corner;
1926 // allocate quad & corner buffers
1945 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i];
1947 memset( corner, 0, sizeof(*corner) );
1948 corner->pt = pt;
1949 q->corners[i] = corner;
