HomeSort by relevance Sort by last modified time
    Searched full:hull (Results 26 - 50 of 113) sorted by null

12 3 4 5

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btConvexPointCloudShape.h 23 ///The btConvexPointCloudShape implements an implicit convex hull of an array of vertices.
btMultiSphereShape.h 26 ///The btMultiSphereShape represents the convex hull of a collection of spheres. You can create special capsules or other smooth volumes.
btCapsuleShape.h 25 ///The btCapsuleShape is a convex hull of two spheres. The btMultiSphereShape is a more general collision shape that takes the convex hull of multiple sphere, so it can also represent a capsule when just using two spheres.
btConvexHullShape.h 24 ///The btConvexHullShape implements an implicit convex hull of an array of vertices.
btConvexTriangleMeshShape.h 23 /// The btConvexTriangleMeshShape is a convex hull of a triangle mesh, but the performance is not as good as btConvexHullShape.
btShapeHull.cpp 96 // free temporary hull result that we just copied
  /frameworks/base/libs/hwui/
SpotShadow.h 48 static int hull(Vector2* points, int pointsLength, Vector2* retPoly);
  /external/opencv3/modules/imgproc/src/
min_enclosing_triangle.cpp 330 //! Create the convex hull of the given set of points
333 * @param polygon The polygon representing the convex hull of the points
352 * @param polygon The polygon representing the convex hull of the points
391 * @param polygon The polygon representing the convex hull of the points
448 * @param polygon The polygon representing the convex hull of the points
467 * @param polygon The polygon representing the convex hull of the points
485 * @param polygon The polygon representing the convex hull of the points
509 * @param polygon The polygon representing the convex hull of the points
533 * @param polygon The polygon representing the convex hull of the points
558 * @param polygon The polygon representing the convex hull of the point
    [all...]
  /external/opencv3/modules/imgproc/test/
test_convhull.cpp 417 * Convex Hull Test *
543 CvMat* hull = 0; local
566 hull = cvCreateMat( 1, hull_count, CV_32FC2 );
571 h = (CvPoint2D32f*)(hull->data.ptr);
573 // extract convex hull points
576 cvCvtSeqToArray( hseq, hull->data.ptr );
579 CvMat tmp = cvMat( hull->rows, hull->cols, CV_32SC2, hull->data.ptr );
580 cvConvert( &tmp, hull );
    [all...]
  /external/opencv3/samples/cpp/
select3dobj.cpp 177 vector<Point> hull;
178 convexHull(Mat_<Point>(Mat(imgpt)), hull);
180 fillConvexPoly(selectedObjMask, &hull[0], (int)hull.size(), Scalar::all(255), 8, 0);
181 Rect roi = boundingRect(Mat(hull)) & Rect(Point(), frame.size());
186 fillConvexPoly(selectedObjMask, &hull[0], (int)hull.size(), Scalar::all(GC_PR_FGD), 8, 0);
  /external/opencv3/modules/features2d/src/
blobdetector.cpp 260 std::vector < Point > hull; local
261 convexHull(Mat(contours[contourIdx]), hull); local
263 double hullArea = contourArea(Mat(hull));
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/
b2PolygonShape.h 39 /// Create a convex hull from the given array of local points.
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
DelaunayTriangulator.java 335 /** Removes all triangles with a centroid outside the specified hull, which may be concave. Note some triangulations may have
336 * triangles whose centroid is inside the hull but a portion is outside. */
337 public void trim (ShortArray triangles, float[] points, float[] hull, int offset, int count) {
345 if (!Intersector.isPointInPolygon(hull, offset, count, centroid.x, centroid.y)) {
  /external/opencv/cv/include/
cvcompat.h 381 /* Calculates exact convex hull of 2d point set */
384 int orientation, int* hull, int* hullsize )
387 CvMat hull1 = cvMat( 1, num_points, CV_32SC1, hull );
393 /* Calculates exact convex hull of 2d point set stored in a sequence */
397 /* Calculates approximate convex hull of 2d point set */
399 orientation, hull, hullsize ) \
400 cvConvexHull( points, num_points, bound_rect, orientation, hull, hullsize )
402 /* Calculates approximate convex hull of 2d point set stored in a sequence */
    [all...]
cvtypes.h 129 CvPoint* depth_point; /* the farthest from the convex hull point within the defect */
130 float depth; /* distance between the farthest point and the convex hull */
  /bionic/libm/upstream-freebsd/lib/msun/src/
catrig.c 46 A_crossover = 10, /* Hull et al suggest 1.5, but 10 works better */
47 B_crossover = 0.6417, /* suggested by Hull et al */
86 * and arccosine functions using exception handling" by T. E. Hull, Thomas F.
117 * produce overflows or underflows. This is dealt with in the paper by Hull
123 * Hull et al, but the idea may be found on pages 308 and 309. Introducing the
156 double R, S, A; /* A, B, R, and S are as in Hull et al. */
  /external/opencv/cv/src/
cvrotcalipers.cpp 65 // points - convex hull vertices ( any orientation )
148 /* find convex hull orientation */
402 "Convex hull must have valid pointer to point sequence stored in v_prev" );
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/
LinearMath.java 342 public static void GrahamScanConvexHull2D(SWIGTYPE_p_btAlignedObjectArrayT_GrahamVector3_t originalPoints, SWIGTYPE_p_btAlignedObjectArrayT_GrahamVector3_t hull, Vector3 normalAxis) {
343 LinearMathJNI.GrahamScanConvexHull2D(SWIGTYPE_p_btAlignedObjectArrayT_GrahamVector3_t.getCPtr(originalPoints), SWIGTYPE_p_btAlignedObjectArrayT_GrahamVector3_t.getCPtr(hull), normalAxis);
  /external/ImageMagick/
AUTHORS.txt 131 Inventor of the eight hull algorithm used for speckle reduction.
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/
btSoftBodyHelpers.h 114 /* Create from convex-hull */
  /external/opencv/cvaux/src/
cvbgfg_common.cpp 100 else //Convex Hull of the segmentation
  /external/opencv3/doc/tutorials/imgproc/
table_of_content_imgproc.markdown 180 Where we learn how to get hull contours and draw them!
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btConvexHullComputer.cpp 50 // Convex hull implementation based on Preparata and Hong
1323 printf(" Hull\n");
2057 IntermediateHull hull; local
2655 btConvexHullInternal hull; local
    [all...]
  /external/opencv3/modules/imgproc/misc/java/test/
ImgprocTest.java 425 MatOfInt hull = new MatOfInt(); local
427 Imgproc.convexHull(points, hull);
432 assertMatEqual(expHull, hull, EPS);
445 MatOfInt hull = new MatOfInt(); local
447 Imgproc.convexHull(points, hull, true);
452 assertMatEqual(expHull, hull, EPS);
465 MatOfInt hull = new MatOfInt(); local
466 Imgproc.convexHull(points, hull);
469 Imgproc.convexityDefects(points, hull, convexityDefects);
    [all...]
  /external/opencv3/modules/imgproc/include/opencv2/imgproc/
types_c.h 522 CvPoint* depth_point; /**< the farthest from the convex hull point within the defect */
523 float depth; /**< distance between the farthest point and the convex hull */

Completed in 820 milliseconds

12 3 4 5