| /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/legacy/include/core/ |
| SkPath.h | 31 The SkPath class encapsulates compound (multiple contour) geometric paths
136 * If there is more than one contour, this returns kConcave_Convexity.
137 * If the contour is degenerate (e.g. there are fewer than 3 non-degenerate
139 * The contour is treated as if it were closed, even if there is no kClose
277 /** Set the beginning of the next contour to the point (x,y).
279 @param x The x-coordinate of the start of a new contour
280 @param y The y-coordinate of the start of a new contour
284 /** Set the beginning of the next contour to the point
286 @param p The start of a new contour
292 /** Set the beginning of the next contour relative to the last point on th
[all...] |
| SkPathMeasure.h | 34 /** Return the total length of the current contour, or 0 if no path
65 /** Return true if the current contour is closed()
69 /** Move to the next contour in the path. Return true if one exists, or false if
81 SkScalar fLength; // relative to the current contour
82 int fFirstPtIndex; // relative to the current contour
83 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" );
|
| /external/skia/legacy/src/core/ |
| SkConcaveToTriangles.h | 21 // islands within the holes must have the same orientation as the outer contour.
24 // Currently, the outer contour must be right-handed, i.e. it should be oriented
|
| /frameworks/base/graphics/java/android/graphics/ |
| Path.java | 22 * The Path class encapsulates compound (multiple contour) geometric paths
214 * Set the beginning of the next contour to the point (x,y).
216 * @param x The x-coordinate of the start of a new contour
217 * @param y The y-coordinate of the start of a new contour
224 * Set the beginning of the next contour relative to the last point on the
225 * previous contour. If there is no previous contour, this is treated the
229 * previous contour, to specify the start of a new contour
231 * previous contour, to specify the start of a new contou
[all...] |
| PathMeasure.java | 48 * even if its contour was not explicitly closed.
68 * Return the total length of the current contour, or 0 if no path is
81 * @param distance The distance along the current contour to sample
123 * Return true if the current contour is closed()
130 * Move to the next contour in the path. Return true if one exists, or
|
| /external/skia/include/core/ |
| SkPath.h | 39 The SkPath class encapsulates compound (multiple contour) geometric paths
317 * will ever return true for single convex contour paths. The empty-status of the rect is not
333 /** Set the beginning of the next contour to the point (x,y).
335 @param x The x-coordinate of the start of a new contour
336 @param y The y-coordinate of the start of a new contour
340 /** Set the beginning of the next contour to the point
342 @param p The start of a new contour
348 /** Set the beginning of the next contour relative to the last point on the
349 previous contour. If there is no previous contour, this is treated th
[all...] |
| SkPathMeasure.h | 34 /** Return the total length of the current contour, or 0 if no path
69 /** Return true if the current contour is closed()
73 /** Move to the next contour in the path. Return true if one exists, or false if
85 SkScalar fLength; // relative to the current contour
86 int fFirstPtIndex; // relative to the current contour
87 bool fIsClosed; // relative to the current contour
|
| /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/include/effects/ |
| Sk1DPathEffect.h | 23 /** Called at the start of each contour, returns the initial offset
24 into that contour.
30 contour is done.
|
| /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/legacy/include/effects/ |
| Sk1DPathEffect.h | 25 /** Called at the start of each contour, returns the initial offset
26 into that contour.
32 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/harfbuzz_ng/src/hb-old/ |
| 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...] |
