/external/eigen/test/ |
H A D | corners.cpp | 16 template<typename MatrixType> void corners(const MatrixType& m) function 88 CALL_SUBTEST_1( corners(Matrix<float, 1, 1>()) ); 89 CALL_SUBTEST_2( corners(Matrix4d()) ); 90 CALL_SUBTEST_3( corners(Matrix<int,10,12>()) ); 91 CALL_SUBTEST_4( corners(MatrixXcf(5, 7)) ); 92 CALL_SUBTEST_5( corners(MatrixXf(21, 20)) );
|
/external/skia/tests/ |
H A D | SerializationTest.cpp | 263 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local 264 rrect.setRectRadii(rect, corners);
|
/external/opencv/cv/src/ |
H A D | cvcornersubpix.cpp | 44 cvFindCornerSubPix( const void* srcarr, CvPoint2D32f* corners, argument 77 if( !corners ) 182 CvPoint2D32f cT = corners[pt_i], cI = cT; 259 corners[pt_i] = cI; /* store result */
|
H A D | cvdominants.cpp | 56 CvSeq ** corners, int dmin2, int dmax2, int dneigh2, float amax ) 78 if( corners == NULL ) 314 *corners = cvEndWriteSeq( &writer ); 336 // Applies some algorithm to find dominant points ( corners ) of contour 362 CvSeq* corners = 0; local 394 IPPI_CALL( icvFindDominantPointsIPAN( contour, storage, &corners, 404 return corners; 54 icvFindDominantPointsIPAN( CvSeq * contour, CvMemStorage * storage, CvSeq ** corners, int dmin2, int dmax2, int dneigh2, float amax ) argument
|
H A D | cvfeatureselect.cpp | 49 CvPoint2D32f* corners, int *corner_count, 69 CvPoint *ptr = (CvPoint *) corners; 133 if( !corners || !corner_count ) 137 CV_ERROR( CV_StsBadArg, "maximal corners number is non positive" ); 222 corners[i].x = (float)ptr[i].x; 223 corners[i].y = (float)ptr[i].y; 48 cvGoodFeaturesToTrack( const void* image, void* eigImage, void* tempImage, CvPoint2D32f* corners, int *corner_count, double quality_level, double min_distance, const void* maskImage, int block_size, int use_harris, double harris_k ) argument
|
H A D | cvcalibinit.cpp | 103 int count; // Number of neighbor corners 104 struct CvCBCorner* neighbors[4]; // Neighbor corners 116 bool ordered; // true if corners/neighbors are ordered counter-clockwise 118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0 119 CvCBCorner *corners[4]; // Coordinates of quad corners member in struct:CvCBQuad 128 static int icvGenerateQuads( CvCBQuad **quads, CvCBCorner **corners, 148 int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, 158 CvCBQuad **all_quads, int all_count, CvCBCorner **corners); 162 static int icvCheckBoardMonotony( CvPoint2D32f* corners, CvSiz 218 CvCBCorner *corners = 0, **corner_group = 0; local 497 icvCheckBoardMonotony( CvPoint2D32f* corners, CvSize pattern_size ) argument 539 icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads, int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, CvSize pattern_size, CvMemStorage* storage ) argument 1194 CvCBCorner** corners = 0; local 1980 cvDrawChessboardCorners( CvArr* _image, CvSize pattern_size, CvPoint2D32f* corners, int count, int found ) argument [all...] |
/external/chromium/chrome/browser/chromeos/frame/ |
H A D | panel_controller.cc | 73 SkScalar corners[] = { local 79 path.addRoundRect(rect, corners);
|
/external/opencv/cvaux/src/ |
H A D | cv3dtracker.cpp | 60 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, 327 static void DrawEtalon(IplImage *img, CvPoint2D32f *corners, argument 356 pt.x = cvRound(corners[i].x); 357 pt.y = cvRound(corners[i].y);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPath.cpp | 371 The direction takes advantage of the corners found since opposite sides 380 int corners = 0; local 412 if (0 == corners) { 416 corners = 1; 428 if (++corners > 4) { 436 // Possible values for corners are 2, 3, and 4. 437 // When corners == 3, nextDirection opposes firstDirection. 439 int turn = firstDirection ^ (corners - 1); 440 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn; 461 // Success if 4 corners an [all...] |
/external/skia/src/core/ |
H A D | SkPath.cpp | 371 The direction takes advantage of the corners found since opposite sides 380 int corners = 0; local 412 if (0 == corners) { 416 corners = 1; 428 if (++corners > 4) { 436 // Possible values for corners are 2, 3, and 4. 437 // When corners == 3, nextDirection opposes firstDirection. 439 int turn = firstDirection ^ (corners - 1); 440 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn; 461 // Success if 4 corners an [all...] |
/external/opencv/cv/include/ |
H A D | cvcompat.h | 575 CvSize pattern_size, CvPoint2D32f * corners, 578 return cvFindChessboardCorners( arr, pattern_size, corners, 573 cvFindChessBoardCornerGuesses( const void* arr, void* CV_UNREFERENCED(thresharr), CvMemStorage * CV_UNREFERENCED(storage), CvSize pattern_size, CvPoint2D32f * corners, int *corner_count ) argument
|
/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |