HomeSort by relevance Sort by last modified time
    Searched defs:hull (Results 1 - 21 of 21) sorted by null

  /external/opencv3/samples/cpp/
convexhull.cpp 39 vector<int> hull; local
40 convexHull(Mat(points), hull, true); local
46 int hullcount = (int)hull.size();
47 Point pt0 = points[hull[hullcount-1]];
51 Point pt = points[hull[i]];
56 imshow("hull", img);
  /external/opencv3/samples/cpp/tutorial_code/ShapeDescriptors/
hull_demo.cpp 65 /// Find the convex hull object for each contour
66 vector<vector<Point> >hull( contours.size() );
68 { convexHull( Mat(contours[i]), hull[i], false ); } local
70 /// Draw contours + hull results
76 drawContours( drawing, hull, (int)i, color, 1, 8, vector<Vec4i>(), 0, Point() );
80 namedWindow( "Hull demo", WINDOW_AUTOSIZE );
81 imshow( "Hull demo", drawing );
  /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/bullet/
ConvexHullTest.java 60 final btShapeHull hull = new btShapeHull(shape);
61 hull.buildHull(shape.getMargin());
62 final btConvexHullShape result = new btConvexHullShape(hull);
65 hull.dispose();
ConvexHullDistanceTest.java 104 final btShapeHull hull = new btShapeHull(shape);
105 hull.buildHull(shape.getMargin());
106 final btConvexHullShape result = new btConvexHullShape(hull);
109 hull.dispose();
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
ConvexHull.java 23 /** Computes the convex hull of a set of points using the monotone chain convex hull algorithm (aka Andrew's algorithm).
28 private final FloatArray hull = new FloatArray(); field in class:ConvexHull
42 /** Returns a list of points on the convex hull in counter-clockwise order. Note: the last point in the returned list is the
44 /** Returns the convex hull polygon for the given point cloud.
47 * hull algorithm. If sorting is done the input array is not modified and count additional working memory is needed.
48 * @return pairs of coordinates that describe the convex hull polygon in counterclockwise order. Note the returned array is
61 FloatArray hull = this.hull; local
62 hull.clear();
112 FloatArray hull = this.hull; local
154 FloatArray hull = this.hull; local
    [all...]
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/
b2PolygonShape.cpp 163 // Create the convex hull using the Gift wrapping algorithm
166 // Find the right most point on the hull
179 int32 hull[b2_maxPolygonVertices]; local
185 hull[m] = ih;
196 b2Vec2 r = ps[ie] - ps[hull[m]];
197 b2Vec2 v = ps[j] - ps[hull[m]];
233 m_vertices[i] = ps[hull[i]];
  /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-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btPolyhedralConvexShape.cpp 200 //do the merge: use Graham Scan 2d convex hull
239 btAlignedObjectArray<GrahamVector3> hull; local
242 GrahamScanConvexHull2D(orgpoints,hull,averageFaceNormal);
244 for (int i=0;i<hull.size();i++)
246 combinedFace.m_indices.push_back(hull[i].m_orgIndex);
249 if(orgpoints[k].m_orgIndex == hull[i].m_orgIndex)
264 continue; // this is in the hull...
  /external/opencv3/modules/imgproc/src/
rotcalipers.cpp 65 // points - convex hull vertices ( any orientation )
146 // find convex hull orientation
345 Mat hull; local
349 convexHull(_points, hull, true, true);
351 if( hull.depth() != CV_32F )
354 hull.convertTo(temp, CV_32F);
355 hull = temp;
358 int n = hull.checkVector(2);
359 const Point2f* hpoints = hull.ptr<Point2f>();
convhull.cpp 201 // gather upper part of convex hull to output
239 // the bottom part of the convex hull is the mirrored top part
257 Mat hull = _hull.getMat(); local
258 size_t step = !hull.isContinuous() ? hull.step[0] : sizeof(Point);
260 *(Point*)(hull.ptr() + i*step) = data0[hullbuf[i]];
277 Mat hull = _hull.getMat(); local
278 int hpoints = hull.checkVector(1, CV_32S);
282 const int* hptr = hull.ptr<int>();
285 // 1. recognize co-orientation of the contour and its hull
398 union { CvContour* c; CvSeq* s; } hull; local
528 CvSeq *ptseq = (CvSeq*)array, *hull = (CvSeq*)hullarray; local
    [all...]
  /external/opencv/cv/src/
cvconvhull.cpp 231 union { CvContour* c; CvSeq* s; } hull; local
238 hull.s = 0;
298 "The hull matrix should be continuous and have a single row or a single column" );
301 CV_ERROR( CV_StsBadSize, "The hull matrix size might be not enough to fit the hull" );
306 "The hull matrix must have the same type as input or 32sC1 (integers)" );
397 /* gather upper part of convex hull to output */
452 the bottom part of the convex hull is the mirrored top part
496 hull.s = hullseq;
497 hull.c->rect = cvBoundingRect( ptseq
536 CvSeq *ptseq = (CvSeq*)array, *hull = (CvSeq*)hullarray; local
    [all...]
cvcalibinit.cpp 1084 CvSeq *hull = cvConvexHull2( &pointMat, temp_storage, CV_CLOCKWISE, 1 ); local
    [all...]
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/
PolygonShape.java 103 * Create a convex hull from the given array of points. The count must be in the range [3,
114 * Create a convex hull from the given array of points. The count must be in the range [3,
159 // Create the convex hull using the Gift wrapping algorithm
162 // Find the right most point on the hull
173 int[] hull = local
181 hull[m] = ih;
190 Vec2 r = pool1.set(ps[ie]).subLocal(ps[hull[m]]);
191 Vec2 v = pool2.set(ps[j]).subLocal(ps[hull[m]]);
218 m_vertices[i].set(ps[hull[i]]);
  /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/calib3d/src/
calibinit.cpp 1154 CvSeq *hull = cvConvexHull2( &pointMat, temp_storage, CV_CLOCKWISE, 1 ); local
    [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...]
  /frameworks/base/libs/hwui/
SpotShadow.cpp 154 * compute the convex hull of a collection of Points
161 int SpotShadow::hull(Vector2* points, int pointsLength, Vector2* retPoly) { function in class:android::uirenderer::SpotShadow
217 // TODO: Add test harness which verify that all the points are inside the hull.
588 int finalUmbraLength = hull(umbra, umbraLength, finalUmbra);
589 int finalPenumbraLength = hull(penumbra, penumbraLength, finalPenumbra);
    [all...]
  /external/opencv3/modules/java/src/
imgproc.cpp 4855 std::vector<int> hull; local
4881 std::vector<int> 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/chromium-trace/catapult/tracing/third_party/d3/
d3.min.js     [all...]
  /cts/apps/CtsVerifier/libs/
opencv3-android.jar 

Completed in 594 milliseconds