Searched refs:contour (Results 1 - 25 of 62) sorted by relevance

123

/external/opencv/cvaux/src/
H A 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[
[all...]
/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...]
H A 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/
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...]
H A 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/chromium_org/third_party/skia/src/pathops/
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...]
H A DSkIntersectionHelper.h70 void init(SkOpContour* contour) { argument
71 fContour = contour;
73 fLast = contour->segments().count();
/external/skia/src/pathops/
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...]
H A DSkIntersectionHelper.h70 void init(SkOpContour* contour) { argument
71 fContour = contour;
73 fLast = contour->segments().count();
/external/opencv/cv/src/
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 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 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 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...]
H A D_cvgeom.h88 CvSeq** contour,
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 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 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 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...]
/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];
H A DthingsToDo.txt116 Likewise, to resolve whether one contour is inside another, it seems that
119 is the inside/filled side. When the outer contour is walked, it seems like I
120 could record the inside info. I guess when the inner contour is found, its
122 next contour is inside another? Maybe shoot out a line and brute-force
123 intersect it with all the segments in all the other contours? If every contour
127 Suppose each contour has one extra segment shooting straight up from the top
129 with the home contour, but is intersected with all other contours as part of
132 count the contour crossings and determine if the home contour is in another
133 contour o
[all...]
H A DLogoPlay.cpp195 for (int contour = 0; contour < rectCount; ++contour) {
196 const SkRect& rect = rects[contour];
198 rect.fRight, rect.fBottom, directions[contour] == SkPath::kCCW_Direction
/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];
H A DthingsToDo.txt116 Likewise, to resolve whether one contour is inside another, it seems that
119 is the inside/filled side. When the outer contour is walked, it seems like I
120 could record the inside info. I guess when the inner contour is found, its
122 next contour is inside another? Maybe shoot out a line and brute-force
123 intersect it with all the segments in all the other contours? If every contour
127 Suppose each contour has one extra segment shooting straight up from the top
129 with the home contour, but is intersected with all other contours as part of
132 count the contour crossings and determine if the home contour is in another
133 contour o
[all...]
H A DLogoPlay.cpp195 for (int contour = 0; contour < rectCount; ++contour) {
196 const SkRect& rect = rects[contour];
198 rect.fRight, rect.fBottom, directions[contour] == SkPath::kCCW_Direction
/external/chromium_org/third_party/brotli/src/woff2/
H A Dglyph.cc98 // Read the number of points per contour.
235 for (const auto& contour : glyph.contours) {
236 end_point += contour.size();
237 if (contour.size() > std::numeric_limits<uint16_t>::max() ||
256 for (const auto& contour : glyph.contours) {
257 for (const auto& point : contour) {
314 for (const auto& contour : glyph.contours) {
315 for (const auto& point : contour) {

Completed in 403 milliseconds

123