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

<<21222324252627282930>>

  /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/joints/
PrismaticJointDef.java 24 * local anchor points and a local axis so that the initial configuration can violate the constraint slightly. The joint
25 * translation is zero when the local anchor points coincide in world space. Using local anchors and a local axis helps when
WheelJointDef.java 24 * anchor points and a local axis so that the initial configuration can violate the constraint slightly. The joint translation is
25 * zero when the local anchor points coincide in world space. Using local anchors and a local axis helps when saving and loading a
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/
ContactListener.java 29 * detect changes. Note: this is called only for awake bodies. Note: this is called even when the number of contact points is
30 * zero. Note: this is not called for sensors. Note: if you set the number of contact points to zero, you will not get an
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btBoxBoxCollisionAlgorithm.cpp 71 // refreshContactPoints is only necessary when using persistent contact points. otherwise all points are newly added
  /external/libgdx/gdx/src/com/badlogic/gdx/math/collision/
Segment.java 36 /** Constructs a new Segment from the two points given.
45 /** Constructs a new Segment from the two points given.
  /external/libunwind/src/arm/
Gis_signal_frame.c 73 /* Return 1 if the IP points to a non-RT sigreturn sequence. */
76 /* Return 2 if the IP points to a RT sigreturn sequence. */
  /external/opencv3/3rdparty/openexr/IlmImf/
ImfMisc.h 129 // readPtr initially points to the beginning of the
133 // readPtr points just past the end of the
162 // readPtr initially points to the beginning of the data to be skipped;
163 // when skipChannel() returns, readPtr points just past the end of the
200 // writePtr initially points to the beginning of the
204 // writePtr points just past the end of the
234 // writePtr initially points to the beginning of the
237 // points just past the end of the zeroed
  /external/opencv3/doc/tutorials/features2d/
table_of_content_features2d.markdown 4 Learn about how to use the feature points detectors, descriptors and matching framework found inside
46 In this tutorial, you will use *features2d* to detect interest points.
  /external/opencv3/doc/tutorials/ml/introduction_to_pca/
introduction_to_pca.markdown 18 Consider that you have a set of 2D points as it is shown in the figure above. Each dimension corresponds to a feature you are interested in. Here some could argue that the points are set in a random order. However, if you have a better look you will see that there is a linear pattern (indicated by the blue line) which is hard to dismiss. A key point of PCA is the Dimensionality Reduction. Dimensionality Reduction is the process of reducing the number of the dimensions of the given dataset. For example, in the above case it is possible to approximate the set of points to a single line and therefore, reduce the dimensionality of the given points from 2D to 1D.
20 Moreover, you could also see that the points vary the most along the blue line, more than they vary along the Feature 1 or Feature 2 axes. This means that if you know the position of a point along the blue line you have more information about the point than if you only knew where it was on Feature 1 axis or Feature 2 axis.
22 Hence, PCA allows us to find the direction along which our data varies the most. In fact, the result of running PCA on the set of points in the diagram consist of 2 vectors called _eigenvectors_ which are the _principal components_ of the data set.
26 The size of each eigenvector is encoded in the corresponding eigenvalue and indicates how much the data vary along the principal component. The beginning of the eigenvectors is the center of all points in the data set. Applying PCA to N-dimensional data set yields N N-dimensional eigenvectors, N eigenvalues and 1 N-dimensional center point. Enough theory, let?s see how we can put these ideas into code.
118 First the data need to be arranged in a matrix with size n x 2, where n is the number of data points we have. Then we can perform that PCA analysis. The calculated mean (i.e. center of mass) is stored in the _cntr_ variable and the eigenvectors and eigenvalues are stored in the corresponding std::vector?s.
  /external/opencv3/modules/calib3d/src/
rho.h 144 * (x,y) points. Points with corresponding offsets in the two arrays constitute
146 * best maps the homogeneous-coordinate points in the source array to their
147 * corresponding homogeneous-coordinate points in the destination array.
221 * @param [in] src The pointer to the source points of the matches.
223 * @param [in] dst The pointer to the destination points of the matches.
245 const float* src, /* Source points */
246 const float* dst, /* Destination points */
  /external/opencv3/modules/viz/src/vtk/
vtkCloudMatSource.cpp 168 output->SetPoints(points);
186 points = vtkSmartPointer<vtkPoints>::New();
187 points->SetDataType(VtkDepthTraits<_Tp>::data_type);
188 points->Allocate((vtkIdType)cloud.total());
189 points->SetNumberOfPoints((vtkIdType)cloud.total());
200 points->SetPoint(total++, srow);
202 points->SetNumberOfPoints(total);
203 points->Squeeze();
  /external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/
Utils.cpp 38 // Draw a text with the number of entered points
44 // Draw a text with the number of entered points
66 // Draw a text with the number of entered points
71 std::string text = n_str + " of " + n_max_str + " points";
75 // Draw the points and the coordinates
83 // Draw Selected points
98 // Draw only the 2D points
105 // Draw Selected points
  /external/proguard/docs/manual/
introduction.html 92 <h3>Entry points</h3>
95 discarded or obfuscated, you have to specify one or more <i>entry points</i> to
96 your code. These entry points are typically classes with main methods, applets,
104 Among other optimizations, classes and methods that are not entry points
109 that are not entry points. In this entire process, keeping the entry
110 points ensures that they can still be accessed by their original names.</li>
113 the entry points.</li>
125 entry points too. For example, <code>Class.forName()</code> constructs may
  /external/skia/include/c/
sk_path.h 51 Add a cubic bezier from the last point, approaching control points
77 * else return true and set the rect parameter to the bounds of the control-points
  /external/valgrind/memcheck/tests/solaris/
scalar_lwp_name.stderr.exp 13 Syscall param lwp_name(name) points to unaddressable byte(s)
32 Syscall param lwp_name(name) points to unaddressable byte(s)
scalar_utimensat.stderr.exp 16 Syscall param utimensat(path) points to unaddressable byte(s)
20 Syscall param utimensat(times) points to unaddressable byte(s)
  /external/webrtc/webrtc/modules/audio_processing/
debug.proto 22 // float deinterleaved data, where each repeated element points to a single
38 // float deinterleaved data, where each repeated element points to a single
  /external/zopfli/src/zopfli/
zopfli.h 55 If true, chooses the optimal block split points only after doing the iterative
56 LZ77 compression. If false, chooses the block split points first, then does
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/
omxVCM4P2_EncodeVLCZigzag_Inter.c 68 * it points to the current byte in the bit stream buffer.
69 * pBitOffset - *pBitOffset is updated so that it points to the current bit
  /frameworks/base/core/java/android/transition/
PathMotion.java 47 * Provide a Path to interpolate between two points <code>(startX, startY)</code> and
54 * @return A Path along which the points should be interpolated. The returned Path
  /frameworks/base/libs/androidfw/
TypeWrappers.cpp 51 ALOGE("Index %u points to entry with unaligned offset 0x%08x", mIndex, entryOffset);
58 ALOGE("Entry offset at index %u points outside the Type's boundaries", mIndex);
  /frameworks/base/packages/SystemUI/src/com/android/systemui/classifier/
Point.java 61 * Calculates the angle in radians created by points (a, this, b). If any two of these points
  /frameworks/opt/photoviewer/src/com/android/ex/photo/provider/
PhotoContract.java 37 * This column is a {@link Uri} that points to the downloaded local file.
42 * This column is a {@link Uri} that points to a thumbnail of the image
  /hardware/qcom/msm8x26/original-kernel-headers/sound/
lsm_params.h 120 * @params: Points to an array of lsm_params_info
121 * Each entry points to one parameter to set
  /prebuilts/tools/common/proguard/proguard4.7/docs/manual/
introduction.html 91 <h3>Entry points</h3>
94 discarded or obfuscated, you have to specify one or more <i>entry points</i> to
95 your code. These entry points are typically classes with main methods, applets,
103 Among other optimizations, classes and methods that are not entry points
108 that are not entry points. In this entire process, keeping the entry
109 points ensures that they can still be accessed by their original names.</li>
112 the entry points.</li>
124 entry points too. For example, <code>Class.forName()</code> constructs may

Completed in 3613 milliseconds

<<21222324252627282930>>