Home
last modified time | relevance | path

Searched refs:contour (Results 1 – 25 of 47) sorted by relevance

12

/external/opencv/cvaux/src/
Ddecomppoly.cpp140 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;
211 ix2 = contour[ 0 ].x - contour[ i ].x;
[all …]
Dcvlcm.cpp333 if(pLCMNode->contour->storage) in cvReleaseLinearContorModelStorage()
334 cvReleaseMemStorage(&pLCMNode->contour->storage); in cvReleaseLinearContorModelStorage()
427 cvStartAppendToSeq((CvSeq*)pLCMNode->contour,&writer); in _cvConstructLCMComplexNode()
507 cvSeqPush((CvSeq*)pLCMNode->contour,&pNode->pt); in _cvConstructLCMSimpleNode()
579 cvSeqPush((CvSeq*)pLCMNode->contour,&pNode->pt); in _cvTreatExeptionalCase()
588 pLCMNode->contour = (CvContour*)cvCreateSeq(0, sizeof(CvContour), in _cvCreateLCMNode()
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/truetype/
Dglyph_table.cc356 int32_t GlyphTable::SimpleGlyph::NumberOfPoints(int32_t contour) { in NumberOfPoints() argument
358 if (contour >= NumberOfContours()) { in NumberOfPoints()
361 return contour_index_[contour + 1] - contour_index_[contour]; in NumberOfPoints()
364 int32_t GlyphTable::SimpleGlyph::XCoordinate(int32_t contour, int32_t point) { in XCoordinate() argument
366 return x_coordinates_[contour_index_[contour] + point]; in XCoordinate()
369 int32_t GlyphTable::SimpleGlyph::YCoordinate(int32_t contour, int32_t point) { in YCoordinate() argument
371 return y_coordinates_[contour_index_[contour] + point]; in YCoordinate()
374 bool GlyphTable::SimpleGlyph::OnCurve(int32_t contour, int32_t point) { in OnCurve() argument
376 return on_curve_[contour_index_[contour] + point]; in OnCurve()
410 for (uint32_t contour = 0; contour < contour_index_.size() - 1; ++contour) { in Initialize() local
[all …]
Dglyph_table.h202 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);
272 int32_t Flags(int32_t contour);
274 int32_t GlyphIndex(int32_t contour);
275 int32_t Argument1(int32_t contour);
276 int32_t Argument2(int32_t contour);
277 int32_t TransformationSize(int32_t contour);
[all …]
/external/sfntly/cpp/src/sfntly/table/truetype/
Dglyph_table.cc356 int32_t GlyphTable::SimpleGlyph::NumberOfPoints(int32_t contour) { in NumberOfPoints() argument
358 if (contour >= NumberOfContours()) { in NumberOfPoints()
361 return contour_index_[contour + 1] - contour_index_[contour]; in NumberOfPoints()
364 int32_t GlyphTable::SimpleGlyph::XCoordinate(int32_t contour, int32_t point) { in XCoordinate() argument
366 return x_coordinates_[contour_index_[contour] + point]; in XCoordinate()
369 int32_t GlyphTable::SimpleGlyph::YCoordinate(int32_t contour, int32_t point) { in YCoordinate() argument
371 return y_coordinates_[contour_index_[contour] + point]; in YCoordinate()
374 bool GlyphTable::SimpleGlyph::OnCurve(int32_t contour, int32_t point) { in OnCurve() argument
376 return on_curve_[contour_index_[contour] + point]; in OnCurve()
410 for (uint32_t contour = 0; contour < contour_index_.size() - 1; ++contour) { in Initialize() local
[all …]
Dglyph_table.h202 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);
272 int32_t Flags(int32_t contour);
274 int32_t GlyphIndex(int32_t contour);
275 int32_t Argument1(int32_t contour);
276 int32_t Argument2(int32_t contour);
277 int32_t TransformationSize(int32_t contour);
[all …]
/external/skia/src/pathops/
DSkPathOpsCommon.cpp29 SkOpContour* contour = contourList[cTest]; in contourRangeCheckY() local
30 bool testOpp = contour->operand() ^ current->operand() ^ opp; in contourRangeCheckY()
31 if (basePt.fY < contour->bounds().fTop) { in contourRangeCheckY()
34 if (bestY > contour->bounds().fBottom) { in contourRangeCheckY()
37 int segmentCount = contour->segments().count(); in contourRangeCheckY()
39 SkOpSegment* testSeg = &contour->segments()[test]; in contourRangeCheckY()
105 SkOpContour* contour = contourList[cIndex]; in FindUndone() local
106 result = contour->undoneSegment(start, end); in FindUndone()
230 SkOpContour* contour = contourList[cIndex]; in findSortableTop() local
231 if (contour->done()) { in findSortableTop()
[all …]
DSkIntersectionHelper.h65 void init(SkOpContour* contour) { in init() argument
66 fContour = contour; in init()
68 fLast = contour->segments().count(); in init()
DSkAddIntersections.cpp439 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
440 contour->addCoincidentPoints(); in CoincidenceCheck()
443 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
444 contour->calcCoincidentWinding(); in CoincidenceCheck()
447 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
448 contour->calcPartialCoincidentWinding(); in CoincidenceCheck()
/external/chromium_org/third_party/skia/src/pathops/
DSkPathOpsCommon.cpp29 SkOpContour* contour = contourList[cTest]; in contourRangeCheckY() local
30 bool testOpp = contour->operand() ^ current->operand() ^ opp; in contourRangeCheckY()
31 if (basePt.fY < contour->bounds().fTop) { in contourRangeCheckY()
34 if (bestY > contour->bounds().fBottom) { in contourRangeCheckY()
37 int segmentCount = contour->segments().count(); in contourRangeCheckY()
39 SkOpSegment* testSeg = &contour->segments()[test]; in contourRangeCheckY()
105 SkOpContour* contour = contourList[cIndex]; in FindUndone() local
106 result = contour->undoneSegment(start, end); in FindUndone()
230 SkOpContour* contour = contourList[cIndex]; in findSortableTop() local
231 if (contour->done()) { in findSortableTop()
[all …]
DSkIntersectionHelper.h65 void init(SkOpContour* contour) { in init() argument
66 fContour = contour; in init()
68 fLast = contour->segments().count(); in init()
DSkAddIntersections.cpp439 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
440 contour->addCoincidentPoints(); in CoincidenceCheck()
443 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
444 contour->calcCoincidentWinding(); in CoincidenceCheck()
447 SkOpContour* contour = (*contourList)[cIndex]; in CoincidenceCheck() local
448 contour->calcPartialCoincidentWinding(); in CoincidenceCheck()
/external/opencv/cv/src/
Dcvpgh.cpp150 icvCalcPGH( const CvSeq * contour, float *pgh, int angle_dim, int dist_dim ) in icvCalcPGH() argument
163 if( !contour || !pgh ) in icvCalcPGH()
169 if( !CV_IS_SEQ_POLYGON( contour )) in icvCalcPGH()
174 count = contour->total; in icvCalcPGH()
186 cvStartReadSeq( contour, &reader1, 0 ); in icvCalcPGH()
187 cvStartReadSeq( contour, &reader2, 0 ); in icvCalcPGH()
334 cvCalcPGH( const CvSeq * contour, CvHistogram * hist ) in cvCalcPGH() argument
354 if( !CV_IS_SEQ_POLYGON( contour ) || CV_SEQ_ELTYPE( contour ) != CV_32SC2 ) in cvCalcPGH()
357 IPPI_CALL( icvCalcPGH( contour, ((CvMatND*)(hist->bins))->data.fl, size[0], size[1] )); in cvCalcPGH()
Dcvcontourtree.cpp51 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1,
68 icvCreateContourTree( const CvSeq * contour, CvMemStorage * storage, in icvCreateContourTree() argument
96 assert( contour != NULL && contour->total >= 4 ); in icvCreateContourTree()
99 if( contour == NULL ) in icvCreateContourTree()
101 if( contour->total < 4 ) in icvCreateContourTree()
104 if( !CV_IS_SEQ_POLYGON( contour )) in icvCreateContourTree()
109 lpt = contour->total; in icvCreateContourTree()
148 if( cvCvtSeqToArray( contour, (char *) pt_p ) == (char *) contour ) in icvCreateContourTree()
203 icvCalcTriAttr( contour, t, tp1, nmp1, tn1, nmn1, &s, &s_c, &h, &a, in icvCreateContourTree()
206 icvCalcTriAttr( contour, tp1, tp2, nmp2, t, nm, &sp1, &sp1_c, &hp1, in icvCreateContourTree()
[all …]
Dcvcontours.cpp133 CvSeq *contour; /* corresponding contour (may be 0, if rejected) */ member
245 scanner->frame_info.contour = &(scanner->frame); in cvStartFindContours()
489 if( l_cinfo->contour ) in icvEndProcessContour()
491 cvInsertNodeIntoTree( l_cinfo->contour, l_cinfo->parent->contour, in icvEndProcessContour()
512 if( l_cinfo && l_cinfo->contour && l_cinfo->contour != new_contour ) in cvSubstituteContour()
514 l_cinfo->contour = new_contour; in cvSubstituteContour()
533 CvSeq* contour, in icvFetchContour() argument
550 cvStartAppendToSeq( contour, &writer ); in icvFetchContour()
553 ((CvChain *) contour)->origin = pt; in icvFetchContour()
555 s_end = s = CV_IS_SEQ_HOLE( contour ) ? 0 : 4; in icvFetchContour()
[all …]
Dcvdominants.cpp54 icvFindDominantPointsIPAN( CvSeq * contour, in icvFindDominantPointsIPAN() argument
61 int n = contour->total; in icvFindDominantPointsIPAN()
74 if( contour == NULL ) in icvFindDominantPointsIPAN()
98 if( CV_IS_SEQ_CHAIN_CONTOUR( contour )) in icvFindDominantPointsIPAN()
102 cvStartReadChainPoints( (CvChain *) contour, &reader ); in icvFindDominantPointsIPAN()
109 else if( CV_IS_SEQ_POLYGON( contour )) in icvFindDominantPointsIPAN()
113 cvStartReadSeq( contour, &reader, 0 ); in icvFindDominantPointsIPAN()
284 cvStartWriteSeq( (contour->flags & ~CV_SEQ_ELTYPE_MASK) | CV_SEQ_ELTYPE_INDEX, in icvFindDominantPointsIPAN()
359 cvFindDominantPoints( CvSeq * contour, CvMemStorage * storage, int method, in cvFindDominantPoints() argument
367 if( !contour ) in cvFindDominantPoints()
[all …]
Dcvapprox.cpp62 CvSeq** contour, in icvApproximateChainTC89() argument
80 assert( chain && contour && buffer ); in icvApproximateChainTC89()
84 *contour = 0; in icvApproximateChainTC89()
400 *contour = cvEndWriteSeq( &writer ); in icvApproximateChainTC89()
438 CvSeq *contour; in cvApproxChains() local
448 (CvSeq**)&contour, method )); in cvApproxChains()
455 assert( contour ); in cvApproxChains()
457 if( contour->total > 0 ) in cvApproxChains()
459 cvBoundingRect( contour, 1 ); in cvApproxChains()
461 contour->v_prev = parent; in cvApproxChains()
[all …]
Dcvshapedescr.cpp59 CvSeq* contour = 0; in cvArcLength() local
64 contour = (CvSeq*)array; in cvArcLength()
65 if( !CV_IS_SEQ_POLYLINE( contour )) in cvArcLength()
68 is_closed = CV_IS_SEQ_CLOSED( contour ); in cvArcLength()
73 CV_CALL( contour = cvPointSeqFromMat( in cvArcLength()
78 if( contour->total > 1 ) in cvArcLength()
80 int is_float = CV_SEQ_ELTYPE( contour ) == CV_32FC2; in cvArcLength()
82 cvStartReadSeq( contour, &reader, 0 ); in cvArcLength()
84 count = cvSliceLength( slice, contour ); in cvArcLength()
86 count -= !is_closed && count == contour->total; in cvArcLength()
[all …]
Dcvmoments.cpp85 icvContourMoments( CvSeq* contour, CvMoments* moments ) in icvContourMoments() argument
87 int is_float = CV_SEQ_ELTYPE(contour) == CV_32FC2; in icvContourMoments()
89 if( contour->total ) in icvContourMoments()
94 int lpt = contour->total; in icvContourMoments()
98 cvStartReadSeq( contour, &reader, 0 ); in icvContourMoments()
110 CV_NEXT_SEQ_ELEM( contour->elem_size, reader ); in icvContourMoments()
127 CV_NEXT_SEQ_ELEM( contour->elem_size, reader ); in icvContourMoments()
386 CvSeq* contour = 0; in cvMoments() local
391 contour = (CvSeq*)array; in cvMoments()
392 if( !CV_IS_SEQ_POLYGON( contour )) in cvMoments()
[all …]
Dcvgeometry.cpp174 CvSeq* contour = (CvSeq*)_contour; in cvPointPolygonTest() local
181 if( !CV_IS_SEQ(contour) ) in cvPointPolygonTest()
183 CV_CALL( contour = cvPointSeqFromMat( CV_SEQ_KIND_CURVE + CV_SEQ_FLAG_CLOSED, in cvPointPolygonTest()
186 else if( CV_IS_SEQ_POLYGON(contour) ) in cvPointPolygonTest()
188 if( contour->header_size == sizeof(CvContour) && !measure_dist ) in cvPointPolygonTest()
190 CvRect r = ((CvContour*)contour)->rect; in cvPointPolygonTest()
196 else if( CV_IS_SEQ_CHAIN(contour) ) in cvPointPolygonTest()
204 total = contour->total; in cvPointPolygonTest()
205 is_float = CV_SEQ_ELTYPE(contour) == CV_32FC2; in cvPointPolygonTest()
206 cvStartReadSeq( contour, &reader, -1 ); in cvPointPolygonTest()
Dcvconvhull.cpp743 CvSeq* contour = (CvSeq*)array; in cvCheckContourConvexity() local
745 if( CV_IS_SEQ(contour) ) in cvCheckContourConvexity()
747 if( !CV_IS_SEQ_POLYGON(contour)) in cvCheckContourConvexity()
753 CV_CALL( contour = cvPointSeqFromMat( in cvCheckContourConvexity()
757 if( contour->total == 0 ) in cvCheckContourConvexity()
760 cvStartReadSeq( contour, &reader, 0 ); in cvCheckContourConvexity()
764 if( CV_SEQ_ELTYPE( contour ) == CV_32SC2 ) in cvCheckContourConvexity()
772 for( i = 0; i < contour->total; i++ ) in cvCheckContourConvexity()
805 assert( CV_SEQ_ELTYPE(contour) == CV_32FC2 ); in cvCheckContourConvexity()
813 for( i = 0; i < contour->total; i++ ) in cvCheckContourConvexity()
/external/chromium_org/third_party/freetype/src/autofit/
Dafhints.c722 AF_Point* contour = hints->contours; in af_glyph_hints_reload() local
723 AF_Point* contour_limit = contour + hints->num_contours; in af_glyph_hints_reload()
728 for ( ; contour < contour_limit; contour++, end++ ) in af_glyph_hints_reload()
730 contour[0] = points + idx; in af_glyph_hints_reload()
1171 AF_Point* contour = hints->contours; in af_glyph_hints_align_weak_points() local
1172 AF_Point* contour_limit = contour + hints->num_contours; in af_glyph_hints_align_weak_points()
1204 for ( ; contour < contour_limit; contour++ ) in af_glyph_hints_align_weak_points()
1209 point = *contour; in af_glyph_hints_align_weak_points()
/external/freetype/src/autofit/
Dafhints.c722 AF_Point* contour = hints->contours; in af_glyph_hints_reload() local
723 AF_Point* contour_limit = contour + hints->num_contours; in af_glyph_hints_reload()
728 for ( ; contour < contour_limit; contour++, end++ ) in af_glyph_hints_reload()
730 contour[0] = points + idx; in af_glyph_hints_reload()
1171 AF_Point* contour = hints->contours; in af_glyph_hints_align_weak_points() local
1172 AF_Point* contour_limit = contour + hints->num_contours; in af_glyph_hints_align_weak_points()
1204 for ( ; contour < contour_limit; contour++ ) in af_glyph_hints_align_weak_points()
1209 point = *contour; in af_glyph_hints_align_weak_points()
/external/freetype/src/pshinter/
Dpshalgo.c1283 PSH_Contour contour = glyph->contours; in psh_glyph_init() local
1295 contour->start = points + first; in psh_glyph_init()
1296 contour->count = (FT_UInt)count; in psh_glyph_init()
1303 point->contour = contour; in psh_glyph_init()
1310 point->contour = contour; in psh_glyph_init()
1315 contour++; in psh_glyph_init()
2038 PSH_Contour contour = glyph->contours; in psh_glyph_interpolate_other_points() local
2042 for ( ; num_contours > 0; num_contours--, contour++ ) in psh_glyph_interpolate_other_points()
2044 PSH_Point start = contour->start; in psh_glyph_interpolate_other_points()
2050 next = start + contour->count; in psh_glyph_interpolate_other_points()
/external/chromium_org/third_party/freetype/src/pshinter/
Dpshalgo.c1283 PSH_Contour contour = glyph->contours; in psh_glyph_init() local
1295 contour->start = points + first; in psh_glyph_init()
1296 contour->count = (FT_UInt)count; in psh_glyph_init()
1303 point->contour = contour; in psh_glyph_init()
1310 point->contour = contour; in psh_glyph_init()
1315 contour++; in psh_glyph_init()
2038 PSH_Contour contour = glyph->contours; in psh_glyph_interpolate_other_points() local
2042 for ( ; num_contours > 0; num_contours--, contour++ ) in psh_glyph_interpolate_other_points()
2044 PSH_Point start = contour->start; in psh_glyph_interpolate_other_points()
2050 next = start + contour->count; in psh_glyph_interpolate_other_points()

12