| /external/opencv/cvaux/src/ |
| cvlevmartrif.cpp | 85 if( numPoints < 1 )//!!! Need to correct this minimal number of points
87 CV_ERROR( CV_StsUnmatchedSizes, "number of points must be more than 0" );
98 /* each 3D points has X,Y,Z,W */
100 /* For N points 4D we have Jacobian 2N x (12*3+4N) */
169 /* Computers project points using 3 projection matrices and points 3D */
173 /* each 3D points has X,Y,Z,W(?) */
175 /* result of function is projection of N 3D points using 3 projection matrices */
176 /* projected points store as (projection by matrix P1),(projection by matrix P2),(projection by matrix P3) */
179 /* Compute projection of points */
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_regression.cpp | 16 VectorType **points,
21 const int size = points[0]->size();
31 // now pick numPoints random points on this hyperplane
34 VectorType& cur_point = *(points[i]);
45 // add some noise to these points
47 *(points[i]) += noiseAmplitude * VectorType::Random(size);
52 VectorType **points,
56 int size = points[0]->size();
59 linearRegression(numPoints, points, &result, 1);
67 VectorType **points,
[all...] |
| /external/libvpx/libvpx/third_party/libwebm/ |
| RELEASE.TXT | 9 * Defined against badly-formatted cue points
21 * Allowed cue points to be loaded incrementally
22 * Implemented to load lazily cue points as they're searched
|
| /external/opencv3/modules/features2d/perf/ |
| perf_agast.cpp | 37 vector<KeyPoint> points; local
39 TEST_CYCLE() fd->detect(frame, points);
41 SANITY_CHECK_KEYPOINTS(points);
|
| /external/opencv3/samples/python2/ |
| kmeans.py | 32 points, _ = make_gaussians(cluster_n, img_size)
35 ret, labels, centers = cv2.kmeans(points, cluster_n, None, term_crit, 10, 0)
38 for (x, y), label in zip(np.int32(points), labels.ravel()):
|
| /external/opencv3/samples/tapi/ |
| pyrlk_optical_flow.cpp | 84 "{ points | 1000 | specify points count [GoodFeatureToTrack] }"
85 "{ min_dist | 0 | specify minimal distance between points [GoodFeatureToTrack] }"
103 int points = cmd.get<int>("points"); local
112 vector<cv::Point2f> pts(points);
113 vector<cv::Point2f> nextPts(points);
114 vector<unsigned char> status(points);
117 cout << "Points count : " << points << endl << endl
[all...] |
| /external/skia/gm/ |
| dstreadshuffle.cpp | 62 SkPoint points[4]; local
63 kRect.toQuad(points);
64 fConvexPath.moveTo(points[0]);
65 fConvexPath.quadTo(points[1], points[2]);
66 fConvexPath.quadTo(points[3], points[0]);
73 SkPoint points[5] = {{0, SkIntToScalar(-50)} }; local
77 rot.mapPoints(points + i, points + i - 1, 1)
[all...] |
| /external/skia/src/gpu/ |
| GrQuad.h | 15 * GrQuad is a collection of 4 points which can be used to represent an arbitrary quadrilateral
47 SkPoint* points() { function in class:GrQuad
51 const SkPoint* points() const { function in class:GrQuad
|
| GrPathUtils.h | 33 uint32_t quadraticPointCount(const SkPoint points[], SkScalar tol);
39 SkPoint** points,
44 uint32_t cubicPointCount(const SkPoint points[], SkScalar tol);
51 SkPoint** points,
56 // points of the quadratic.
99 // Input is 3 control points and a weight for a bezier conic. Calculates the
111 // result is sets of 3 points in quads.
119 // control points taken together form a convex polygon. It relies on this
154 // Notice that the klm lines are calculated in the same space as the input control points.
155 // If you transform the points the lines will also need to be transformed. This can be don
[all...] |
| /external/valgrind/memcheck/tests/ |
| writev1.stderr.exp-solaris | 2 Syscall param writev(vector[...]) points to unaddressable byte(s)
8 Syscall param writev(vector) points to unaddressable byte(s)
14 Syscall param readv(vector) points to unaddressable byte(s)
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/classifier/ |
| LengthCountClassifier.java | 21 * points. The number of points is subtracted by 2 because the UP event comes in with some delay
23 * of points are punished more (these kind of strokes are usually bad ones and they tend to score
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libwebm/ |
| RELEASE.TXT | 9 * Defined against badly-formatted cue points
21 * Allowed cue points to be loaded incrementally
22 * Implemented to load lazily cue points as they're searched
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdipluspath.h | 50 GraphicsPath(const PointF *points, const BYTE *types, INT count,
55 points, types, count, fillMode, &nativePath);
57 GraphicsPath(const Point *points, const BYTE *types, INT count,
62 points, types, count, fillMode, &nativePath);
135 Status AddBeziers(const PointF *points, INT count)
138 nativePath, points, count));
140 Status AddBeziers(const Point *points, INT count)
143 nativePath, points, count));
145 Status AddClosedCurve(const PointF *points, INT count)
148 nativePath, points, count))
[all...] |
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug281.go | 31 func (o *Obj) Points() [2]Point{
46 q = p.Sub(o.Points()[0])
51 q = p.Sub(o.Points()[x])
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug281.go | 31 func (o *Obj) Points() [2]Point{
46 q = p.Sub(o.Points()[0])
51 q = p.Sub(o.Points()[x])
|
| /external/opencv3/doc/py_tutorials/py_video/py_lucas_kanade/ |
| py_lucas_kanade.markdown | 10 - We will use functions like **cv2.calcOpticalFlowPyrLK()** to track feature points in a
18 displacement vector showing the movement of points from first frame to second. Consider the image
59 Lucas-Kanade method takes a 3x3 patch around the point. So all the 9 points have the same motion. We
60 can find \f$(f_x, f_y, f_t)\f$ for these 9 points. So now our problem becomes solving 9 equations with
76 points to be tracked.)
78 So from user point of view, idea is simple, we give some points to track, we receive the optical
79 flow vectors of those points. But again there are some problems. Until now, we were dealing with
88 simple application which tracks some points in a video. To decide the points, we use
89 **cv2.goodFeaturesToTrack()**. We take the first frame, detect some Shi-Tomasi corner points in it
[all...] |
| /frameworks/base/core/java/android/util/ |
| Spline.java | 20 * Performs spline interpolation given a set of control points.
35 * Creates an appropriate spline based on the properties of the control points.
37 * If the control points are monotonic then the resulting spline will preserve that and
42 throw new IllegalArgumentException("The control points must all have strictly "
54 * Creates a monotone cubic spline from a given set of control points.
57 * Moreover, assuming the control points are monotonic (Y is non-decreasing or
63 * @param x The X component of the control points, strictly increasing.
64 * @param y The Y component of the control points, monotonic.
69 * @throws IllegalArgumentException if the control points are not monotonic.
76 * Creates a linear spline from a given set of control points
[all...] |
| /external/opencv3/modules/features2d/test/ |
| test_nearestneighbors.cpp | 69 virtual int findNeighbors( Mat& points, Mat& neighbors ) = 0;
93 Mat points( pointsCount, dims, CV_32FC1 );
102 points.at<float>(pi, d) = data.at<float>(fi, d) + rng.uniform(0.0f, 1.0f) * noise;
105 code = findNeighbors( points, results );
167 int knnSearch( Mat& points, Mat& neighbors );
168 int radiusSearch( Mat& points, Mat& neighbors );
178 int CV_FlannTest::knnSearch( Mat& points, Mat& neighbors )
180 Mat dist( points.rows, neighbors.cols, CV_32FC1);
184 index->knnSearch( points, neighbors, dist, knn, SearchParams() );
188 for( int i = 0; i < points.rows; i++
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2Collision.cpp | 37 b2Vec2 pointB = b2Mul(xfB, manifold->points[0].localPoint);
46 points[0] = 0.5f * (cA + cB);
58 b2Vec2 clipPoint = b2Mul(xfB, manifold->points[i].localPoint);
61 points[i] = 0.5f * (cA + cB);
74 b2Vec2 clipPoint = b2Mul(xfA, manifold->points[i].localPoint);
77 points[i] = 0.5f * (cA + cB);
81 // Ensure normal points from A to B.
100 b2ContactID id = manifold1->points[i].id;
106 if (manifold2->points[j].id.key == id.key)
117 b2ContactID id = manifold2->points[i].id
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| TrivariateRealGridInterpolator.java | 24 * sample points must be specified on a regular grid.
33 * @param xval All the x-coordinates of the interpolation points, sorted
35 * @param yval All the y-coordinates of the interpolation points, sorted
37 * @param zval All the z-coordinates of the interpolation points, sorted
39 * @param fval the values of the interpolation points on all the grid knots:
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.threshold.min.js | 7 (function($){var options={series:{threshold:null}};function init(plot){function thresholdData(plot,s,datapoints,below,color){var ps=datapoints.pointsize,i,x,y,p,prevp,thresholded=$.extend({},s);thresholded.datapoints={points:[],pointsize:ps,format:datapoints.format};thresholded.label=null;thresholded.color=color;thresholded.threshold=null;thresholded.originSeries=s;thresholded.data=[];var origpoints=datapoints.points,addCrossingPoints=s.lines.show;var threspoints=[];var newpoints=[];var m;for(i=0;i<origpoints.length;i+=ps){x=origpoints[i];y=origpoints[i+1];prevp=p;if(y<below)p=threspoints;else p=newpoints;if(addCrossingPoints&&prevp!=p&&x!=null&&i>0&&origpoints[i-ps]!=null){var interx=x+(below-y)*(x-origpoints[i-ps])/(y-origpoints[i-ps+1]);prevp.push(interx);prevp.push(below);for(m=2;m<ps;++m)prevp.push(origpoints[i+m]);p.push(null);p.push(null);for(m=2;m<ps;++m)p.push(origpoints[i+m]);p.push(interx);p.push(below);for(m=2;m<ps;++m)p.push(origpoints[i+m])}p.push(x);p.push(y);for(m=2;m<ps;++m)p.push(origpoints[i+m])}datapoints.points=newpoints;thresholded.datapoints.points=threspoints;if(thresholded.datapoints.points.length>0){var origIndex=$.inArray(s,plot.getData());plot.getData().splice(origIndex+1,0,thresholde (…) property in class:init.thresholded.datapoints
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btDiscreteCollisionDetectorInterface.h | 24 /// This interface allows to query for closest points and penetration depth between two (convex) objects
25 /// the closest point is on the second object (B), and the normal points from the surface on B towards A.
26 /// distance is between closest points on B and closest point on A. So you can calculate closest point on A
57 // give either closest points (distance > 0) or penetration (distance)
58 // the normal always points from B towards A
|
| /external/mesa3d/src/gallium/state_trackers/vega/ |
| bezier.c | 293 static INLINE VGboolean is_bezier_line(float (*points)[2], int count)
295 float dx13 = points[2][0] - points[0][0];
296 float dy13 = points[2][1] - points[0][1];
298 float dx12 = points[1][0] - points[0][0];
299 float dy12 = points[1][1] - points[0][1];
306 float dx14 = points[3][0] - points[0][0]
340 float points[4][2]; local
[all...] |
| /external/opencv3/samples/cpp/ |
| cout_mat.cpp | 58 vector<Point2f> points(20);
59 for (size_t i = 0; i < points.size(); ++i)
60 points[i] = Point2f((float)(i * 5), (float)(i % 7));
62 cout << "points = " << points << ";" << endl;
|
| /external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/ |
| Utils.h | 18 // Draw a text with the number of entered points
21 // Draw a text with the number of entered points
30 // Draw a text with the number of entered points
33 // Draw the points and the coordinates
36 // Draw only the 2D points
|
