/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...] |
extendededges.cpp | 74 //get vertical list of segments for one contour 120 //makes vertical list of segments for 1 contour 127 //approx contour by single edges 139 //first pass through contour - compute number of branches at every point 178 //exclude this point from contour 224 //approx contour by single edges
|
/external/skia/include/core/ |
SkPath.h | 38 The SkPath class encapsulates compound (multiple contour) geometric paths 143 * If there is more than one contour, this returns kConcave_Convexity. 144 * If the contour is degenerate (e.g. there are fewer than 3 non-degenerate 146 * The contour is treated as if it were closed, even if there is no kClose 255 /** Set the beginning of the next contour to the point (x,y). 257 @param x The x-coordinate of the start of a new contour 258 @param y The y-coordinate of the start of a new contour 262 /** Set the beginning of the next contour to the point 264 @param p The start of a new contour 270 /** Set the beginning of the next contour relative to the last point on th [all...] |
SkPathMeasure.h | 41 /** Return the total length of the current contour, or 0 if no path 72 /** Return true if the current contour is closed() 76 /** Move to the next contour in the path. Return true if one exists, or false if 88 SkScalar fLength; // relative to the current contour 89 int fFirstPtIndex; // relative to the current contour 90 bool fIsClosed; // relative to the current contour
|
/external/opencv/cv/src/ |
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...] |
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...] |
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...] |
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...] |
cvmatchcontours.cpp | 49 // contour_1 - pointer to the first input contour object. 50 // contour_2 - pointer to the second input contour object. 212 // Calculates matching of the two contour trees 215 // tree1 - pointer to the first input contour tree object. 216 // tree2 - pointer to the second input contour tree object. 219 // threshold - threshold for the contour trees matching 248 CV_ERROR( CV_StsBadArg, "The first argument is not a valid contour tree" ); 251 CV_ERROR( CV_StsBadArg, "The second argument is not a valid contour tree" );
|
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...] |
/frameworks/base/graphics/java/android/graphics/ |
Path.java | 22 * The Path class encapsulates compound (multiple contour) geometric paths 210 * Set the beginning of the next contour to the point (x,y). 212 * @param x The x-coordinate of the start of a new contour 213 * @param y The y-coordinate of the start of a new contour 220 * Set the beginning of the next contour relative to the last point on the 221 * previous contour. If there is no previous contour, this is treated the 225 * previous contour, to specify the start of a new contour 227 * previous contour, to specify the start of a new contou [all...] |
PathMeasure.java | 46 * even if its contour was not explicitly closed. 67 * Return the total length of the current contour, or 0 if no path is 80 * @param distance The distance along the current contour to sample 122 * Return true if the current contour is closed() 129 * Move to the next contour in the path. Return true if one exists, or
|
/external/webkit/Source/WebCore/platform/graphics/gpu/ |
LoopBlinnPathProcessor.cpp | 63 using LoopBlinnPathProcessorImplementation::Contour; 153 Contour* contour, 160 m_contour = contour; 171 Contour* contour, 176 m_contour = contour; 198 // The contour this segment belongs to. 199 Contour* contour() const { return m_contour; function in class:WebCore::LoopBlinnPathProcessorImplementation::Segment 621 Contour* contour = 0; local [all...] |
LoopBlinnPathProcessor.h | 44 class Contour; 83 // Determines whether the left or right side of each contour should 87 // Determines whether the given (closed) contour is oriented 89 void determineOrientation(LoopBlinnPathProcessorImplementation::Contour*); 105 Vector<LoopBlinnPathProcessorImplementation::Segment*> allSegmentsOverlappingY(LoopBlinnPathProcessorImplementation::Contour*, float x, float y); 116 Vector<LoopBlinnPathProcessorImplementation::Contour*> m_contours;
|
/external/skia/src/core/ |
SkConcaveToTriangles.h | 28 // islands within the holes must have the same orientation as the outer contour. 31 // Currently, the outer contour must be right-handed, i.e. it should be oriented
|
/frameworks/base/tools/layoutlib/bridge/src/android/graphics/ |
Path_Delegate.java | 566 * Set the beginning of the next contour to the point (x,y). 568 * @param x The x-coordinate of the start of a new contour 569 * @param y The y-coordinate of the start of a new contour 576 * Set the beginning of the next contour relative to the last point on the 577 * previous contour. If there is no previous contour, this is treated the 581 * previous contour, to specify the start of a new contour 583 * previous contour, to specify the start of a new contour [all...] |
/external/skia/include/effects/ |
Sk1DPathEffect.h | 32 /** Called at the start of each contour, returns the initial offset 33 into that contour. 39 contour is done.
|
/external/harfbuzz/src/ |
harfbuzz-gdef-private.h | 45 HB_UShort* PointIndex; /* array of contour points */ 61 HB_UShort CaretValuePoint; /* contour point index on glyph */
|
/external/opencv/cv/include/ |
cvtypes.h | 73 CvSeq* contour; /* optional component boundary member in struct:CvConnectedComp 74 (the contour might have child contours corresponding to the holes)*/ 84 /* contour retrieval mode */ 90 /* contour approximation method */ 115 /* Contour tree header */ 124 /* Finds a sequence of convexity defects of given contour */ 127 CvPoint* start; /* point of the contour where the defect begins */ 128 CvPoint* end; /* point of the contour where the defect ends */
|
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/freetype/src/base/ |
ftoutln.c | 67 FT_Int n; /* index of contour in outline */ 68 FT_UInt first; /* index of first point in contour */ 84 FT_Int last; /* index of last point in contour */ 108 /* A contour cannot start with a cubic control point! */ 269 /* close the contour with a line segment */ 359 /* check point and contour counts */ 724 /* Is a point in some contour? */ 726 /* We treat every point of the contour as if it */ 809 /* part (contour not enclosed in another contour) of the * 984 short* contour; local [all...] |
/external/skia/include/utils/ |
SkCullPoints.h | 29 /** Start a contour at (x,y). Follow this with call(s) to lineTo(...)
|
/external/freetype/src/pshinter/ |
pshalgo.h | 139 PSH_POINT_POSITIVE = 128, /* extremum has positive contour flow */ 140 PSH_POINT_NEGATIVE = 256, /* extremum has negative contour flow */ 166 PSH_Contour contour; member in struct:PSH_PointRec_
|