Searched refs:points (Results 1 - 25 of 424) sorted by relevance

1234567891011>>

/external/autotest/client/site_tests/firmware_TouchMTB/geometry/
H A Dtwo_farthest_clusters.py5 """Classify a set of points into two farthest clusters
7 - get_two_farthest_clusters(): Classify the points into two farthest clusters
18 def get_two_farthest_points(points):
19 """Calculate two farthest points from the list of given points.
21 Use a dumb brute force search for now since there are only a few points
24 if len(points) <= 1:
25 return points
28 for p1 in points:
29 for p2 in points
[all...]
/external/skia/src/svg/parser/
H A DSkSVGLinearGradient.cpp31 SkString points; local
32 points.appendUnichar('[');
33 points.append(f_x1);
34 points.appendUnichar(',');
35 points.append(f_y1);
36 points.appendUnichar(',');
37 points.append(f_x2);
38 points.appendUnichar(',');
39 points.append(f_y2);
40 points
[all...]
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/
H A DTweenPath.java17 * @param points The waypoints of the tween, from start to target values.
18 * @param pointsCnt The number of valid points in the array.
21 public float compute(float t, float[] points, int pointsCnt); argument
/external/ImageMagick/PerlMagick/demo/
H A Dpiddle.pl16 $image->Draw(primitive=>'line',points=>"$i,0 $i,300",stroke=>"#ccf");
17 $image->Draw(primitive=>'line',points=>"0,$i 300,$i",stroke=>"#ccf");
23 strokewidth=>4,points=>'30,30 100,100 10,10');
27 $image->Draw(primitive=>'bezier',points=>'20,20, 100,50, 50,100, 160,160',
32 $image->Draw(primitive=>'line',points=>"10,200 20,190",stroke=>red);
37 points=>"170,70 200,70");
39 points=>'M170,70 v-30 a30,30 0 0,0 -30,30 z');
41 points=>"170,70 200,70");
46 points=>"160,120 130,190 210,145 110,145 190,190 160,120",stroke=>red,
51 $image->Draw(primitive=>'line',points
[all...]
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/paths/
H A DCatmullRom.java10 public float compute(float t, float[] points, int pointsCnt) { argument
18 return catmullRomSpline(points[0], points[0], points[1], points[2], t);
22 return catmullRomSpline(points[pointsCnt-3], points[pointsCnt-2], points[pointsCnt-1], points[pointsCnt-1], t);
25 return catmullRomSpline(points[segmen
[all...]
H A DLinear.java10 public float compute(float t, float[] points, int pointsCnt) { argument
17 return points[segment] + t * (points[segment+1] - points[segment]);
/external/mesa3d/src/glx/
H A Deval.c41 const GLfloat * points, GLubyte * pc)
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
51 __GLX_PUT_FLOAT_ARRAY(0, points, k);
52 points += stride;
60 const GLdouble * points, GLubyte * pc)
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
69 __GLX_PUT_DOUBLE_ARRAY(0, points, k);
70 points += stride;
79 const GLfloat * points, GLfloat * data)
85 __GLX_MEM_COPY(data, points, majorOrde
40 __glFillMap1f(GLint k, GLint order, GLint stride, const GLfloat * points, GLubyte * pc) argument
59 __glFillMap1d(GLint k, GLint order, GLint stride, const GLdouble * points, GLubyte * pc) argument
77 __glFillMap2f(GLint k, GLint majorOrder, GLint minorOrder, GLint majorStride, GLint minorStride, const GLfloat * points, GLfloat * data) argument
102 __glFillMap2d(GLint k, GLint majorOrder, GLint minorOrder, GLint majorStride, GLint minorStride, const GLdouble * points, GLdouble * data) argument
[all...]
/external/pdfium/xfa/src/fxbarcode/qrcode/
H A DBC_QRGridSampler.cpp34 CFX_FloatArray* points,
40 for (offset = 0; offset < points->GetSize() && nudged; offset += 2) {
41 int32_t x = (int32_t)(*points)[offset];
42 int32_t y = (int32_t)(*points)[offset + 1];
49 (*points)[offset] = 0.0f;
52 (*points)[offset] = (FX_FLOAT)(width - 1);
56 (*points)[offset + 1] = 0.0f;
59 (*points)[offset + 1] = (FX_FLOAT)(height - 1);
64 for (offset = (*points).GetSize() - 2; offset >= 0 && nudged; offset -= 2) {
65 int32_t x = (int32_t)(*points)[offse
33 CheckAndNudgePoints(CBC_CommonBitMatrix* image, CFX_FloatArray* points, int32_t& e) argument
115 CFX_FloatArray points; local
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/
H A DCluster.java25 * Cluster holding a set of {@link Clusterable} points.
26 * @param <T> the type of points that can be clustered
35 /** The points contained in this cluster. */
36 private final List<T> points; field in class:Cluster
47 points = new ArrayList<T>();
55 points.add(point);
59 * Get the points contained in the cluster.
60 * @return points contained in the cluster
63 return points;
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/collision/shapes/
H A DHullCollisionShape.java18 private float[] points; field in class:HullCollisionShape
24 this.points = getPoints(mesh);
25 createShape(this.points);
28 public HullCollisionShape(float[] points) { argument
29 this.points = points;
30 createShape(this.points);
38 capsule.write(points, "points", null);
49 this.points
57 createShape(float[] points) argument
[all...]
/external/fonttools/Lib/fontTools/pens/
H A DbasePen.py58 def curveTo(self, *points):
59 """Draw a cubic bezier with an arbitrary number of control points.
62 (control) points. If the number of control points is > 2, the
66 Let n be the number of control points (which is the number of
75 points" principle. See also decomposeQuadraticSegment().
79 def qCurveTo(self, *points):
83 points.
86 using 'implied points': between each two consequtive off-curve points,
[all...]
H A DtransformPen.py34 def curveTo(self, *points):
35 self._outPen.curveTo(*self._transformPoints(points))
37 def qCurveTo(self, *points):
38 if points[-1] is None:
39 points = self._transformPoints(points[:-1]) + [None]
41 points = self._transformPoints(points)
42 self._outPen.qCurveTo(*points)
44 def _transformPoints(self, points)
[all...]
/external/fonttools/Tools/fontTools/pens/
H A DbasePen.py58 def curveTo(self, *points):
59 """Draw a cubic bezier with an arbitrary number of control points.
62 (control) points. If the number of control points is > 2, the
66 Let n be the number of control points (which is the number of
75 points" principle. See also decomposeQuadraticSegment().
79 def qCurveTo(self, *points):
83 points.
86 using 'implied points': between each two consequtive off-curve points,
[all...]
H A DtransformPen.py34 def curveTo(self, *points):
35 self._outPen.curveTo(*self._transformPoints(points))
37 def qCurveTo(self, *points):
38 if points[-1] is None:
39 points = self._transformPoints(points[:-1]) + [None]
41 points = self._transformPoints(points)
42 self._outPen.qCurveTo(*points)
44 def _transformPoints(self, points)
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/scene/debug/
H A DSkeletonDebugger.java43 private SkeletonPoints points; field in class:SkeletonDebugger
51 points = new SkeletonPoints(skeleton);
54 attachChild(new Geometry(name+"_points", points));
68 points.updateGeometry();
72 return points;
/external/pdfium/xfa/src/fdp/include/
H A Dfde_pth.h17 virtual void AddBezier(const CFX_PointsF& points) = 0;
18 virtual void AddBeziers(const CFX_PointsF& points) = 0;
19 virtual void AddCurve(const CFX_PointsF& points,
23 virtual void AddLines(const CFX_PointsF& points) = 0;
26 virtual void AddPolygon(const CFX_PointsF& points) = 0;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
H A DGaussianParametersGuesser.java32 * points.
39 /** Observed points. */
46 * Constructs instance with the specified observed points.
48 * @param observations observed points upon which should base guess
61 * Guesses the parameters based on the observed points.
73 * Guesses the parameters based on the specified observed points.
75 * @param points observed points upon which should base guess
79 private double[] basicGuess(WeightedObservedPoint[] points) { argument
80 Arrays.sort(points, createWeightedObservedPointComparato
111 findMinY(WeightedObservedPoint[] points) argument
128 findMaxY(WeightedObservedPoint[] points) argument
154 interpolateXAtY(WeightedObservedPoint[] points, int startIdx, int idxStep, double y) argument
189 getInterpolationPointsForY(WeightedObservedPoint[] points, int startIdx, int idxStep, double y) argument
[all...]
/external/skia/bench/
H A DHairlinePathBench.cpp26 static const int points[] = { variable
90 int size = SK_ARRAY_COUNT(points);
101 path->moveTo(SkIntToScalar(points[base1] + xTrans),
102 SkIntToScalar(points[base1+1] + yTrans));
103 path->lineTo(SkIntToScalar(points[base2] + xTrans),
104 SkIntToScalar(points[base2+1] + yTrans));
105 path->lineTo(SkIntToScalar(points[base3] + xTrans),
106 SkIntToScalar(points[base3+1] + yTrans));
122 int size = SK_ARRAY_COUNT(points);
133 path->moveTo(SkIntToScalar(points[base
[all...]
/external/skia/src/animator/
H A DSkParseSVGPath.cpp31 //define our points
119 SkPoint points[3]; local
144 data = find_points(data, points, 1, relative, &c);
145 fPath.moveTo(points[0]);
147 c = points[0];
150 data = find_points(data, points, 1, relative, &c);
151 fPath.lineTo(points[0]);
152 c = points[0];
169 data = find_points(data, points, 3, relative, &c);
172 data = find_points(data, &points[
[all...]
/external/skia/tests/
H A DPathCoverageTest.cpp26 // For determining the maximum possible number of points to use in
39 static inline int estimate_distance(const SkPoint points[]) { argument
40 return cheap_distance(points[1].fX * 2 - points[2].fX - points[0].fX,
41 points[1].fY * 2 - points[2].fY - points[0].fY);
44 static inline SkScalar compute_distance(const SkPoint points[]) { argument
45 return points[
69 quadraticPointCount_EE(const SkPoint points[]) argument
74 quadraticPointCount_EC(const SkPoint points[], SkScalar tol) argument
79 quadraticPointCount_CE(const SkPoint points[]) argument
84 quadraticPointCount_CC(const SkPoint points[], SkScalar tol) argument
[all...]
/external/skia/src/utils/
H A DSkParsePath.cpp81 SkPoint points[3]; local
113 data = find_points(data, points, 1, relative, &c);
114 path.moveTo(points[0]);
117 c = points[0];
120 data = find_points(data, points, 1, relative, &c);
121 path.lineTo(points[0]);
122 c = points[0];
137 data = find_points(data, points, 3, relative, &c);
140 data = find_points(data, &points[1], 2, relative, &c);
141 points[
[all...]
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/collision/shapes/
H A DHullCollisionShape.java18 private float[] points; field in class:HullCollisionShape
25 this.points = getPoints(mesh);
29 public HullCollisionShape(float[] points) { argument
30 this.points = points;
39 capsule.write(points, "points", null);
50 this.points = getPoints(mesh);
52 this.points = capsule.readFloatArray("points", nul
84 createShape(ByteBuffer points) argument
[all...]
/external/chromium-trace/catapult/third_party/flot/
H A Djquery.flot.fillbetween.js25 extra data points might be inserted through interpolation. Note that at points
75 points = datapoints.points,
77 otherpoints = other.datapoints.points,
90 if ( i >= points.length ) {
96 if ( points[ i ] == null ) {
101 newpoints.push( points[ i + m ] );
108 // for lines, we can't use the rest of the points
112 newpoints.push( points[
[all...]
H A Djquery.flot.fillbetween.min.js7 (function($){var options={series:{fillBetween:null}};function init(plot){function findBottomSeries(s,allseries){var i;for(i=0;i<allseries.length;++i){if(allseries[i].id===s.fillBetween){return allseries[i]}}if(typeof s.fillBetween==="number"){if(s.fillBetween<0||s.fillBetween>=allseries.length){return null}return allseries[s.fillBetween]}return null}function computeFillBottoms(plot,s,datapoints){if(s.fillBetween==null){return}var other=findBottomSeries(s,plot.getData());if(!other){return}var ps=datapoints.pointsize,points=datapoints.points,otherps=other.datapoints.pointsize,otherpoints=other.datapoints.points,newpoints=[],px,py,intery,qx,qy,bottom,withlines=s.lines.show,withbottom=ps>2&&datapoints.format[2].y,withsteps=withlines&&s.lines.steps,fromgap=true,i=0,j=0,l,m;while(true){if(i>=points.length){break}l=newpoints.length;if(points[i]==null){for(m=0;m<ps;++m){newpoints.push(points[i+m])}i+=ps}else if(j>=otherpoints.length){if(!withlines){for(m=0;m<ps;++m){newpoints.push(points[i+m])}}i+=ps}else if(otherpoints[j]==null){for(m=0;m<ps;++m){newpoints.push(null)}fromgap=true;j+=otherps}else{px=points[i];py=points[i+1];qx=otherpoints[j];qy=otherpoints[j+1];bottom=0;if(px===qx){for(m=0;m<ps;++m){newpoints.push(points[
[all...]
H A Djquery.flot.stack.js32 offset to the y value. For line series, extra data points are inserted through
66 points = datapoints.points,
68 otherpoints = other.datapoints.points,
81 if (i >= points.length)
86 if (points[i] == null) {
89 newpoints.push(points[i + m]);
93 // for lines, we can't use the rest of the points
96 newpoints.push(points[i + m]);
108 // cases where we actually got two points
[all...]

Completed in 609 milliseconds

1234567891011>>