Lines Matching refs:points
40 #define COMPUTE_INFLEXS /* compute inflection points to optimize `S' */
889 /***** POINTS INTERPOLATION ROUTINES *****/
1029 /* compute all inflex points in a given glyph */
1044 /* we need at least 4 points to create an inflection point */
1147 FT_FREE( glyph->points );
1188 FT_Vector* vec = glyph->outline->points;
1189 PSH_Point point = glyph->points;
1223 PSH_Point point = glyph->points;
1224 FT_Vector* vec = glyph->outline->points;
1273 /* allocate and setup points + contours arrays */
1274 if ( FT_NEW_ARRAY( glyph->points, outline->n_points ) ||
1283 PSH_Point points = glyph->points;
1296 contour->start = points + first;
1301 point = points + first;
1303 point->prev = points + next - 1;
1313 point->next = points + first;
1322 PSH_Point points = glyph->points;
1323 PSH_Point point = points;
1324 FT_Vector* vec = outline->points;
1330 FT_Int n_prev = (FT_Int)( point->prev - points );
1331 FT_Int n_next = (FT_Int)( point->next - points );
1348 /* detect smooth points */
1472 point = &glyph->points[n];
1512 /* major_dir is the direction for points on the bottom/left of the stem; */
1513 /* Points on the top/right of the stem will have a direction of */
1661 /* the accepted shift for strong points in fractional pixels */
1668 /* find strong points in a glyph */
1691 /* process secondary hints to `selected' points */
1694 /* the `endchar' op can reduce the number of points */
1711 PSH_Point point = glyph->points + first;
1723 /* process primary hints for all points */
1727 PSH_Point point = glyph->points;
1736 /* now, certain points may have been attached to a hint and */
1740 PSH_Point point = glyph->points;
1750 /* find points in a glyph which are in a blue zone and have `in' or */
1760 PSH_Point point = glyph->points;
1773 /* skip strong points */
1826 /* interpolate strong points with the help of hinted coordinates */
1835 points;
1894 PSH_Point points = glyph->points;
1895 PSH_Point points_end = points + glyph->num_points;
1899 /* first count the number of strong points */
1900 for ( point = points; point < points_end; point++ )
1909 /* allocate an array to store a list of points, */
1923 for ( point = points; point < points_end; point++ )
1942 /* now try to interpolate all normal points */
1943 for ( point = points; point < points_end; point++ )
1948 /* sometimes, some local extrema are smooth points */
2031 /* interpolate other points */
2050 /* count the number of strong points in this contour */
2064 /* if there are less than 2 fitted points in the contour, we */
2065 /* simply scale and eventually translate the contour points */
2078 /* there are more than 2 strong points in this contour; we */
2079 /* need to interpolate weak points between them */
2085 /* skip consecutive fitted points */
2161 /* keep going until all points in the contours have been processed */
2279 /* find strong points, align them, then interpolate others */
