HomeSort by relevance Sort by last modified time
    Searched full:points (Results 426 - 450 of 7862) sorted by null

<<11121314151617181920>>

  /external/opencv/cv/src/
cvposit.cpp 54 static CvStatus icvCreatePOSITObject( CvPoint3D32f *points,
73 if( points == NULL )
94 * Construct object vectors from object points *
98 pObject->obj_vecs[i] = points[i + 1].x - points[0].x;
99 pObject->obj_vecs[N + i] = points[i + 1].y - points[0].y;
100 pObject->obj_vecs[2 * N + i] = points[i + 1].z - points[0].z;
335 cvCreatePOSITObject( CvPoint3D32f * points, int numPoints
    [all...]
  /external/opencv3/doc/tutorials/imgproc/imgtrans/warp_affine/
warp_affine.markdown 68 between points.
71 case in which it relates three points in both images. Look at the figure below:
75 the points 1, 2 and 3 (forming a triangle in image 1) are mapped into image 2, still forming a
77 3 points (you can choose them as you like), then we can apply this found relation to the whole
86 between three points. We use the function @ref cv::warpAffine for that purpose.
99 points to store the 2D points that define our Affine Transform.
116 -# **Affine Transform:** As we explained lines above, we need two sets of 3 points to derive the
127 You may want to draw the points to make a better idea of how they change. Their locations are
129 may note that the size and orientation of the triangle defined by the 3 points change
    [all...]
  /external/opencv3/modules/calib3d/src/
posit.cpp 55 static CvStatus icvCreatePOSITObject( CvPoint3D32f *points,
74 if( points == NULL )
95 * Construct object vectors from object points *
99 pObject->obj_vecs[i] = points[i + 1].x - points[0].x;
100 pObject->obj_vecs[N + i] = points[i + 1].y - points[0].y;
101 pObject->obj_vecs[2 * N + i] = points[i + 1].z - points[0].z;
336 cvCreatePOSITObject( CvPoint3D32f * points, int numPoints
    [all...]
  /external/skia/include/core/
SkPath.h 51 * The out points are a weighted average of this path and the ending path.
54 * @param weight The weight, from 0 to 1. The output points are set to
55 * (this->points * weight) + ending->points * (1 - weight).
215 * Returns true if all of the points in this path are finite, meaning there
272 * points in line[] to the end-points of the line. If the path is not a
277 /** Return the number of points in the path
287 /** Returns the number of points in the path. Up to max points are copied
    [all...]
  /frameworks/base/libs/hwui/
SpotShadow.cpp 107 * Calculate the intersection of a ray with the line segment defined by two points.
141 * Sort points by their X coordinates
143 * @param points the points as a Vector2 array.
146 void SpotShadow::xsort(Vector2* points, int pointsLength) {
150 std::sort(points, points + pointsLength, cmp);
154 * compute the convex hull of a collection of Points
156 * @param points the points as a Vector2 array
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/data/
LocationClustering.java 87 final ArrayList<Point> points = new ArrayList<Point>(); local
93 points.add(new Point(s.lat, s.lng));
105 pointsArray = points.toArray(pointsArray);
201 // Input: n points
204 private static int[] kMeans(Point points[], int[] bestK) {
205 int n = points.length;
212 Point[] groupSum = new Point[maxK]; // sum of points in each group.
213 int[] groupCount = new int[maxK]; // number of points in each group.
233 // step 1: (arbitrarily) pick k points as the initial centers.
236 Point p = points[i * delta]
    [all...]
  /cts/tests/tests/gesture/src/android/gesture/cts/
GestureComparator.java 56 Assert.assertTrue(Arrays.equals(expectedStroke.points, observedStroke.points));
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
MultivariateRealInterpolator.java 33 * @param xval the arguments for the interpolation points.
38 * @param yval the values for the interpolation points
UnivariateRealInterpolator.java 31 * @param xval the arguments for the interpolation points
32 * @param yval the values for the interpolation points
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
PolynomialSplineFunction.java 32 * <i>knot points</i>, determining the intervals over which the spline function
35 * points. The value consistency constraints are not currently enforced by
37 * the polynomials and knot points passed to the constructor.</p>
40 * centered on the knot points to compute the spline function values.
78 * = number of partition points - 1
172 * = the number of knot points - 1.
195 * Returns an array copy of the knot points.
200 * @return the knot points
  /external/chromium-trace/catapult/dashboard/dashboard/templates/
load_from_prod.html 22 Number of points:
40 Number of points: <input name="num_points"
  /external/chromium-trace/catapult/third_party/flot/
jquery.flot.symbol.min.js 7 (function($){function processRawData(plot,series,datapoints){var handlers={square:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(Math.PI)/2;ctx.rect(x-size,y-size,size+size,size+size)},diamond:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(Math.PI/2);ctx.moveTo(x-size,y);ctx.lineTo(x,y-size);ctx.lineTo(x+size,y);ctx.lineTo(x,y+size);ctx.lineTo(x-size,y)},triangle:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(2*Math.PI/Math.sin(Math.PI/3));var height=size*Math.sin(Math.PI/3);ctx.moveTo(x-size/2,y+height/2);ctx.lineTo(x+size/2,y+height/2);if(!shadow){ctx.lineTo(x,y-height/2);ctx.lineTo(x-size/2,y+height/2)}},cross:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(Math.PI)/2;ctx.moveTo(x-size,y-size);ctx.lineTo(x+size,y+size);ctx.moveTo(x-size,y+size);ctx.lineTo(x+size,y-size)}};var s=series.points.symbol;if(handlers[s])series.points.symbol=handlers[s]}function init(plot){plot.hooks.processDatapoints.push(processRawData)}$.plot.pl (…)
  /external/compiler-rt/test/tsan/
stack_sync_reuse.cc 6 // It is false because when acquire is done syncp points to a var in one frame,
7 // and during release it points to a var in a different frame.
  /external/compiler-rt/test/ubsan/TestCases/TypeCheck/
misaligned.cpp 46 // CHECK-LOAD-NEXT: [[PTR]]: note: pointer points here
58 // CHECK-STORE-NEXT: [[PTR]]: note: pointer points here
66 // CHECK-REFERENCE-NEXT: [[PTR]]: note: pointer points here
74 // CHECK-MEMBER-NEXT: [[PTR]]: note: pointer points here
81 // CHECK-MEMFUN-NEXT: [[PTR]]: note: pointer points here
88 // CHECK-NEW-NEXT: [[PTR]]: note: pointer points here
95 // CHECK-UPCAST-NEXT: [[PTR]]: note: pointer points here
104 // CHECK-WILD-NEXT: 0x{{0+}}123: note: pointer points here
  /external/guice/core/src/com/google/inject/spi/
ConstructorBinding.java 41 * Returns all instance method and field injection points on {@code type}.
43 * @return a possibly empty set of injection points. The set has a specified iteration order. All
  /external/icu/icu4c/source/test/intltest/
sfwdchit.h 50 * no more code points to return, returns DONE.
55 * Returns FALSE if there are no more code units or code points
  /external/libpcap/
pcap_offline_filter.3pcap 44 points to the
48 points to the data in the packet.
  /external/llvm/test/CodeGen/X86/
ins_split_regalloc.ll 15 ; Check that we do not have useless split points before each call.
18 ; Check that we do not have useless split points before each call.
  /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/
SyncSampleBox.java 28 * This box provides a compact marking of the random access points withinthe stream. The table is arranged in
41 * Gives the numbers of the samples that are random access points in the stream.
  /external/opencv3/modules/calib3d/include/opencv2/
calib3d.hpp 55 formed by projecting 3D points into the image plane using a perspective transformation.
120 - Project 3D points to the image plane given intrinsic and extrinsic parameters.
121 - Compute extrinsic parameters given intrinsic parameters, a few 3D points, and their
261 @param srcPoints Coordinates of the points in the original plane, a matrix of the type CV_32FC2
263 @param dstPoints Coordinates of the points in the target plane, a matrix of the type CV_32FC2 or
266 - **0** - a regular method using all the points
438 /** @brief Projects 3D points to an image plane.
440 @param objectPoints Array of object points, 3xN/Nx3 1-channel or 1xN/Nx1 3-channel (or
441 vector\<Point3f\> ), where N is the number of points in the view.
448 @param imagePoints Output array of image points, 2xN/Nx2 1-channel or 1xN/Nx1 2-channel, o
    [all...]
  /external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/
main_registration.cpp 39 // Setup the points to register in the image
118 // Set the number of points to register
125 // Loop until all the points are registered
131 // Current registered points
135 // Draw current registered points
166 // The list of registered points
170 // Estimate pose given the registered points
176 // Compute all the 2D points of the mesh to verify the algorithm and draw it
  /external/opencv3/samples/cpp/tutorial_code/features2D/AKAZE_tracking/
utils.h 14 vector<Point2f> Points(vector<KeyPoint> keypoints);
50 vector<Point2f> Points(vector<KeyPoint> keypoints)
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue177/
PointBeanTest.java 32 assertEquals("Cannot create property=points for JavaBean=All Points\n"
  /external/valgrind/memcheck/tests/darwin/
aio.stderr.exp 3 Syscall param aio_read(aiocbp->aio_buf) points to unaddressable byte(s)
11 Syscall param aio_write(aiocbp->aio_buf) points to unaddressable byte(s)
  /packages/apps/Settings/src/com/android/settings/widget/
ChartAxis.java 30 /** Set range of screen points this axis should cover. */
44 /** Return list of tick points for drawing a grid. */

Completed in 1332 milliseconds

<<11121314151617181920>>