Searched defs:contour (Results 1 - 25 of 45) sorted by relevance

12

/external/skia/src/pathops/
H A DSkPathOpsTightBounds.cpp52 SkOpContour contour; local
53 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
H A DSkOpEdgeBuilder.h38 SkOpContour* contour = fContourBuilder.contour(); local
39 if (contour && contour->count()) {
40 contour->complete();
H A DSkPathOpsSimplify.cpp151 SkOpContour contour; local
152 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
181 contour.dumpSegments();
206 contour.dumpSegments("aligned");
H A DSkIntersectionHelper.h42 SkOpContour* contour() const { function in class:SkIntersectionHelper
43 return fSegment->contour();
46 void init(SkOpContour* contour) { argument
47 fSegment = contour->first();
H A DSkOpEdgeBuilder.cpp54 SkOpContour* contour = fContourBuilder.contour(); local
55 if (contour && !contour->count()) {
56 fContoursHead->remove(contour);
181 SkOpContour* contour = fContourBuilder.contour(); local
189 if (contour && contour->count()) {
196 if (!contour) {
[all...]
H A DSkPathOpsCommon.cpp89 SkOpContour* contour = contourHead; local
91 if (contour->done()) {
94 SkOpSpan* result = contour->undoneSpan();
98 } while ((contour = contour->next()));
175 SkOpContour* contour = *contourList; local
177 if (contour->count()) {
178 contour->setOppXor(contour->operand() ? evenOdd : oppEvenOdd);
179 *list.append() = contour;
204 SkOpContour* contour = contourList; local
212 SkOpContour* contour = contourList; local
222 SkOpContour* contour = contourList; local
233 SkOpContour* contour = contourList; local
243 SkOpContour* contour = contourList; local
[all...]
H A DSkPathOpsOp.cpp222 SkOpContour contour; local
223 SkOpContourHead* contourList = static_cast<SkOpContourHead*>(&contour);
H A DSkOpSegment.h123 SkOpContour* contour() const { function in class:SkOpSegment
350 void setContour(SkOpContour* contour) { argument
351 fContour = contour;
436 SkOpSegment* fNext; // forward-only linked list used by contour to walk the segments
H A DSkOpSpan.cpp78 SkOpContour* SkOpPtT::contour() const { function in class:SkOpPtT
79 return segment()->contour();
96 return contour()->globalState();
220 SkOpContour* SkOpSpanBase::contour() const { function in class:SkOpSpanBase
221 return segment()->contour();
225 return contour()->globalState();
H A DSkPathWriter.cpp12 // wrap path to keep track of whether the contour is initialized and non-empty
187 check start and end of each contour
191 reassemble contour pieces into new path
213 SkDebugf("%s contour start=(%1.9g,%1.9g) end=(%1.9g,%1.9g)\n", __FUNCTION__,
303 const SkPath& contour = fPartials[rIndex]; local
305 fPathPtr->addPath(contour,
309 fPathPtr->reversePathTo(contour);
H A DSkOpContour.h321 void setNext(SkOpContour* contour) { argument
322 // SkASSERT(!fNext == !!contour);
323 fNext = contour;
384 bool fReverse; // true if contour should be reverse written to path (used only by fix winding)
394 SkOpContour* contour = SkOpTAllocator<SkOpContour>::New(this->globalState()->allocator()); local
395 contour->setNext(nullptr);
401 prev->setNext(contour);
402 return contour;
415 void remove(SkOpContour* contour) { argument
416 if (contour
435 SkOpContourBuilder(SkOpContour* contour) argument
446 SkOpContour* contour() { return fContour; } function in class:SkOpContourBuilder
447 setContour(SkOpContour* contour) argument
[all...]
H A DSkPathOpsWinding.cpp251 SkOpContour* contour = contourHead; local
253 if (!contour->count()) {
256 contour->rayCheck(hitBase, dir, &hitHead, &allocator);
257 } while ((contour = contour->next()));
354 hitSegment->contour()->setCcw(ccw);
410 SkOpContour* contour = contourHead; local
412 if (contour->done()) {
415 SkOpSpan* result = contour->findSortableTop(contourHead);
419 } while ((contour
[all...]
/external/opencv/cv/src/
H A Dcvpgh.cpp138 // Calculates PGH(pairwise geometric histogram) for contour given.
141 // contour - pointer to input contour object.
150 icvCalcPGH( const CvSeq * contour, float *pgh, int angle_dim, int dist_dim ) argument
163 if( !contour || !pgh )
169 if( !CV_IS_SEQ_POLYGON( contour ))
174 count = contour->total;
186 cvStartReadSeq( contour, &reader1, 0 );
187 cvStartReadSeq( contour, &reader2, 0 );
334 cvCalcPGH( const CvSeq * contour, CvHistogra
[all...]
H A Dcvdominants.cpp54 icvFindDominantPointsIPAN( CvSeq * contour, argument
61 int n = contour->total;
74 if( contour == NULL )
98 if( CV_IS_SEQ_CHAIN_CONTOUR( contour ))
102 cvStartReadChainPoints( (CvChain *) contour, &reader );
109 else if( CV_IS_SEQ_POLYGON( contour ))
113 cvStartReadSeq( contour, &reader, 0 );
284 cvStartWriteSeq( (contour->flags & ~CV_SEQ_ELTYPE_MASK) | CV_SEQ_ELTYPE_INDEX,
323 /* dmax is so big (more than contour diameter)
336 // Applies some algorithm to find dominant points ( corners ) of contour
359 cvFindDominantPoints( CvSeq * contour, CvMemStorage * storage, int method, double parameter1, double parameter2, double parameter3, double parameter4 ) argument
[all...]
H A Dcvapprox.cpp62 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,
59 icvApproximateChainTC89( CvChain* chain, int header_size, CvMemStorage* storage, CvSeq** contour, int method ) argument
993 CvSeq *contour = 0; local
[all...]
H A Dcvutils.cpp47 CvSeq* contour = 0; local
77 contour = (CvSeq*)contour_header;
81 return contour;
H A Dcvcontourtree.cpp51 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, argument
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
595 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1, CvPoint t3, int n3, double *s, double *s_c, double *h, double *a, double *b ) argument
648 cvCreateContourTree( const CvSeq* contour, CvMemStorage* storage, double threshold ) argument
681 CvSeq* contour = 0; local
[all...]
H A Dcvconvhull.cpp514 /* 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
[all...]
H A Dcvgeometry.cpp174 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)
[all...]
H A Dcvmoments.cpp85 icvContourMoments( CvSeq* contour, CvMoments* moments ) argument
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/skia/samplecode/
H A DSampleAAGeometry.cpp81 const SkStrokeContour* contour = this; local
82 while (contour) {
83 contour->dump();
84 contour = contour->fNext;
/external/skia/tests/
H A DPathOpsAngleTest.cpp244 SkOpContourHead contour;
245 SkOpGlobalState state(&contour, &allocator SkDEBUGPARAMS(false) SkDEBUGPARAMS(nullptr));
246 contour.init(&state, false, false);
254 contour.addLine(data.fShortPts);
257 contour.addQuad(data.fShortPts);
260 contour.addCubic(data.fShortPts);
264 SkOpSegment* first = contour.first();
437 SkOpContourHead contour; local
438 SkOpGlobalState state(&contour, &allocator SkDEBUGPARAMS(false) SkDEBUGPARAMS(nullptr));
439 contour
510 SkOpContourHead contour; local
[all...]
/external/freetype/src/autofit/
H A Dafhints.c309 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
921 AF_Point* contour; local
1499 AF_Point* contour = hints->contours; local
[all...]
/external/freetype/src/pshinter/
H A Dpshalgo.c944 /* compute first segment in contour */
983 /* now, process all segments in the contour */
1180 PSH_Contour contour = glyph->contours; local
1192 contour->start = points + first;
1193 contour->count = count;
1200 point->contour = contour;
1207 point->contour = contour;
1212 contour
1930 PSH_Contour contour = glyph->contours; local
[all...]
H A Dpshalgo.h133 #define PSH_POINT_POSITIVE 128U /* extremum has positive contour flow */
134 #define PSH_POINT_NEGATIVE 256U /* extremum has negative contour flow */
160 PSH_Contour contour; member in struct:PSH_PointRec_

Completed in 433 milliseconds

12