HomeSort by relevance Sort by last modified time
    Searched defs:contour (Results 1 - 25 of 57) sorted by null

1 2 3

  /external/skia/src/pathops/
SkPathOpsTightBounds.cpp 12 SkOpContour contour; local
13 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
16 SkOpEdgeBuilder builder(path, &contour, &allocator, &globalState);
SkIntersectionHelper.h 39 SkOpContour* contour() const { function in class:SkIntersectionHelper
40 return fSegment->contour();
43 void init(SkOpContour* contour) {
44 fSegment = contour->first();
SkOpEdgeBuilder.cpp 30 SkOpContour* contour = fContoursHead; local
32 while (contour) {
33 count += contour->count() > 0;
34 contour = contour->next();
SkPathOpsSimplify.cpp 181 SkOpContour contour; local
182 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
187 SkOpEdgeBuilder builder(path, &contour, &allocator, &globalState);
192 contour.dumpSegments();
213 contour.dumpSegments("aligned");
SkOpSegment.h 124 SkOpContour* contour() const { function in class:SkOpSegment
321 void setContour(SkOpContour* contour) {
322 fContour = contour;
412 SkOpSegment* fNext; // forward-only linked list used by contour to walk the segments
SkOpSpan.cpp 50 SkOpContour* SkOpPtT::contour() const { function in class:SkOpPtT
51 return segment()->contour();
85 return contour()->globalState();
269 SkOpContour* SkOpSpanBase::contour() const { function in class:SkOpSpanBase
270 return segment()->contour();
274 return contour()->globalState();
SkPathOpsOp.cpp 251 SkOpContour contour; local
252 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
279 SkOpEdgeBuilder builder(*minuend, &contour, &allocator, &globalState);
SkOpContour.h 83 SkOpContour* contour = SkOpTAllocator<SkOpContour>::New(allocator); local
84 contour->setNext(nullptr);
90 prev->setNext(contour);
91 return contour;
309 void remove(SkOpContour* contour) {
310 if (contour == this) {
314 SkASSERT(contour->fNext == nullptr);
317 while ((next = prev->next()) != contour) {
364 void setNext(SkOpContour* contour) {
365 // SkASSERT(!fNext == !!contour);
    [all...]
SkPathOpsCommon.cpp 66 SkOpContour* contour = contourList; local
68 result = contour->undoneSegment(startPtr, endPtr);
72 } while ((contour = contour->next()));
146 SkOpContour* contour = contourList; local
148 contour->debugShowActiveSpans();
149 } while ((contour = contour->next()));
155 SkOpContour* contour = *contourList; local
157 if (contour->count())
200 SkOpContourHead contour; local
327 const SkOpContour* contour = runs[rIndex]; variable
    [all...]
SkPathOpsWinding.cpp 246 SkOpContour* contour = contourHead; local
248 contour->rayCheck(hitBase, dir, &hitHead, &allocator);
249 } while ((contour = contour->next()));
346 hitSegment->contour()->setCcw(ccw);
395 SkOpContour* contour = contourHead; local
397 if (contour->done()) {
400 SkOpSpan* result = contour->findSortableTop(contourHead);
404 } while ((contour = contour->next()))
    [all...]
  /external/opencv/cv/src/
cvgeometry.cpp 174 CvSeq* contour = (CvSeq*)_contour; local
181 if( !CV_IS_SEQ(contour) )
183 CV_CALL( contour = cvPointSeqFromMat( CV_SEQ_KIND_CURVE + CV_SEQ_FLAG_CLOSED,
186 else if( CV_IS_SEQ_POLYGON(contour) )
188 if( contour->header_size == sizeof(CvContour) && !measure_dist )
190 CvRect r = ((CvContour*)contour)->rect;
196 else if( CV_IS_SEQ_CHAIN(contour) )
202 CV_ERROR( CV_StsBadArg, "Input contour is neither a valid sequence nor a matrix" );
204 total = contour->total;
205 is_float = CV_SEQ_ELTYPE(contour) == CV_32FC2
    [all...]
cvutils.cpp 47 CvSeq* contour = 0; local
77 contour = (CvSeq*)contour_header;
81 return contour;
cvapprox.cpp 62 CvSeq** contour,
80 assert( chain && contour && buffer );
84 *contour = 0;
400 *contour = cvEndWriteSeq( &writer );
410 /*Applies some approximation algorithm to chain-coded contour(s) and
438 CvSeq *contour; local
448 (CvSeq**)&contour, method ));
455 assert( contour );
457 if( contour->total > 0 )
459 cvBoundingRect( contour, 1 )
993 CvSeq *contour = 0; local
    [all...]
cvcontourtree.cpp 51 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1,
58 // Create binary tree representation for the contour
61 // contour - pointer to input contour object.
68 icvCreateContourTree( const CvSeq * contour, CvMemStorage * storage,
84 int *num_p, *num_n, *num1, *num2; /* numbers of input contour points */
96 assert( contour != NULL && contour->total >= 4 );
99 if( contour == NULL )
101 if( contour->total < 4
681 CvSeq* contour = 0; local
    [all...]
cvconvhull.cpp 514 /* contour must be a simple polygon */
530 /* is orientation of hull different from contour one */
743 CvSeq* contour = (CvSeq*)array; local
745 if( CV_IS_SEQ(contour) )
747 if( !CV_IS_SEQ_POLYGON(contour))
753 CV_CALL( contour = cvPointSeqFromMat(
757 if( contour->total == 0 )
760 cvStartReadSeq( contour, &reader, 0 );
764 if( CV_SEQ_ELTYPE( contour ) == CV_32SC2 )
772 for( i = 0; i < contour->total; i++
    [all...]
cvmoments.cpp 85 icvContourMoments( CvSeq* contour, CvMoments* moments )
87 int is_float = CV_SEQ_ELTYPE(contour) == CV_32FC2;
89 if( contour->total )
94 int lpt = contour->total;
98 cvStartReadSeq( contour, &reader, 0 );
110 CV_NEXT_SEQ_ELEM( contour->elem_size, reader );
127 CV_NEXT_SEQ_ELEM( contour->elem_size, reader );
386 CvSeq* contour = 0; local
391 contour = (CvSeq*)array;
392 if( !CV_IS_SEQ_POLYGON( contour ))
    [all...]
  /external/opencv3/modules/imgproc/include/opencv2/imgproc/
imgproc_c.h 438 /** @brief Initializes contour retrieving process.
452 /** @brief Retrieves next contour
458 /** @brief Substitutes the last retrieved contour with the new one
460 (if the substitutor is null, the last retrieved contour is removed from the tree)
466 /** @brief Releases contour scanner and returns pointer to the first outer contour
473 This is a standalone contour approximation routine, not represented in the new interface. When
509 * Contour Processing and Shape Analysis *
512 /** @brief Approximates a single polygonal curve (contour) or
521 /** @brief Calculates perimeter of a contour or length of a part of contou
578 CVAPI(int) cvCheckContourConvexity( const CvArr* contour ); variable
    [all...]
  /external/opencv3/samples/android/color-blob-detection/src/org/opencv/samples/colorblobdetect/
ColorBlobDetector.java 18 // Minimum contour area in percent for contours filtering
83 // Find max contour area
97 MatOfPoint contour = each.next(); local
98 if (Imgproc.contourArea(contour) > mMinContourArea*maxArea) {
99 Core.multiply(contour, new Scalar(4,4), contour);
100 mContours.add(contour);
  /external/opencv3/modules/imgproc/src/
approx.cpp 377 /*Applies some approximation algorithm to chain-coded contour(s) and
401 CvSeq *contour = 0; local
409 contour = icvApproximateChainTC89( (CvChain *) src_seq, sizeof( CvContour ), storage, method );
415 if( contour->total > 0 )
417 cvBoundingRect( contour, 1 );
419 contour->v_prev = parent;
420 contour->h_prev = prev_contour;
423 prev_contour->h_next = contour;
425 parent->v_next = contour;
426 prev_contour = contour;
769 CvSeq *contour = 0; local
    [all...]
geometry.cpp 98 Mat contour = _contour.getMat(); local
99 int i, total = contour.checkVector(2), counter = 0;
100 int depth = contour.depth();
110 const Point* cnt = contour.ptr<Point>();
249 cv::Mat contour = cv::cvarrToMat(_contour, false, false, 0, &abuf); local
250 return cv::pointPolygonTest(contour, pt, measure_dist != 0);
convhull.cpp 285 // 1. recognize co-orientation of the contour and its hull
380 Mat contour = _contour.getMat(); local
381 int total = contour.checkVector(2), depth = contour.depth();
388 isContourConvex_(contour.ptr<Point>(), total ) :
389 isContourConvex_(contour.ptr<Point2f>(), total );
511 /* contour must be a simple polygon */
522 /* is orientation of hull different from contour one */
719 CvSeq* contour = (CvSeq*)array; local
721 if( CV_IS_SEQ(contour) )
    [all...]
  /external/freetype/src/autofit/
afhints.c 309 AF_Point* contour = hints->contours; local
310 AF_Point* climit = contour + hints->num_contours;
331 /* insert extra newline at the beginning of a contour */
332 if ( contour < climit && *contour == point )
335 contour++;
893 AF_Point* contour = hints->contours; local
894 AF_Point* contour_limit = contour + hints->num_contours;
899 for ( ; contour < contour_limit; contour++, end++
921 AF_Point* contour; local
1499 AF_Point* contour = hints->contours; local
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/
afhints.c 854 AF_Point* contour = hints->contours; local
855 AF_Point* contour_limit = contour + hints->num_contours;
860 for ( ; contour < contour_limit; contour++, end++ )
862 contour[0] = points + idx;
884 AF_Point* contour; local
888 for ( contour = hints->contours; contour < contour_limit; contour++ )
890 AF_Point first = *contour;
1462 AF_Point* contour = hints->contours; local
    [all...]
  /external/skia/tests/
PathOpsAngleTest.cpp 237 SkOpContourHead contour;
238 SkOpGlobalState state(nullptr, &contour SkDEBUGPARAMS(nullptr));
239 contour.init(&state, false, false);
247 contour.addLine(data.fShortPts, &allocator);
250 contour.addQuad(data.fShortPts, &allocator);
253 contour.addCubic(data.fShortPts, &allocator);
257 SkOpSegment* first = contour.first();
429 SkOpContourHead contour; local
430 SkOpGlobalState state(nullptr, &contour SkDEBUGPARAMS(nullptr));
431 contour.init(&state, false, false)
    [all...]
  /external/freetype/src/pshinter/
pshalgo.c 944 /* compute first segment in contour */
983 /* now, process all segments in the contour */
1180 PSH_Contour contour = glyph->contours; local
1930 PSH_Contour contour = glyph->contours; local
    [all...]

Completed in 2569 milliseconds

1 2 3