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

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplifyAddIntersectingTs_Test.cpp88 SkTArray<SimplifyAddIntersectingTsTest::Contour> contour; local
89 SimplifyAddIntersectingTsTest::EdgeBuilder builder(path, contour);
90 if (contour.count() < 2) {
93 SimplifyAddIntersectingTsTest::Contour& c1 = contour[0];
94 SimplifyAddIntersectingTsTest::Contour& c2 = contour[1];
/external/chromium_org/third_party/skia/src/pathops/
H A DSkAddIntersections.cpp182 // OPTIMIZATION: outset contour bounds a smidgen instead?
440 SkOpContour* contour = (*contourList)[cIndex]; local
441 contour->resolveNearCoincidence();
444 SkOpContour* contour = (*contourList)[cIndex]; local
445 contour->addCoincidentPoints();
448 SkOpContour* contour = (*contourList)[cIndex]; local
449 if (!contour->calcCoincidentWinding()) {
454 SkOpContour* contour = (*contourList)[cIndex]; local
455 contour->calcPartialCoincidentWinding();
H A DSkIntersectionHelper.h70 void init(SkOpContour* contour) { argument
71 fContour = contour;
73 fLast = contour->segments().count();
H A DSkPathOpsCommon.cpp17 SkOpContour* contour = (*contourList)[cTest]; local
18 if (contour->hasMultiples()) {
19 contour->alignMultiples(aligned);
28 SkOpContour* contour = (*contourList)[cTest]; local
31 contour->alignCoincidence(aligned[index]);
52 SkOpContour* contour = contourList[cTest]; local
53 bool testOpp = contour->operand() ^ current->operand() ^ opp;
54 if (basePt.fY < contour->bounds().fTop) {
57 if (bestY > contour->bounds().fBottom) {
60 int segmentCount = contour
128 SkOpContour* contour = contourList[cIndex]; local
241 SkOpContour* contour = contourList[cIndex]; local
305 SkOpContour* contour = contourList[cIndex]; local
392 SkOpContour* contour = (*contourList)[cTest]; local
403 SkOpContour* contour = (*contourList)[cTest]; local
413 SkOpContour* contour = (*contourList)[cTest]; local
422 SkOpContour* contour = (*contourList)[cTest]; local
433 SkOpContour* contour = (*contourList)[cTest]; local
442 SkOpContour* contour = (*contourList)[cTest]; local
450 SkOpContour* contour = (*contourList)[cTest]; local
458 SkOpContour* contour = (*contourList)[cTest]; local
466 SkOpContour* contour = (*contourList)[cTest]; local
474 SkOpContour* contour = (*contourList)[cTest]; local
486 SkOpContour& contour = contours[index]; local
635 const SkOpContour& contour = contours[outer]; variable
[all...]
/external/skia/experimental/Intersection/
H A DSimplifyAddIntersectingTs_Test.cpp88 SkTArray<SimplifyAddIntersectingTsTest::Contour> contour; local
89 SimplifyAddIntersectingTsTest::EdgeBuilder builder(path, contour);
90 if (contour.count() < 2) {
93 SimplifyAddIntersectingTsTest::Contour& c1 = contour[0];
94 SimplifyAddIntersectingTsTest::Contour& c2 = contour[1];
/external/skia/src/pathops/
H A DSkAddIntersections.cpp182 // OPTIMIZATION: outset contour bounds a smidgen instead?
440 SkOpContour* contour = (*contourList)[cIndex]; local
441 contour->resolveNearCoincidence();
444 SkOpContour* contour = (*contourList)[cIndex]; local
445 contour->addCoincidentPoints();
448 SkOpContour* contour = (*contourList)[cIndex]; local
449 contour->calcCoincidentWinding();
452 SkOpContour* contour = (*contourList)[cIndex]; local
453 contour->calcPartialCoincidentWinding();
H A DSkIntersectionHelper.h70 void init(SkOpContour* contour) { argument
71 fContour = contour;
73 fLast = contour->segments().count();
/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...]
H A Dcvcontours.cpp131 struct _CvContourInfo *next; /* next contour with the same mark value */
132 struct _CvContourInfo *parent; /* information about parent contour */
133 CvSeq *contour; /* corresponding contour (may be 0, if rejected) */ member in struct:_CvContourInfo
135 CvPoint origin; /* origin point (where the contour was traced from) */
153 CvMemStoragePos backup_pos; /* beginning of the latest approx. contour */
154 CvMemStoragePos backup_pos2; /* ending of the latest approx. contour */
159 CvPoint offset; /* ROI offset: coordinates, added to each contour point */
161 CvPoint lnbd; /* position of the last met contour */
163 _CvContourInfo *l_cinfo; /* information about latest approx. contour */
530 icvFetchContour( schar *ptr, int step, CvPoint pt, CvSeq* contour, int _method ) argument
701 icvFetchContourEx( schar* ptr, int step, CvPoint pt, CvSeq* contour, int _method, int nbd, CvRect* _rect ) argument
844 CvSeq *contour = 0; local
1438 CvSeq* contour; local
1516 CvSeq *contour = 0; local
[all...]
H A Dcvshapedescr.cpp43 /* calculates length of a curve (e.g. contour perimeter) */
59 CvSeq* contour = 0; local
64 contour = (CvSeq*)array;
65 if( !CV_IS_SEQ_POLYLINE( contour ))
68 is_closed = CV_IS_SEQ_CLOSED( contour );
73 CV_CALL( contour = cvPointSeqFromMat(
78 if( contour->total > 1 )
80 int is_float = CV_SEQ_ELTYPE( contour ) == CV_32FC2;
82 cvStartReadSeq( contour, &reader, 0 );
84 count = cvSliceLength( slice, contour );
456 icvContourArea( const CvSeq* contour, double *area ) argument
558 icvContourSecArea( CvSeq * contour, CvSlice slice, double *area ) argument
737 CvSeq* contour = 0; local
[all...]
/external/chromium_org/third_party/freetype/src/autofit/
H A Dafhints.c722 AF_Point* contour = hints->contours; local
723 AF_Point* contour_limit = contour + hints->num_contours;
728 for ( ; contour < contour_limit; contour++, end++ )
730 contour[0] = points + idx;
1171 AF_Point* contour = hints->contours; local
1172 AF_Point* contour_limit = contour + hints->num_contours;
1204 for ( ; contour < contour_limit; contour++ )
1209 point = *contour;
[all...]
/external/freetype/src/autofit/
H A Dafhints.c691 AF_Point* contour = hints->contours; local
692 AF_Point* contour_limit = contour + hints->num_contours;
697 for ( ; contour < contour_limit; contour++, end++ )
699 contour[0] = points + idx;
721 AF_Point* contour; local
725 for ( contour = hints->contours; contour < contour_limit; contour++ )
727 AF_Point first = *contour;
1308 AF_Point* contour = hints->contours; local
[all...]
/external/chromium_org/third_party/freetype/src/pshinter/
H A Dpshalgo.c1047 /* compute first segment in contour */
1086 /* now, process all segments in the contour */
1283 PSH_Contour contour = glyph->contours; local
1295 contour->start = points + first;
1296 contour->count = (FT_UInt)count;
1303 point->contour = contour;
1310 point->contour = contour;
1315 contour
2038 PSH_Contour contour = glyph->contours; local
[all...]
H A Dpshalgo.h138 PSH_POINT_POSITIVE = 128, /* extremum has positive contour flow */
139 PSH_POINT_NEGATIVE = 256, /* extremum has negative contour flow */
165 PSH_Contour contour; member in struct:PSH_PointRec_
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/truetype/
H A Dglyph_table.cc356 int32_t GlyphTable::SimpleGlyph::NumberOfPoints(int32_t contour) { argument
358 if (contour >= NumberOfContours()) {
361 return contour_index_[contour + 1] - contour_index_[contour];
364 int32_t GlyphTable::SimpleGlyph::XCoordinate(int32_t contour, int32_t point) { argument
366 return x_coordinates_[contour_index_[contour] + point];
369 int32_t GlyphTable::SimpleGlyph::YCoordinate(int32_t contour, int32_t point) { argument
371 return y_coordinates_[contour_index_[contour] + point];
374 bool GlyphTable::SimpleGlyph::OnCurve(int32_t contour, int32_t point) { argument
376 return on_curve_[contour_index_[contour]
504 ContourEndPoint(int32_t contour) argument
546 Flags(int32_t contour) argument
554 GlyphIndex(int32_t contour) argument
558 Argument1(int32_t contour) argument
568 Argument2(int32_t contour) argument
578 TransformationSize(int32_t contour) argument
592 Transformation(int32_t contour, ByteVector* transformation) argument
[all...]
/external/freetype/src/pshinter/
H A Dpshalgo.c1047 /* compute first segment in contour */
1086 /* now, process all segments in the contour */
1283 PSH_Contour contour = glyph->contours; local
1295 contour->start = points + first;
1296 contour->count = (FT_UInt)count;
1303 point->contour = contour;
1310 point->contour = contour;
1315 contour
2037 PSH_Contour contour = glyph->contours; local
[all...]
H A Dpshalgo.h138 PSH_POINT_POSITIVE = 128, /* extremum has positive contour flow */
139 PSH_POINT_NEGATIVE = 256, /* extremum has negative contour flow */
165 PSH_Contour contour; member in struct:PSH_PointRec_
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/
H A Dpshalgo.c1047 /* compute first segment in contour */
1086 /* now, process all segments in the contour */
1283 PSH_Contour contour = glyph->contours; local
1295 contour->start = points + first;
1296 contour->count = (FT_UInt)count;
1303 point->contour = contour;
1310 point->contour = contour;
1315 contour
2038 PSH_Contour contour = glyph->contours; local
[all...]

Completed in 2397 milliseconds

12