| /external/opencv/cvaux/src/ |
| decomppoly.cpp | 140 bool icvEarCutTriangulation( CvPoint* contour,
185 x1 = contour[ index1 ].x;
186 y1 = contour[ index1 ].y;
187 x2 = contour[ index2 ].x;
188 y2 = contour[ index2 ].y;
189 x3 = contour[ index3 ].x;
190 y3 = contour[ index3 ].y;
207 ix2 = contour[ i + 1 ].x - contour[ i ].x;
208 iy2 = contour[ i + 1 ].y - contour[ i ].y
[all...] |
| cvlcm.cpp | 42 /* Hybrid linear-contour model reconstruction */
333 if(pLCMNode->contour->storage)
334 cvReleaseMemStorage(&pLCMNode->contour->storage);
427 cvStartAppendToSeq((CvSeq*)pLCMNode->contour,&writer);
507 cvSeqPush((CvSeq*)pLCMNode->contour,&pNode->pt);
579 cvSeqPush((CvSeq*)pLCMNode->contour,&pNode->pt);
588 pLCMNode->contour = (CvContour*)cvCreateSeq(0, sizeof(CvContour),
|
| /external/sfntly/cpp/src/sfntly/table/truetype/ |
| glyph_table.cc | 356 int32_t GlyphTable::SimpleGlyph::NumberOfPoints(int32_t contour) {
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) {
366 return x_coordinates_[contour_index_[contour] + point];
369 int32_t GlyphTable::SimpleGlyph::YCoordinate(int32_t contour, int32_t point) {
371 return y_coordinates_[contour_index_[contour] + point];
374 bool GlyphTable::SimpleGlyph::OnCurve(int32_t contour, int32_t point) {
376 return on_curve_[contour_index_[contour] + point]
[all...] |
| glyph_table.h | 41 // Note: Contour is an empty class for the version ported
42 class Contour {
44 Contour() {}
45 virtual ~Contour() {}
170 class SimpleContour : public Glyph::Contour {
202 int32_t NumberOfPoints(int32_t contour);
203 int32_t XCoordinate(int32_t contour, int32_t point);
204 int32_t YCoordinate(int32_t contour, int32_t point);
205 bool OnCurve(int32_t contour, int32_t point);
210 int32_t ContourEndPoint(int32_t contour);
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 28 SkOpContour* contour = contourList[cTest]; local
29 bool testOpp = contour->operand() ^ current->operand() ^ opp;
30 if (basePt.fY < contour->bounds().fTop) {
33 if (bestY > contour->bounds().fBottom) {
36 int segmentCount = contour->segments().count();
38 SkOpSegment* testSeg = &contour->segments()[test];
104 SkOpContour* contour = contourList[cIndex]; local
105 result = contour->undoneSegment(start, end);
160 // turn span winding into contour winding
229 SkOpContour* contour = contourList[cIndex] local
280 SkOpContour* contour = contourList[cIndex]; local
352 SkOpContour* contour = (*contourList)[cTest]; local
360 SkOpContour* contour = (*contourList)[cTest]; local
368 SkOpContour* contour = (*contourList)[cTest]; local
380 SkOpContour& contour = contours[index]; local
533 const SkOpContour& contour = contours[outer]; variable
[all...] |
| SkIntersectionHelper.h | 60 void init(SkOpContour* contour) {
61 fContour = contour;
63 fLast = contour->segments().count();
|
| SkAddIntersections.cpp | 419 SkOpContour* contour = (*contourList)[cIndex]; local
420 contour->addCoincidentPoints();
423 SkOpContour* contour = (*contourList)[cIndex]; local
424 contour->calcCoincidentWinding();
427 SkOpContour* contour = (*contourList)[cIndex]; local
428 contour->findTooCloseToCall();
|
| /external/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 28 SkOpContour* contour = contourList[cTest]; local
29 bool testOpp = contour->operand() ^ current->operand() ^ opp;
30 if (basePt.fY < contour->bounds().fTop) {
33 if (bestY > contour->bounds().fBottom) {
36 int segmentCount = contour->segments().count();
38 SkOpSegment* testSeg = &contour->segments()[test];
104 SkOpContour* contour = contourList[cIndex]; local
105 result = contour->undoneSegment(start, end);
160 // turn span winding into contour winding
229 SkOpContour* contour = contourList[cIndex] local
280 SkOpContour* contour = contourList[cIndex]; local
352 SkOpContour* contour = (*contourList)[cTest]; local
360 SkOpContour* contour = (*contourList)[cTest]; local
368 SkOpContour* contour = (*contourList)[cTest]; local
380 SkOpContour& contour = contours[index]; local
533 const SkOpContour& contour = contours[outer]; variable
[all...] |
| SkIntersectionHelper.h | 60 void init(SkOpContour* contour) {
61 fContour = contour;
63 fLast = contour->segments().count();
|
| SkAddIntersections.cpp | 419 SkOpContour* contour = (*contourList)[cIndex]; local
420 contour->addCoincidentPoints();
423 SkOpContour* contour = (*contourList)[cIndex]; local
424 contour->calcCoincidentWinding();
427 SkOpContour* contour = (*contourList)[cIndex]; local
428 contour->findTooCloseToCall();
|
| /external/opencv/cv/src/ |
| cvdominants.cpp | 54 icvFindDominantPointsIPAN( CvSeq * contour,
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
[all...] |
| cvcontours.cpp | 131 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 */
844 CvSeq *contour = 0; local
1438 CvSeq* contour; local
1516 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...] |
| cvshapedescr.cpp | 43 /* 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 );
737 CvSeq* contour = 0; local
[all...] |
| _cvgeom.h | 88 CvSeq** 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...] |
| cvpgh.cpp | 138 // 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 )
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, CvHistogram * hist
[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...] |
| 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...] |
| 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...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afhints.c | 700 AF_Point* contour = hints->contours; local
701 AF_Point* contour_limit = contour + hints->num_contours;
706 for ( ; contour < contour_limit; contour++, end++ )
708 contour[0] = points + idx;
1149 AF_Point* contour = hints->contours; local
1150 AF_Point* contour_limit = contour + hints->num_contours;
1182 for ( ; contour < contour_limit; contour++ )
1187 point = *contour;
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 722 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/opencv/cxcore/src/ |
| cxdrawing.cpp | [all...] |
| /external/opencv/cv/include/ |
| cv.h | 417 /* Initalizes contour retrieving process.
428 /* Retrieves next contour */
432 /* Substitutes the last retrieved contour with the new one
433 (if the substitutor is null, the last retrieved contour is removed from the tree) */
437 /* Releases contour scanner and returns pointer to the first outer contour */
709 * Contour Processing and Shape Analysis *
714 /* Approximates a single polygonal curve (contour) or
723 /* Finds high-curvature points of the contour */
724 CVAPI(CvSeq*) cvFindDominantPoints( CvSeq* contour, CvMemStorage* storage
791 CVAPI(int) cvCheckContourConvexity( const CvArr* contour ); variable
[all...] |
| /external/chromium_org/third_party/freetype/src/pshinter/ |
| pshalgo.c | 1048 /* compute first segment in contour */
1087 /* now, process all segments in the contour */
1284 PSH_Contour contour = glyph->contours; local
2039 PSH_Contour contour = glyph->contours; local
[all...] |
