| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btConvexShape.cpp | 73 static btVector3 convexHullSupport (const btVector3& localDirOrg, const btVector3* points, int numPoints, const btVector3& localScaling)
88 vec_float4 p0 = vec_dot3(points[v ].get128(),localDir.get128());
89 vec_float4 p1 = vec_dot3(points[v+1].get128(),localDir.get128());
90 vec_float4 p2 = vec_dot3(points[v+2].get128(),localDir.get128());
91 vec_float4 p3 = vec_dot3(points[v+3].get128(),localDir.get128());
110 vec_float4 p = vec_dot3(points[v].get128(),localDir.get128());
117 const btVector3& supVec= points[ptIndex] * localScaling;
122 long ptIndex = vec.maxDot( points, numPoints, maxDot);
124 btVector3 supVec = points[ptIndex] * localScaling;
283 btVector3* points = convexPointCloudShape->getUnscaledPoints () local
290 btVector3* points = convexHullShape->getUnscaledPoints(); local
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/math/collision/ |
| BoundingBox.java | 26 * bounding box's center, dimensions and corner points.
163 /** Sets the bounding box minimum and maximum vector from the given points.
165 * @param points The points.
167 public BoundingBox set (Vector3[] points) {
169 for (Vector3 l_point : points)
174 /** Sets the bounding box minimum and maximum vector from the given points.
176 * @param points The points.
178 public BoundingBox set (List<Vector3> points) {
[all...] |
| /external/libweave/third_party/chromium/base/third_party/icu/ |
| icu_utf.h | 33 * (take or) return single code points (UChar32).
66 * Code points that are not characters include:
67 * - single surrogate code points (U+d800..U+dfff, 2048 code points)
68 * - the last two code points on each plane (U+__fffe and U+__ffff, 34 code points)
69 * - U+fdd0..U+fdef (new with Unicode 3.1, 32 code points)
72 * This means that all code points below U+d800 are character code points,
183 * If the offset points to a trail byte or an illegal UTF-8 sequence, the
[all...] |
| /external/ceres-solver/examples/ |
| bal_problem.cc | 124 // Copy the rest of the points.
168 const double* points = parameters_ + camera_block_size() * num_cameras_; local
170 const double* point = points + i * point_block_size();
219 double* points = mutable_points(); local
222 tmp[j] = points[3 * j + i];
228 VectorRef point(points + 3 * i, 3);
244 VectorRef point(points + 3 * i, 3);
267 double* points = mutable_points(); local
270 PerturbPoint3(point_sigma, points + 3 * i);
|
| /external/icu/icu4c/source/test/intltest/ |
| idnaref.h | 45 * If TRUE unassigned values are treated as normal Unicode code points.
57 * too many code points.
83 * If TRUE unassigned values are treated as normal Unicode code points.
95 * too many code points.
126 * If TRUE unassigned values are treated as normal Unicode code points.
138 * too many code points.
165 * If TRUE unassigned values are treated as normal Unicode code points.
177 * too many code points.
205 * If TRUE unassigned values are treated as normal Unicode code points.
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| gim_tri_collision.h | 76 //! classify points that are closer
79 GREAL margin, const btVector3 * points, GUINT point_count, DISTANCE_FUNC distance_func)
90 GREAL _dist = -distance_func(plane,points[_k]) + margin;
110 m_points[_k] = points[point_indices[_k]];
114 //! classify points that are closer
116 const btVector3 * points, GUINT point_count)
119 mergepoints_generic(plane, margin, points, point_count, DISTANCE_PLANE_3D_FUNC());
194 \param contact_data Structure for holding contact points, normal and penetration depth; The normal is pointing toward this triangle from the other triangle
203 \param contact_data Structure for holding contact points, normal and penetration depth; The normal is pointing toward this triangle from the other triangle
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 39 static boolean points( unsigned prim ) function
79 /* Don't have to worry about triangles turning into lines/points
98 if (points(prim))
100 /* large points */
104 /* sprite points */
109 /* AA points */
176 /* drawing large/sprite points (but not AA points)? */
192 * shorter pipelines for lines & points.
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contour_features/ |
| py_contour_features.markdown | 94 hull = cv2.convexHull(points[, hull[, clockwise[, returnPoints]]
98 - **points** are the contours we pass into.
102 - **returnPoints** : By default, True. Then it returns the coordinates of the hull points. If
103 False, it returns the indices of contour points corresponding to the hull points.
112 [[[234 202]], [[ 51 202]], [[ 51 79]], [[234 79]]] which are the four corner points of rectangle.
114 These are the indices of corresponding points in contours. For eg, check the first value:
188 Similarly we can fit a line to a set of points. Below image contains a set of white points. We can
|
| /external/opencv3/doc/tutorials/ml/introduction_to_svm/ |
| introduction_to_svm.markdown | 21 For a linearly separable set of 2D-points which belong to one of two classes, find a separating
26 @note In this example we deal with lines and points in the Cartesian plane instead of hyperplanes
34 the worth of the lines: <em> A line is bad if it passes too close to the points because it will be
36 the line passing as far as possible from all points.
104 The training data of this exercise is formed by a set of labeled 2D-points that belong to one of
105 two different classes; one of the classes consists of one point and the other of three points.
156 by the SVM. In other words, an image is traversed interpreting its pixels as points of the
157 Cartesian plane. Each of the points is colored depending on the class predicted by the SVM; in
174 - The code opens an image and shows the training examples of both classes. The points of one class
|
| /external/opencv3/samples/cpp/tutorial_code/ml/non_linear_svms/ |
| non_linear_svms.cpp | 43 // Generate random points for the class 1
45 // The x coordinate of the points is in [0, 0.4)
48 // The y coordinate of the points is in [0, 1)
52 // Generate random points for the class 2
54 // The x coordinate of the points is in [0.6, 1]
57 // The y coordinate of the points is in [0, 1)
64 // Generate random points for the classes 1 and 2
66 // The x coordinate of the points is in [0.4, 0.6)
69 // The y coordinate of the points is in [0, 1)
|
| /external/replicaisland/tools/ |
| ExtractPoints.js | 23 * path in the file must be closed and may not contain any curved points
24 * (the tool assumes that the line between any two points in a given path is
65 var points = item.pathPoints;
71 for (var y = 0; y < points.length; y++) {
72 var firstPoint = points[y];
73 var lastPoint = points[(y + 1) % points.length];
114 totalX /= points.length;
115 totalY /= points.length;
|
| /external/skia/src/pathops/ |
| SkPathOpsTypes.h | 489 inline SkPath::Verb SkPathOpsPointsToVerb(int points) {
490 int verb = (1 << points) >> 1;
492 switch (points) {
504 int points = (int) verb - (((int) verb + 1) >> 2); local
507 case SkPath::kLine_Verb: SkASSERT(1 == points); break;
508 case SkPath::kQuad_Verb: SkASSERT(2 == points); break;
509 case SkPath::kConic_Verb: SkASSERT(2 == points); break;
510 case SkPath::kCubic_Verb: SkASSERT(3 == points); break;
514 return points;
|
| /hardware/akm/AK8975_FS/akmdfs/AKFS_APIs_8975/ |
| AKFS_AOC.c | 45 const AKFVEC points[], /*! (i/o) : input vectors */
68 dif[i][j] = points[i].v[j] - points[3].v[j];
69 r2[i] += (points[i].v[j]*points[i].v[j]
70 - points[3].v[j]*points[3].v[j]);
110 *r = CalcR(&points[0], center);
264 /* get 4 points */
|
| /prebuilts/go/darwin-x86/src/unicode/ |
| letter.go | 6 // Unicode code points.
14 ReplacementChar = '\uFFFD' // Represents invalid code points.
19 // RangeTable defines a set of Unicode code points by listing the ranges of
20 // code points within the set. The ranges are listed in two slices
30 // Range16 represents of a range of 16-bit Unicode code points. The range runs from Lo to Hi
38 // Range32 represents of a range of Unicode code points and is used when one or
47 // CaseRange represents a range of Unicode code points for simple (one
319 // SimpleFold iterates over Unicode code points equivalent under
320 // the Unicode-defined simple case folding. Among the code points
|
| /prebuilts/go/linux-x86/src/unicode/ |
| letter.go | 6 // Unicode code points.
14 ReplacementChar = '\uFFFD' // Represents invalid code points.
19 // RangeTable defines a set of Unicode code points by listing the ranges of
20 // code points within the set. The ranges are listed in two slices
30 // Range16 represents of a range of 16-bit Unicode code points. The range runs from Lo to Hi
38 // Range32 represents of a range of Unicode code points and is used when one or
47 // CaseRange represents a range of Unicode code points for simple (one
319 // SimpleFold iterates over Unicode code points equivalent under
320 // the Unicode-defined simple case folding. Among the code points
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| CurveFitter.java | 35 * observed points (x<sub>0</sub>, y<sub>0</sub>), (x<sub>1</sub>,
48 /** Observed points. */
96 /** Get the observed points.
97 * @return observed points
115 * fit the sample of observed points previously given through calls
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_Structs.h | 21 * xsup(s) points to the beginning of the s-th supernode.
28 * rectangular supernodes; xlsub[j] points to the starting
56 * rectangular supernodes; xlusup[j] points to the starting
65 * xusub[i] points to the starting location of column i in ucol.
79 IndexVector xsup; //First supernode column ... xsup(s) points to the beginning of the s-th supernode
|
| /external/icu/icu4c/source/common/unicode/ |
| ucnvsel.h | 54 * If excludedCodePoints is NULL, don't exclude any code points.
62 * @param excludedCodePoints a set of code points to be excluded from consideration.
63 * That is, excluded code points in a string do not change
151 * ignoring the excluded code points.
169 * ignoring the excluded code points.
|
| /external/icu/icu4c/source/test/perf/perldriver/ |
| Dataset.pm | 70 # mean+/-error. The new Dataset has no data points.
88 # mean+/-error. The new Dataset has no data points.
101 # mean+/-error. The new Dataset has no data points.
114 # The new Dataset has no data points.
127 # The new Dataset has no data points.
|
| /external/icu/icu4c/source/tools/toolutil/ |
| uparse.h | 71 * points to the beginning of the field, while the limit pointer in fields[i][1]
72 * points behind the field, i.e., to the delimiter or the line end.
90 * Parse a string of code points like 0061 0308 0300.
93 * @return Number of code points.
101 * Parse a list of code points like 0061 0308 0300
|
| /external/icu/icu4j/perf-tests/perldriver/ |
| Dataset.pm | 70 # mean+/-error. The new Dataset has no data points.
88 # mean+/-error. The new Dataset has no data points.
101 # mean+/-error. The new Dataset has no data points.
114 # The new Dataset has no data points.
127 # The new Dataset has no data points.
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Plane.java | 28 * which the normal points.
63 /** Constructs a new plane out of the three given points that are considered to be on the plane. The normal is calculated via a
73 /** Sets the plane normal and distance to the origin based on the three given points which are considered to be on the plane.
104 * plane normal points to.
120 * plane normal points to.
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/ |
| RateShareEntry.java | 39 * Target rate share may be specified for several operation points that are defined in terms of the total available
41 * applies to all available bitrates. If several operation points are defined, then each operation point specifies a
42 * target rate share. Target rate share values specified for the first and the last operation points also specify the
44 * operation points is specified to be in the range between the target rate shares of those operation points. One
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_feature_homography/ |
| py_feature_homography.markdown | 14 So what we did in last session? We used a queryImage, found some feature points in it, we took
20 of points from both the images, it will find the perpective transformation of that object. Then we
21 can use **cv2.perspectiveTransform()** to find the object. It needs atleast four correct points to
27 **cv2.findHomography()** returns a mask which specifies the inlier and outlier points.
72 it to transform the corners of queryImage to corresponding points in trainImage. Then we draw it.
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_orb/ |
| py_orb.markdown | 21 find top N points among them. It also use pyramid to produce multiscale-features. But one problem is
38 the correct set of points \f$S_\theta\f$ will be used to compute its descriptor.
59 decides number of points that produce each element of the oriented BRIEF descriptor. By default it
60 is two, ie selects two points at a time. In that case, for matching, NORM_HAMMING distance is used.
61 If WTA_K is 3 or 4, which takes 3 or 4 points to produce BRIEF descriptor, then matching distance
|
