Lines Matching full:points
110 *points;
405 if ((p->points[0].y-DrawEpsilon) > q->points[0].y)
407 if ((p->points[0].y+DrawEpsilon) < q->points[0].y)
409 if ((p->points[0].x-DrawEpsilon) > q->points[0].x)
411 if ((p->points[0].x+DrawEpsilon) < q->points[0].x)
413 if (((p->points[1].x-p->points[0].x)*(q->points[1].y-q->points[0].y)-
414 (p->points[1].y-p->points[0].y)*(q->points[1].x-q->points[0].x)) > 0.0)
447 p->points[j].x,p->points[j].y);
453 points,const size_t number_points)
463 point=points[i];
464 points[i]=points[number_points-(i+1)];
465 points[number_points-(i+1)]=point;
477 *points;
515 points=(PointInfo *) NULL;
526 if ((points != (PointInfo *) NULL) && (n >= 2))
543 ReversePoints(points,(size_t) n);
544 polygon_info->edges[edge].points=points;
546 polygon_info->edges[edge].bounds.y1=points[0].y;
547 polygon_info->edges[edge].bounds.y2=points[n-1].y;
548 points=(PointInfo *) NULL;
552 if (points == (PointInfo *) NULL)
555 points=(PointInfo *) AcquireQuantumMemory((size_t) number_points,
556 sizeof(*points));
557 if (points == (PointInfo *) NULL)
562 points[0]=point;
575 if ((points != (PointInfo *) NULL) && (direction != 0) &&
581 point=points[n-1];
597 ReversePoints(points,(size_t) n);
598 polygon_info->edges[edge].points=points;
600 polygon_info->edges[edge].bounds.y1=points[0].y;
601 polygon_info->edges[edge].bounds.y2=points[n-1].y;
603 points=(PointInfo *) AcquireQuantumMemory((size_t) number_points,
604 sizeof(*points));
605 if (points == (PointInfo *) NULL)
609 points[0]=point;
615 if (points == (PointInfo *) NULL)
620 points=(PointInfo *) ResizeQuantumMemory(points,(size_t) number_points,
621 sizeof(*points));
622 if (points == (PointInfo *) NULL)
626 points[n]=point;
633 if (points != (PointInfo *) NULL)
636 points=(PointInfo *) RelinquishMagickMemory(points);
654 ReversePoints(points,(size_t) n);
655 polygon_info->edges[edge].points=points;
657 polygon_info->edges[edge].bounds.y1=points[0].y;
658 polygon_info->edges[edge].bounds.y2=points[n-1].y;
776 Eliminate duplicate points.
905 polygon_info->edges[edge].points=(PointInfo *) RelinquishMagickMemory(
906 polygon_info->edges[edge].points);
943 polygon_info->edges[i].points=(PointInfo *)
944 RelinquishMagickMemory(polygon_info->edges[i].points);
2913 Define points.
2972 Speculate how many points our primitive might consume.
3051 Resize based on speculative points required by primitive.
3230 Transform points.
3844 if ((double) y <= (p->points[i-1].y-mid-0.5))
3846 if ((double) y > (p->points[i].y+mid+0.5))
3856 q=p->points+i-1;
3951 if ((double) y <= p->points[i].y)
3953 q=p->points+i-1;
5153 points[3],
5198 points[0].x=(double) (cosine*start.x/radii.x+sine*start.y/radii.x);
5199 points[0].y=(double) (cosine*start.y/radii.y-sine*start.x/radii.y);
5200 points[1].x=(double) (cosine*end.x/radii.x+sine*end.y/radii.x);
5201 points[1].y=(double) (cosine*end.y/radii.y-sine*end.x/radii.y);
5202 alpha=points[1].x-points[0].x;
5203 beta=points[1].y-points[0].y;
5213 center.x=(double) ((points[0].x+points[1].x)/2-factor*beta);
5214 center.y=(double) ((points[0].y+points[1].y)/2+factor*alpha);
5215 alpha=atan2(points[0].y-center.y,points[0].x-center.x);
5216 theta=atan2(points[1].y-center.y,points[1].x-center.x)-alpha;
5231 points[0].x=(double) (center.x+cos(fmod((double) (alpha+(double) i*theta/
5234 points[0].y=(double) (center.y+sin(fmod((double) (alpha+(double) i*theta/
5237 points[2].x=(double) (center.x+cos(fmod((double) (alpha+(double) (i+1)*
5239 points[2].y=(double) (center.y+sin(fmod((double) (alpha+(double) (i+1)*
5241 points[1].x=(double) (points[2].x+gamma*sin(fmod((double) (alpha+(double)
5243 points[1].y=(double) (points[2].y-gamma*cos(fmod((double) (alpha+(double)
5247 (p+1)->point.x=(double) (cosine*radii.x*points[0].x-sine*radii.y*
5248 points[0].y);
5249 (p+1)->point.y=(double) (sine*radii.x*points[0].x+cosine*radii.y*
5250 points[0].y);
5251 (p+2)->point.x=(double) (cosine*radii.x*points[1].x-sine*radii.y*
5252 points[1].y);
5253 (p+2)->point.y=(double) (sine*radii.x*points[1].x+cosine*radii.y*
5254 points[1].y);
5255 (p+3)->point.x=(double) (cosine*radii.x*points[2].x-sine*radii.y*
5256 points[2].y);
5257 (p+3)->point.y=(double) (sine*radii.x*points[2].x+cosine*radii.y*
5258 points[2].y);
5283 *points;
5317 points=(PointInfo *) AcquireQuantumMemory((size_t) control_points,
5318 sizeof(*points));
5319 if ((coefficients == (double *) NULL) || (points == (PointInfo *) NULL))
5322 Compute bezier points.
5341 points[i]=point;
5350 TracePoint(p,points[i]);
5361 points=(PointInfo *) RelinquishMagickMemory(points);
5476 points[4] = { {0.0,0.0}, {0.0,0.0}, {0.0,0.0}, {0.0,0.0} },
5522 Compute arc points.
5570 Compute bezier points.
5574 points[0]=point;
5587 points[i]=end;
5590 (q+i)->point=points[i];
5671 Compute bezier points.
5675 points[0]=point;
5690 points[i]=end;
5693 (q+i)->point=points[i];
5704 Compute bezier points.
5708 points[0]=points[3];
5709 points[1].x=2.0*points[3].x-points[2].x;
5710 points[1].y=2.0*points[3].y-points[2].y;
5725 points[i]=end;
5729 points[0]=point;
5730 points[1]=point;
5733 (q+i)->point=points[i];
5744 Compute bezier points.
5748 points[0]=points[2];
5749 points[1].x=2.0*points[2].x-points[1].x;
5750 points[1].y=2.0*points[2].y-points[1].y;
5763 points[i]=end;
5767 points[0]=point;
5768 points[1]=point;
5771 (q+i)->point=points[i];
