Searched defs:corners (Results 1 - 17 of 17) sorted by relevance

/external/eigen/test/
H A Dcorners.cpp16 template<typename MatrixType> void corners(const MatrixType& m) function
108 CALL_SUBTEST_1( corners(Matrix<float, 1, 1>()) );
109 CALL_SUBTEST_2( corners(Matrix4d()) );
110 CALL_SUBTEST_3( corners(Matrix<int,10,12>()) );
111 CALL_SUBTEST_4( corners(MatrixXcf(5, 7)) );
112 CALL_SUBTEST_5( corners(MatrixXf(21, 20)) );
/external/chromium_org/third_party/skia/gm/
H A Dpatch.cpp38 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local
52 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
H A Dpatchgrid.cpp26 SkPoint corners[4] = { bottom[0], bottom[3], top[0], top[3] }; local
40 canvas->drawPoints(SkCanvas::kPoints_PointMode, 4, corners, paint);
122 //set corners
/external/opencv/cv/src/
H A Dcvcornersubpix.cpp44 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 Dcvdominants.cpp56 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 Dcvfeatureselect.cpp49 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 Dcvcalibinit.cpp103 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/skia/tests/
H A DSerializationTest.cpp353 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local
354 rrect.setRectRadii(rect, corners);
/external/chromium_org/third_party/skia/tests/
H A DSerializationTest.cpp457 SkVector corners[4] = { {1, 2}, {2, 3}, {3,4}, {4,5} }; local
458 rrect.setRectRadii(rect, corners);
/external/opencv/cvaux/src/
H A Dcv3dtracker.cpp60 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/deqp/framework/referencerenderer/
H A DrrRasterizer.cpp285 } corners[] = local
293 // Corner cases at the corners
294 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(corners); ++ndx)
296 const tcu::Vector<deInt64,2> p = diamondCenter + corners[ndx].dp;
305 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT)
309 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT_FIRST_QUARTER &&
314 if (corners[ndx].lineBehavior == DiamondCorners::CORNER_EDGE_CASE_HIT_SECOND_QUARTER &&
320 if (lineInCornerAngleRange(line, corners[ndx].dp))
322 const bool startIsInside = corners[ndx].pointInclusive || p != line.m_v0;
323 const bool endIsOutside = !corners[nd
[all...]
/external/deqp/modules/gles2/functional/
H A Des2fMultisampleTests.cpp678 Vec2 corners[4] = local
696 renderTriangle(corners[(0+quadNdx) % 4] + center,
697 corners[(1+quadNdx) % 4] + center,
698 corners[(2+quadNdx) % 4] + center,
703 renderTriangle(corners[(3+quadNdx) % 4] + center,
704 corners[(2+quadNdx) % 4] + center,
705 corners[(0+quadNdx) % 4] + center,
710 renderTriangle(corners[(0+quadNdx) % 4] + center,
711 corners[(2+quadNdx) % 4] + center,
712 corners[(
754 Vec2 corners[4] = local
794 Vec2 corners[4] = local
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fMultisampleTests.cpp828 Vec2 corners[4] = local
846 renderTriangle(corners[(0+quadNdx) % 4] + center,
847 corners[(1+quadNdx) % 4] + center,
848 corners[(2+quadNdx) % 4] + center,
853 renderTriangle(corners[(3+quadNdx) % 4] + center,
854 corners[(2+quadNdx) % 4] + center,
855 corners[(0+quadNdx) % 4] + center,
860 renderTriangle(corners[(0+quadNdx) % 4] + center,
861 corners[(2+quadNdx) % 4] + center,
862 corners[(
904 Vec2 corners[4] = local
944 Vec2 corners[4] = local
[all...]
/external/skia/src/core/
H A DSkPath.cpp374 The direction takes advantage of the corners found since opposite sides
394 int corners = 0; local
425 if (0 == corners) {
429 corners = 1;
441 if (++corners > 4) {
449 // Possible values for corners are 2, 3, and 4.
450 // When corners == 3, nextDirection opposes firstDirection.
452 int turn = firstDirection ^ (corners - 1);
453 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn;
474 // Success if 4 corners an
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkPath.cpp374 The direction takes advantage of the corners found since opposite sides
394 int corners = 0; local
425 if (0 == corners) {
429 corners = 1;
441 if (++corners > 4) {
449 // Possible values for corners are 2, 3, and 4.
450 // When corners == 3, nextDirection opposes firstDirection.
452 int turn = firstDirection ^ (corners - 1);
453 int directionCycle = 3 == corners ? 0 : nextDirection ^ turn;
474 // Success if 4 corners an
[all...]
/external/opencv/cv/include/
H A Dcvcompat.h575 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 Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...

Completed in 469 milliseconds