/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% DDDD RRRR AAA W W %
% D D R R A A W W %
% D D RRRR AAAAA W W %
% D D R R A A W W W %
% DDDD R R A A W W %
% %
% %
% ImageMagick Image Drawing Methods %
% %
% %
% Software Design %
% John Cristy %
% July 1992 %
% %
% %
% Copyright (C) 2001 ImageMagick Studio, a non-profit organization dedicated %
% to making software imaging solutions freely available. %
% %
% Permission is hereby granted, free of charge, to any person obtaining a %
% copy of this software and associated documentation files ("ImageMagick"), %
% to deal in ImageMagick without restriction, including without limitation %
% the rights to use, copy, modify, merge, publish, distribute, sublicense, %
% and/or sell copies of ImageMagick, and to permit persons to whom the %
% ImageMagick is furnished to do so, subject to the following conditions: %
% %
% The above copyright notice and this permission notice shall be included in %
% all copies or substantial portions of ImageMagick. %
% %
% The software is provided "as is", without warranty of any kind, express or %
% implied, including but not limited to the warranties of merchantability, %
% fitness for a particular purpose and noninfringement. In no event shall %
% ImageMagick Studio be liable for any claim, damages or other liability, %
% whether in an action of contract, tort or otherwise, arising from, out of %
% or in connection with ImageMagick or the use or other dealings in %
% ImageMagick. %
% %
% Except as contained in this notice, the name of the ImageMagick Studio %
% shall not be used in advertising or otherwise to promote the sale, use or %
% other dealings in ImageMagick without prior written authorization from the %
% ImageMagick Studio. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Bill Radcliffe of Corbis (www.corbis.com) contributed the polygon
% rendering code. Parts of the fast rendering algorithm was inspired by
% libart. Digital Applications (www.digapp.com) contributed the dash
% pattern and linecap stroking algorithm. It was written by David Harr.
%
*/
/*
Include declarations.
*/
#include "magick.h"
#include "defines.h"
/*
Define declarations.
*/
#define BezierQuantum 200
#define MatteMatch(color,target,delta) \
(ColorMatch(color,target,delta) && ((color).opacity == (target).opacity))
#define MaxStacksize (1 << 15)
#define Push(up,left,right,delta) \
if ((s < (segment_stack+MaxStacksize)) && (((up)+(delta)) >= 0) && \
(((up)+(delta)) < (int) image->rows)) \
{ \
s->y1=(up); \
s->x1=(left); \
s->x2=(right); \
s->y2=(delta); \
s++; \
}
/*
Typedef declarations.
*/
typedef enum
{
MoveToCode,
OpenCode,
GhostlineCode,
LineToCode,
EndCode
} PathInfoCode;
typedef struct _PathInfo
{
PointInfo
point;
PathInfoCode
code;
} PathInfo;
/*
Forward declarations.
*/
static unsigned int
DrawPrimitive(const DrawInfo *,const PrimitiveInfo *,Image *),
TracePath(PrimitiveInfo *,const char *);
static void
DrawStrokePolygon(const DrawInfo *,const PrimitiveInfo *,Image *),
TraceArc(PrimitiveInfo *,const PointInfo,const PointInfo,const PointInfo,
const double,const unsigned int,const unsigned int),
TraceBezier(PrimitiveInfo *,const unsigned int),
TraceCircle(PrimitiveInfo *,const PointInfo,const PointInfo),
TraceEllipse(PrimitiveInfo *,const PointInfo,const PointInfo,const PointInfo),
TraceLine(PrimitiveInfo *,const PointInfo,const PointInfo),
TracePoint(PrimitiveInfo *,const PointInfo),
TraceRectangle(PrimitiveInfo *,const PointInfo,const PointInfo),
TraceRoundRectangle(PrimitiveInfo *,const PointInfo,const PointInfo,
PointInfo),
TraceSquareLinecap(PrimitiveInfo *,const int,const double);
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C l o n e D r a w I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method CloneDrawInfo makes a duplicate of the given draw info, or if draw
% info is NULL, a new one.
%
% The format of the CloneDrawInfo method is:
%
% DrawInfo *CloneDrawInfo(const ImageInfo *image_info,
% const DrawInfo *draw_info)
%
% A description of each parameter follows:
%
% o clone_info: Method CloneDrawInfo returns a duplicate of the given
% annotate info, or if annotate info is NULL a new one.
%
% o image_info: a structure of type ImageInfo.
%
% o draw_info: a structure of type DrawInfo.
%
%
*/
MagickExport DrawInfo *CloneDrawInfo(const ImageInfo *image_info,
const DrawInfo *draw_info)
{
DrawInfo
*clone_info;
clone_info=(DrawInfo *) AcquireMemory(sizeof(DrawInfo));
if (clone_info == (DrawInfo *) NULL)
MagickError(ResourceLimitError,"Unable to clone draw info",
"Memory allocation failed");
if (draw_info == (DrawInfo *) NULL)
{
GetDrawInfo(image_info,clone_info);
return(clone_info);
}
*clone_info=(*draw_info);
if (draw_info->primitive != (char *) NULL)
clone_info->primitive=AllocateString(draw_info->primitive);
if (draw_info->text != (char *) NULL)
clone_info->text=AllocateString(draw_info->text);
if (draw_info->geometry != (char *) NULL)
clone_info->geometry=AllocateString(draw_info->geometry);
if (draw_info->dash_pattern != (unsigned int *) NULL)
{
register int
x;
for (x=0; draw_info->dash_pattern[x]; x++);
clone_info->dash_pattern=(unsigned int *)
AcquireMemory((x+1)*sizeof(unsigned int));
if (clone_info->dash_pattern == (unsigned int *) NULL)
MagickError(ResourceLimitError,"Unable to clone dash pattern",
"Memory allocation failed");
memcpy(clone_info->dash_pattern,draw_info->dash_pattern,
(x+1)*sizeof(unsigned int));
}
if (draw_info->font != (char *) NULL)
clone_info->font=AllocateString(draw_info->font);
if (draw_info->density != (char *) NULL)
clone_info->density=AllocateString(draw_info->density);
if (draw_info->tile != (Image *) NULL)
clone_info->tile=
CloneImage(draw_info->tile,0,0,True,&draw_info->tile->exception);
if (draw_info->server_name != (char *) NULL)
clone_info->server_name=AllocateString(draw_info->server_name);
if (draw_info->clip_path.number_edges != 0)
{
clone_info->clip_path.edges=(EdgeInfo *)
AcquireMemory(draw_info->clip_path.number_edges*sizeof(EdgeInfo));
if (clone_info->clip_path.edges == (EdgeInfo *) NULL)
MagickError(ResourceLimitWarning,"Unable to clone draw info",
"Memory allocation failed");
memcpy(clone_info->clip_path.edges,draw_info->clip_path.edges,
draw_info->clip_path.number_edges*sizeof(EdgeInfo));
}
return(clone_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o l o r F l o o d f i l l I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method ColorFloodfillImage floodfills the designated area with a color.
% The floodfill algorithm is strongly based on a similar algorithm in
% "Graphics Gems" by Paul Heckbert.
%
% The format of the ColorFloodfillImage method is:
%
% unsigned int ColorFloodfillImage(Image *image,const DrawInfo *draw_info,
% const PixelPacket target,const int x_offset,const int y_offset,
% const PaintMethod method)
%
% A description of each parameter follows:
%
% o image: The address of a structure of type Image.
%
% o draw_info: a structure of type DrawInfo.
%
% o target: A PixelPacket structure. This is the RGB value of the target
% color.
%
% o x,y: Unsigned integers representing the current location of the pen.
%
% o method: drawing method of type PrimitiveType: floodfill or fill to
% border.
%
%
*/
MagickExport unsigned int ColorFloodfillImage(Image *image,
const DrawInfo *draw_info,const PixelPacket target,const int x_offset,
const int y_offset,const PaintMethod method)
{
int
offset,
skip,
start,
x1,
x2,
y;
PixelPacket
color;
register IndexPacket
*indexes;
register int
i,
x;
register PixelPacket
*p,
*q;
register SegmentInfo
*s;
SegmentInfo
*segment_stack;
/*
Check boundary conditions.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
assert(draw_info != (DrawInfo *) NULL);
assert(draw_info->signature == MagickSignature);
if ((x_offset < 0) || (x_offset >= (int) image->columns))
return(False);
if ((y_offset < 0) || (y_offset >= (int) image->rows))
return(False);
/*
Set floodfill color.
*/
if (ColorMatch(draw_info->fill,target,image->fuzz))
return(False);
segment_stack=(SegmentInfo *) AcquireMemory(MaxStacksize*sizeof(SegmentInfo));
if (segment_stack == (SegmentInfo *) NULL)
ThrowBinaryException(ResourceLimitWarning,"Unable to floodfill image",
image->filename);
/*
Track "hot" pixels with the image index packets.
*/
image->storage_class=PseudoClass;
for (y=0; y < (int) image->rows; y++)
{
p=GetImagePixels(image,0,y,image->columns,1);
if (p == (PixelPacket *) NULL)
break;
indexes=GetIndexes(image);
for (x=0; x < (int) image->columns; x++)
indexes[x]=False;
if (!SyncImagePixels(image))
break;
}
/*
Push initial segment on stack.
*/
x=x_offset;
y=y_offset;
start=0;
s=segment_stack;
Push(y,x,x,1);
Push(y+1,x,x,-1);
while (s > segment_stack)
{
/*
Pop segment off stack.
*/
s--;
x1=(int) s->x1;
x2=(int) s->x2;
offset=(int) s->y2;
y=(int) s->y1+offset;
/*
Recolor neighboring pixels.
*/
q=GetImagePixels(image,0,y,x1+1,1);
if (q == (PixelPacket *) NULL)
break;
q+=x1;
indexes=GetIndexes(image);
for (x=x1; x >= 0 ; x--)
{
if (method == FloodfillMethod)
{
if (!ColorMatch(*q,target,image->fuzz))
break;
}
else
if (ColorMatch(*q,target,image->fuzz) ||
ColorMatch(*q,draw_info->fill,image->fuzz))
break;
indexes[x]=True;
*q=draw_info->fill;
q--;
}
if (!SyncImagePixels(image))
break;
skip=x >= x1;
if (!skip)
{
start=x+1;
if (start < x1)
Push(y,start,x1-1,-offset);
x=x1+1;
}
do
{
if (!skip)
{
if (x < image->columns)
{
q=GetImagePixels(image,x,y,image->columns-x,1);
if (q == (PixelPacket *) NULL)
break;
indexes=GetIndexes(image);
for (i=0; x < (int) image->columns; x++)
{
if (method == FloodfillMethod)
{
if (!ColorMatch(*q,target,image->fuzz))
break;
}
else
if (ColorMatch(*q,target,image->fuzz) ||
ColorMatch(*q,draw_info->fill,image->fuzz))
break;
indexes[i++]=True;
*q=draw_info->fill;
q++;
}
if (!SyncImagePixels(image))
break;
}
Push(y,start,x-1,offset);
if (x > (x2+1))
Push(y,x2+1,x-1,-offset);
}
skip=False;
x++;
if (x <= x2)
{
q=GetImagePixels(image,x,y,x2-x+1,1);
if (q == (PixelPacket *) NULL)
break;
for ( ; x <= x2; x++)
{
if (method == FloodfillMethod)
{
if (ColorMatch(*q,target,image->fuzz))
break;
}
else
if (!ColorMatch(*q,target,image->fuzz) &&
!ColorMatch(*q,draw_info->fill,image->fuzz))
break;
q++;
}
}
start=x;
} while (x <= x2);
}
if (draw_info->tile == (Image *) NULL)
for (y=0; y < (int) image->rows; y++)
{
/*
Tile fill color onto floodplane.
*/
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
indexes=GetIndexes(image);
for (x=0; x < (int) image->columns; x++)
{
if (indexes[x])
*q=draw_info->fill;
q++;
}
if (!SyncImagePixels(image))
break;
}
else
{
/*
Tile image onto floodplane.
*/
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
indexes=GetIndexes(image);
for (x=0; x < (int) image->columns; x++)
{
if (indexes[x])
{
color=GetOnePixel(draw_info->tile,x % draw_info->tile->columns,
y % draw_info->tile->rows);
if (!draw_info->tile->matte)
color.opacity=OpaqueOpacity;
switch (color.opacity)
{
case TransparentOpacity:
break;
case OpaqueOpacity:
{
*q=color;
break;
}
default:
{
AlphaComposite(&color,color.opacity,q,q->opacity);
break;
}
}
}
q++;
}
if (!SyncImagePixels(image))
break;
}
}
image->storage_class=DirectClass;
LiberateMemory((void **) &segment_stack);
return(True);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C o n v e r t P a t h T o P o l y g o n %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method ConvertPathToPolygon converts a path to the more efficient sorted
% rendering form.
%
% The format of the ConvertPathToPolygon method is:
%
% PolygonInfo *ConvertPathToPolygon(const DrawInfo *draw_info,
% const PathInfo *path_info)
%
% A description of each parameter follows:
%
% o Method ConvertPathToPolygon returns the path in a more efficient sorted
% rendering form of type PolygonInfo.
%
% o draw_info: Specifies a pointer to an DrawInfo structure.
%
% o path_info: Specifies a pointer to an PathInfo structure.
%
%
*/
#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif
static int CompareEdges(const void *x,const void *y)
{
register const EdgeInfo
*p,
*q;
/*
Compare two edges.
*/
p=(EdgeInfo *) x;
q=(EdgeInfo *) y;
if ((p->points[0].y-MagickEpsilon) > q->points[0].y)
return(1);
if ((p->points[0].y+MagickEpsilon) < q->points[0].y)
return(-1);
if ((p->points[0].x-MagickEpsilon) > q->points[0].x)
return(1);
if ((p->points[0].x+MagickEpsilon) < q->points[0].x)
return(-1);
if (((p->points[1].x-p->points[0].x)*(q->points[1].y-q->points[0].y)-
(p->points[1].y-p->points[0].y)*(q->points[1].x-q->points[0].x)) > 0.0)
return(1);
return(-1);
}
#if defined(__cplusplus) || defined(c_plusplus)
}
#endif
static void PrintPolygonInfo(const PolygonInfo *polygon_info)
{
register EdgeInfo
*p;
register int
i,
j;
(void) fprintf(stdout," begin active-edge\n");
p=polygon_info->edges;
for (i=0; i < polygon_info->number_edges; i++)
{
(void) fprintf(stdout," edge %d:\n direction: %s\n "
"ghostline: %s\n bounds: %g,%g - %g,%g\n",i,
p->direction ? "down" : "up",p->ghostline ? "transparent" : "opaque",
p->bounds.x1,p->bounds.y1,p->bounds.x2,p->bounds.y2);
for (j=0; j < p->number_points; j++)
(void) fprintf(stdout," %g,%g\n",p->points[j].x,p->points[j].y);
p++;
}
(void) fprintf(stdout," end active-edge\n");
}
static void ReversePoints(PointInfo *points,const int number_points)
{
PointInfo
point;
register int
i;
for (i=0; i < (number_points >> 1); i++)
{
point=points[i];
points[i]=points[number_points-(i+1)];
points[number_points-(i+1)]=point;
}
}
static PolygonInfo *ConvertPathToPolygon(const DrawInfo *draw_info,
const PathInfo *path_info)
{
int
direction,
edge,
ghostline,
next_direction,
number_edges,
number_points;
PointInfo
point,
*points;
PolygonInfo
*polygon_info;
SegmentInfo
bounds;
register int
i,
n;
/*
Convert a path to the more efficient sorted rendering form.
*/
polygon_info=(PolygonInfo *) AcquireMemory(sizeof(PolygonInfo));
if (polygon_info == (PolygonInfo *) NULL)
return((PolygonInfo *) NULL);
number_edges=16;
polygon_info->edges=(EdgeInfo *) AcquireMemory(number_edges*sizeof(EdgeInfo));
if (polygon_info->edges == (EdgeInfo *) NULL)
return((PolygonInfo *) NULL);
direction=0;
edge=0;
ghostline=False;
n=0;
number_points=0;
points=(PointInfo *) NULL;
memset(&point,0,sizeof(PointInfo));
memset(&bounds,0,sizeof(SegmentInfo));
for (i=0; path_info[i].code != EndCode; i++)
{
if ((path_info[i].code == MoveToCode) || (path_info[i].code == OpenCode) ||
(path_info[i].code == GhostlineCode))
{
/*
Move to.
*/
if ((points != (PointInfo *) NULL) && (n >= 2))
{
if (edge == number_edges)
{
number_edges<<=1;
ReacquireMemory((void **) &polygon_info->edges,
number_edges*sizeof(EdgeInfo));
if (polygon_info->edges == (EdgeInfo *) NULL)
return((PolygonInfo *) NULL);
}
polygon_info->edges[edge].number_points=n;
polygon_info->edges[edge].scanline=(-1.0);
polygon_info->edges[edge].highwater=0;
polygon_info->edges[edge].ghostline=ghostline;
polygon_info->edges[edge].direction=direction > 0;
if (direction < 0)
ReversePoints(points,n);
polygon_info->edges[edge].points=points;
polygon_info->edges[edge].bounds=bounds;
polygon_info->edges[edge].bounds.y1=points[0].y;
polygon_info->edges[edge].bounds.y2=points[n-1].y;
points=(PointInfo *) NULL;
ghostline=False;
edge++;
}
if (points == (PointInfo *) NULL)
{
number_points=16;
points=(PointInfo *) AcquireMemory(number_points*sizeof(PointInfo));
if (points == (PointInfo *) NULL)
return((PolygonInfo *) NULL);
}
ghostline=path_info[i].code == GhostlineCode;
point=path_info[i].point;
points[0]=point;
bounds.x1=point.x;
bounds.x2=point.x;
direction=0;
n=1;
continue;
}
/*
Line to.
*/
next_direction=((path_info[i].point.y > point.y) ||
((path_info[i].point.y == point.y) &&
(path_info[i].point.x > point.x))) ? 1 : -1;
if (direction && (direction != next_direction))
{
/*
New edge.
*/
point=points[n-1];
if (edge == number_edges)
{
number_edges<<=1;
ReacquireMemory((void **) &polygon_info->edges,
number_edges*sizeof(EdgeInfo));
if (polygon_info->edges == (EdgeInfo *) NULL)
return((PolygonInfo *) NULL);
}
polygon_info->edges[edge].number_points=n;
polygon_info->edges[edge].scanline=(-1.0);
polygon_info->edges[edge].highwater=0;
polygon_info->edges[edge].ghostline=ghostline;
polygon_info->edges[edge].direction=direction > 0;
if (direction < 0)
ReversePoints(points,n);
polygon_info->edges[edge].points=points;
polygon_info->edges[edge].bounds=bounds;
polygon_info->edges[edge].bounds.y1=points[0].y;
polygon_info->edges[edge].bounds.y2=points[n-1].y;
number_points=16;
points=(PointInfo *) AcquireMemory(number_points*sizeof(PointInfo));
if (points == (PointInfo *) NULL)
return((PolygonInfo *) NULL);
n=1;
ghostline=False;
points[0]=point;
bounds.x1=point.x;
bounds.x2=point.x;
edge++;
}
direction=next_direction;
if (points == (PointInfo *) NULL)
continue;
if (n == number_points)
{
number_points<<=1;
ReacquireMemory((void **) &points,number_points*sizeof(PointInfo));
if (points == (PointInfo *) NULL)
return((PolygonInfo *) NULL);
}
point=path_info[i].point;
points[n]=point;
if (point.x < bounds.x1)
bounds.x1=point.x;
if (point.x > bounds.x2)
bounds.x2=point.x;
n++;
}
if (points != (PointInfo *) NULL)
{
if (n < 2)
LiberateMemory((void **) &points);
else
{
if (edge == number_edges)
{
number_edges<<=1;
ReacquireMemory((void **) &polygon_info->edges,
number_edges*sizeof(EdgeInfo));
if (polygon_info->edges == (EdgeInfo *) NULL)
return((PolygonInfo *) NULL);
}
polygon_info->edges[edge].number_points=n;
polygon_info->edges[edge].scanline=(-1.0);
polygon_info->edges[edge].highwater=0;
polygon_info->edges[edge].ghostline=ghostline;
polygon_info->edges[edge].direction=direction > 0;
if (direction < 0)
ReversePoints(points,n);
polygon_info->edges[edge].points=points;
polygon_info->edges[edge].bounds=bounds;
polygon_info->edges[edge].bounds.y1=points[0].y;
polygon_info->edges[edge].bounds.y2=points[n-1].y;
ghostline=False;
edge++;
}
}
polygon_info->number_edges=edge;
qsort(polygon_info->edges,polygon_info->number_edges,sizeof(EdgeInfo),
CompareEdges);
if (draw_info->debug)
PrintPolygonInfo(polygon_info);
return(polygon_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C o n v e r t P r i m i t i v e T o P a t h %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method ConvertPrimitiveToPath converts a PrimitiveInfo structure into a
% vector path structure.
%
% The format of the ConvertPrimitiveToPath method is:
%
% PathInfo *ConvertPrimitiveToPath(const DrawInfo *draw_info,
% const PrimitiveInfo *primitive_info)
%
% A description of each parameter follows:
%
% o Method ConvertPrimitiveToPath returns a vector path structure of type
% PathInfo.
%
% o draw_info: a structure of type DrawInfo.
%
% o primitive_info: Specifies a pointer to an PrimitiveInfo structure.
%
%
*/
static void PrintPathInfo(const PathInfo *path_info)
{
register const PathInfo
*p;
(void) fprintf(stdout," begin vector-path\n");
for (p=path_info; p->code != EndCode; p++)
(void) fprintf(stdout," %g,%g %s\n",p->point.x,p->point.y,
p->code == GhostlineCode ? "moveto ghostline" :
p->code == OpenCode ? "moveto open" : p->code == MoveToCode ? "moveto" :
p->code == LineToCode ? "lineto" : "?");
(void) fprintf(stdout," end vector-path\n");
}
static PathInfo *ConvertPrimitiveToPath(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info)
{
int
coordinates,
path_length,
start;
PathInfo
*path_info;
PathInfoCode
code;
PointInfo
p,
point,
q;
register int
i,
n;
/*
Converts a PrimitiveInfo structure into a vector path structure.
*/
switch (primitive_info->primitive)
{
case PointPrimitive:
case ColorPrimitive:
case MattePrimitive:
case TextPrimitive:
case ImagePrimitive:
return((PathInfo *) NULL);
default:
break;
}
n=0;
q.x=(-1.0);
q.y=(-1.0);
coordinates=0;
start=0;
path_length=0;
path_info=(PathInfo *) NULL;
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++)
{
point=primitive_info[i].point;
code=LineToCode;
if (coordinates <= 0)
{
coordinates=primitive_info[i].coordinates;
path_length+=2*coordinates+3;
if (path_info == (PathInfo *) NULL)
path_info=(PathInfo *) AcquireMemory(path_length*sizeof(PathInfo));
else
ReacquireMemory((void **) &path_info,path_length*sizeof(PathInfo));
if (path_info == (PathInfo *) NULL)
return((PathInfo *) NULL);
start=n;
p=point;
code=MoveToCode;
}
coordinates--;
/*
Reject duplicate points.
*/
if ((fabs(q.x-point.x) > MagickEpsilon) ||
(fabs(q.y-point.y) > MagickEpsilon))
{
path_info[n].code=code;
path_info[n].point=point;
q=point;
n++;
}
if (coordinates > 0)
continue;
if ((fabs(p.x-point.x) <= MagickEpsilon) &&
(fabs(p.y-point.y) <= MagickEpsilon))
continue;
/*
Mark the p point as open if it does not match the q.
*/
path_info[start].code=OpenCode;
path_info[n].code=GhostlineCode;
path_info[n].point=point;
n++;
path_info[n].code=LineToCode;
path_info[n].point=p;
n++;
}
path_info[n].code=EndCode;
path_info[n].point.x=0.0;
path_info[n].point.y=0.0;
if (draw_info->debug)
PrintPathInfo(path_info);
return(path_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e s t r o y D r a w I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DestroyDrawInfo deallocates memory associated with an
% DrawInfo structure.
%
% The format of the DestroyDrawInfo method is:
%
% void DestroyDrawInfo(DrawInfo *draw_info)
%
% A description of each parameter follows:
%
% o draw_info: Specifies a pointer to an DrawInfo structure.
%
%
*/
MagickExport void DestroyDrawInfo(DrawInfo *draw_info)
{
assert(draw_info != (DrawInfo *) NULL);
assert(draw_info->signature == MagickSignature);
if (draw_info->primitive != (char *) NULL)
LiberateMemory((void **) &draw_info->primitive);
if (draw_info->text != (char *) NULL)
LiberateMemory((void **) &draw_info->text);
if (draw_info->geometry != (char *) NULL)
LiberateMemory((void **) &draw_info->geometry);
if (draw_info->font != (char *) NULL)
LiberateMemory((void **) &draw_info->font);
if (draw_info->density != (char *) NULL)
LiberateMemory((void **) &draw_info->density);
if (draw_info->tile != (Image *) NULL)
DestroyImage(draw_info->tile);
if (draw_info->dash_pattern != (unsigned *) NULL)
LiberateMemory((void **) &draw_info->dash_pattern);
if (draw_info->server_name != (char *) NULL)
LiberateMemory((void **) &draw_info->server_name);
if (draw_info->clip_path.edges != (EdgeInfo *) NULL)
LiberateMemory((void **) &draw_info->clip_path.edges);
LiberateMemory((void **) &draw_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D e s t r o y E d g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DestroyEdge destroys the specified polygon edge.
%
% The format of the DestroyEdge method is:
%
% void DestroyEdge(PolygonInfo *polygon_info,const int edge)
%
% A description of each parameter follows:
%
% o polygon_info: Specifies a pointer to an PolygonInfo structure.
%
% o edge: the polygon edge number to destroy.
%
%
*/
static int DestroyEdge(PolygonInfo *polygon_info,const int edge)
{
register int
i;
if (edge >= polygon_info->number_edges)
return(polygon_info->number_edges);
LiberateMemory((void **) &polygon_info->edges[edge].points);
for (i=edge; i < polygon_info->number_edges; i++)
polygon_info->edges[i]=polygon_info->edges[i+1];
polygon_info->number_edges--;
return(polygon_info->number_edges);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D e s t r o y P o l y g o n I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DestroyPolygonInfo destroys the PolygonInfo data structure.
%
% The format of the DestroyPolygonInfo method is:
%
% void DestroyPolygonInfo(PolygonInfo *polygon_info)
%
% A description of each parameter follows:
%
% o polygon_info: Specifies a pointer to an PolygonInfo structure.
%
%
*/
static void DestroyPolygonInfo(PolygonInfo *polygon_info)
{
register int
i;
for (i=0; i < polygon_info->number_edges; i++)
LiberateMemory((void **) &polygon_info->edges[i].points);
LiberateMemory((void **) &polygon_info->edges);
LiberateMemory((void **) &polygon_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D r a w B o u n d i n g R e c t a n g l e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawBoundingRectangles draws the bounding rectangles on the image.
% This is only useful for developers debugging the rendering algorithm.
%
% The format of the DrawBoundingRectangles method is:
%
% void DrawBoundingRectangles(const DrawInfo *draw_info,
% PolygonInfo *polygon_info,Image *image)
%
% A description of each parameter follows:
%
% o draw_info: The address of a DrawInfo structure.
%
% o polygon_info: Specifies a pointer to a PolygonInfo structure.
%
% o image: The address of a structure of type Image.
%
%
*/
static void DrawBoundingRectangles(const DrawInfo *draw_info,
const PolygonInfo *polygon_info,Image *image)
{
double
mid;
DrawInfo
*clone_info;
int
coordinates;
PointInfo
end,
resolution,
start;
PrimitiveInfo
primitive_info[6];
register int
i;
SegmentInfo
bounds;
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
clone_info->debug=False;
QueryColorDatabase("none",&clone_info->fill);
resolution.x=72.0;
resolution.y=72.0;
if (clone_info->density != (char *) NULL)
{
int
count;
count=sscanf(clone_info->density,"%lfx%lf",&resolution.x,&resolution.y);
if (count != 2)
resolution.y=resolution.x;
}
mid=(resolution.x/72.0)*ExpandAffine(&clone_info->affine)*
clone_info->stroke_width/2.0;
if (polygon_info != (PolygonInfo *) NULL)
{
bounds=polygon_info->edges[0].bounds;
for (i=1; i < polygon_info->number_edges; i++)
{
if (polygon_info->edges[i].bounds.x1 < bounds.x1)
bounds.x1=polygon_info->edges[i].bounds.x1;
if (polygon_info->edges[i].bounds.y1 < bounds.y1)
bounds.y1=polygon_info->edges[i].bounds.y1;
if (polygon_info->edges[i].bounds.x2 > bounds.x2)
bounds.x2=polygon_info->edges[i].bounds.x2;
if (polygon_info->edges[i].bounds.y2 > bounds.y2)
bounds.y2=polygon_info->edges[i].bounds.y2;
}
bounds.x1-=mid;
if (bounds.x1 < 0.0)
bounds.x1=0.0;
bounds.y1-=mid;
if (bounds.y1 < 0.0)
bounds.y1=0.0;
bounds.x2+=mid;
if (bounds.x2 >= image->columns)
bounds.x2=image->columns;
bounds.y2+=mid;
if (bounds.y2 >= image->rows)
bounds.y2=image->rows;
for (i=0; i < polygon_info->number_edges; i++)
{
if (polygon_info->edges[i].direction)
QueryColorDatabase("red",&clone_info->stroke);
else
QueryColorDatabase("green",&clone_info->stroke);
start.x=floor(polygon_info->edges[i].bounds.x1-mid+0.5);
start.y=floor(polygon_info->edges[i].bounds.y1-mid+0.5);
end.x=ceil(polygon_info->edges[i].bounds.x2+mid-0.5);
end.y=ceil(polygon_info->edges[i].bounds.y2+mid-0.5);
primitive_info[0].primitive=RectanglePrimitive;
TraceRectangle(primitive_info,start,end);
primitive_info[0].method=ReplaceMethod;
coordinates=primitive_info[0].coordinates;
primitive_info[coordinates].primitive=UndefinedPrimitive;
(void) DrawPrimitive(clone_info,primitive_info,image);
}
}
QueryColorDatabase("blue",&clone_info->stroke);
start.x=floor(bounds.x1-mid+0.5);
start.y=floor(bounds.y1-mid+0.5);
end.x=ceil(bounds.x2+mid-0.5);
end.y=ceil(bounds.y2+mid-0.5);
primitive_info[0].primitive=RectanglePrimitive;
TraceRectangle(primitive_info,start,end);
primitive_info[0].method=ReplaceMethod;
coordinates=primitive_info[0].coordinates;
primitive_info[coordinates].primitive=UndefinedPrimitive;
(void) DrawPrimitive(clone_info,primitive_info,image);
DestroyDrawInfo(clone_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D r a w D a s h P o l y g o n %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawDashPolygon draws a dashed polygon (line, rectangle, ellipse)
% on the image while respecting the dash offset and dash pattern attributes.
%
% The format of the DrawDashPolygon method is:
%
% void DrawDashPolygon(const DrawInfo *draw_info,
% const PrimitiveInfo *primitive_info,Image *image)
%
% A description of each parameter follows:
%
% o draw_info: The address of a DrawInfo structure.
%
% o primitive_info: Specifies a pointer to a PrimitiveInfo structure.
%
% o image: The address of a structure of type Image.
%
%
*/
static void DrawDashPolygon(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info,Image *image)
{
double
dash_offset,
distance,
maximum_distance,
scale,
this_distance;
DrawInfo
*clone_info;
int
j,
n;
PrimitiveInfo
*dash_polygon;
register double
dx,
dy;
register int
i;
unsigned int
number_vertices;
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
clone_info->miterlimit=0;
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++);
number_vertices=i;
dash_polygon=(PrimitiveInfo *)
AcquireMemory((2*number_vertices+1)*sizeof(PrimitiveInfo));
if (dash_polygon == (PrimitiveInfo *) NULL)
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
scale=ExpandAffine(&draw_info->affine);
dash_offset=draw_info->dash_offset > 0 ? scale*draw_info->dash_offset : 0.0;
distance=0.0;
for (n=(-1); dash_offset > 0.0; )
{
if (n == -1)
n=0;
if (draw_info->dash_pattern[n] == 0)
break;
if (dash_offset > (scale*draw_info->dash_pattern[n]))
{
dash_offset-=scale*draw_info->dash_pattern[n];
n++;
continue;
}
if (dash_offset < (scale*draw_info->dash_pattern[n]))
{
distance=scale*draw_info->dash_pattern[n]-dash_offset;
dash_offset=0.0;
break;
}
dash_offset=0.0;
distance=scale*draw_info->dash_pattern[n];
n++;
}
j=0;
if (n == -1)
{
distance=scale*draw_info->dash_pattern[0];
dash_polygon[0]=primitive_info[0];
n=0;
j=1;
}
for (i=1; i < number_vertices; i++)
{
dx=primitive_info[i].point.x-primitive_info[i-1].point.x;
dy=primitive_info[i].point.y-primitive_info[i-1].point.y;
maximum_distance=sqrt(dx*dx+dy*dy+MagickEpsilon);
if (distance == 0)
{
n++;
if (draw_info->dash_pattern[n] == 0)
n=0;
distance=scale*draw_info->dash_pattern[n];
}
for (this_distance=0.0; maximum_distance >= (distance+this_distance); )
{
this_distance+=distance;
if (n & 0x01)
{
dash_polygon[0]=primitive_info[0];
dash_polygon[0].point.x=primitive_info[i-1].point.x+
dx*this_distance/maximum_distance;
dash_polygon[0].point.y=primitive_info[i-1].point.y+
dy*this_distance/maximum_distance;
j=1;
}
else
{
dash_polygon[j]=primitive_info[i-1];
dash_polygon[j].point.x=primitive_info[i-1].point.x+
dx*this_distance/maximum_distance;
dash_polygon[j].point.y=primitive_info[i-1].point.y+
dy*this_distance/maximum_distance;
dash_polygon[j].coordinates=1;
j++;
dash_polygon[0].coordinates=j;
dash_polygon[j].primitive=UndefinedPrimitive;
DrawStrokePolygon(clone_info,dash_polygon,image);
}
n++;
if (draw_info->dash_pattern[n] == 0)
n=0;
distance=scale*draw_info->dash_pattern[n];
}
distance-=(maximum_distance-this_distance);
if (n & 0x01)
continue;
dash_polygon[j]=primitive_info[i];
dash_polygon[j].coordinates=1;
j++;
}
LiberateMemory((void **) &dash_polygon);
DestroyDrawInfo(clone_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D r a w I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawImage draws a primitive (line, rectangle, ellipse) on the image.
%
% The format of the DrawImage method is:
%
% unsigned int DrawImage(Image *image,const DrawInfo *draw_info)
%
% A description of each parameter follows:
%
% o image: The address of a structure of type Image.
%
% o draw_info: The address of a DrawInfo structure.
%
%
*/
MagickExport unsigned int DrawImage(Image *image,const DrawInfo *draw_info)
{
AffineMatrix
affine,
current;
char
keyword[MaxTextExtent],
*primitive,
*q,
value[MaxTextExtent];
double
angle;
DrawInfo
**graphic_context;
int
j,
n,
number_points;
PointInfo
point;
PrimitiveInfo
*primitive_info;
PrimitiveType
primitive_type;
register char
*p;
register int
i,
x;
unsigned int
length,
status;
/*
Ensure the annotation info is valid.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
assert(draw_info != (DrawInfo *) NULL);
assert(draw_info->signature == MagickSignature);
assert(draw_info->primitive != (char *) NULL);
if (*draw_info->primitive == '\0')
return(False);
if (*draw_info->primitive != '@')
primitive=TranslateText((ImageInfo *) NULL,image,draw_info->primitive);
else
{
char
*text;
FILE
*file;
int
c;
register char
*q;
/*
Read text from a file.
*/
file=(FILE *) fopen(draw_info->primitive+1,"r");
if (file == (FILE *) NULL)
ThrowBinaryException(FileOpenWarning,"Unable to read primitive file",
draw_info->primitive+1);
length=MaxTextExtent;
text=AllocateString((char *) NULL);
q=text;
while (text != (char *) NULL)
{
c=fgetc(file);
if (c == EOF)
break;
if ((q-text+1) >= (int) length)
{
*q='\0';
length<<=1;
ReacquireMemory((void **) &text,length);
if (text == (char *) NULL)
break;
q=text+Extent(text);
}
*q++=c;
}
(void) fclose(file);
if (text == (char *) NULL)
ThrowBinaryException(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
*q='\0';
primitive=TranslateText((ImageInfo *) NULL,image,text);
LiberateMemory((void **) &text);
}
/*
Allocate primitive info memory.
*/
n=0;
graphic_context=(DrawInfo **) AcquireMemory(sizeof(DrawInfo *));
if (graphic_context == (DrawInfo **) NULL)
{
LiberateMemory((void **) &primitive);
ThrowBinaryException(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
}
graphic_context[n]=CloneDrawInfo((ImageInfo *) NULL,draw_info);
number_points=2047;
primitive_info=(PrimitiveInfo *)
AcquireMemory(number_points*sizeof(PrimitiveInfo));
if (primitive_info == (PrimitiveInfo *) NULL)
{
LiberateMemory((void **) &primitive);
for ( ; n >= 0; n--)
DestroyDrawInfo(graphic_context[n]);
LiberateMemory((void **) &graphic_context);
ThrowBinaryException(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
}
status=True;
(void) SetImageAttribute(image,"[MVG]",primitive);
if (graphic_context[n]->debug)
(void) fprintf(stdout,"begin vector-graphics\n");
for (q=primitive; *q != '\0'; )
{
while (isspace((int) (*q)) && (*q != '\0'))
q++;
if (*q == '#')
{
/*
Comment.
*/
while ((*q != '\n') && (*q != '\0'))
q++;
continue;
}
/*
Define primitive.
*/
p=q;
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
keyword[x]=(*q++);
keyword[x]='\0';
if (*keyword == '\0')
break;
while (isspace((int) (*q)) && (*q != '\0'))
q++;
primitive_type=UndefinedPrimitive;
current=graphic_context[n]->affine;
IdentityAffine(&affine);
switch (*keyword)
{
case ';':
break;
case 'a':
case 'A':
{
if (LocaleCompare("affine",keyword) == 0)
{
affine.sx=strtod(q,&q);
if (*q == ',')
q++;
affine.rx=strtod(q,&q);
if (*q == ',')
q++;
affine.ry=strtod(q,&q);
if (*q == ',')
q++;
affine.sy=strtod(q,&q);
if (*q == ',')
q++;
affine.tx=strtod(q,&q);
if (*q == ',')
q++;
affine.ty=strtod(q,&q);
break;
}
if (LocaleCompare("angle",keyword) == 0)
{
(void) strtod(q,&q);
break;
}
if (LocaleCompare("arc",keyword) == 0)
{
primitive_type=ArcPrimitive;
break;
}
status=False;
break;
}
case 'b':
case 'B':
{
if (LocaleCompare("bezier",keyword) == 0)
{
primitive_type=BezierPrimitive;
break;
}
status=False;
break;
}
case 'c':
case 'C':
{
if (LocaleCompare("clip-path",keyword) == 0)
{
if ((LocaleNCompare(q,"url(",4) == 0))
for (x=0; (*(q-1) != ')') && (*q != '\0'); x++)
value[x]=(*q++);
else
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
break;
}
if (LocaleCompare("circle",keyword) == 0)
{
primitive_type=CirclePrimitive;
break;
}
if (LocaleCompare("color",keyword) == 0)
{
primitive_type=ColorPrimitive;
break;
}
status=False;
break;
}
case 'd':
case 'D':
{
if (LocaleCompare("decorate",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("none",value) == 0)
graphic_context[n]->decorate=NoDecoration;
if (LocaleCompare("underline",value) == 0)
graphic_context[n]->decorate=UnderlineDecoration;
if (LocaleCompare("overline",value) == 0)
graphic_context[n]->decorate=OverlineDecoration;
if (LocaleCompare("line-through",value) == 0)
graphic_context[n]->decorate=LineThroughDecoration;
break;
}
status=False;
break;
}
case 'e':
case 'E':
{
if (LocaleCompare("ellipse",keyword) == 0)
{
primitive_type=EllipsePrimitive;
break;
}
status=False;
break;
}
case 'f':
case 'F':
{
if (LocaleCompare("fill",keyword) == 0)
{
if ((LocaleNCompare(q,"rgb(",4) == 0))
for (x=0; (*(q-1) != ')') && (*q != '\0'); x++)
value[x]=(*q++);
else
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
(void) QueryColorDatabase(value,&graphic_context[n]->fill);
if (graphic_context[n]->fill.opacity != TransparentOpacity)
graphic_context[n]->fill.opacity=graphic_context[n]->opacity;
break;
}
if (LocaleCompare("fill-rule",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("evenodd",value) == 0)
graphic_context[n]->fill_rule=EvenOddRule;
if (LocaleCompare("nonzero",value) == 0)
graphic_context[n]->fill_rule=NonZeroRule;
break;
}
if (LocaleCompare("fill-opacity",keyword) == 0)
{
graphic_context[n]->fill.opacity=(Quantum)
ceil(MaxRGB*strtod(q,&q)/100.0-0.5);
break;
}
if (LocaleCompare("font",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (draw_info->font != (char *) NULL)
(void) strcpy(value,draw_info->font);
CloneString(&graphic_context[n]->font,value);
break;
}
if (LocaleCompare("font-size",keyword) == 0)
{
graphic_context[n]->pointsize=strtod(q,&q);
break;
}
status=False;
break;
}
case 'g':
case 'G':
{
if (LocaleCompare("gravity",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("NorthWest",value) == 0)
graphic_context[n]->gravity=NorthWestGravity;
if (LocaleCompare("North",value) == 0)
graphic_context[n]->gravity=NorthGravity;
if (LocaleCompare("NorthEast",value) == 0)
graphic_context[n]->gravity=NorthEastGravity;
if (LocaleCompare("West",value) == 0)
graphic_context[n]->gravity=WestGravity;
if (LocaleCompare("Center",value) == 0)
graphic_context[n]->gravity=CenterGravity;
if (LocaleCompare("East",value) == 0)
graphic_context[n]->gravity=EastGravity;
if (LocaleCompare("SouthWest",value) == 0)
graphic_context[n]->gravity=SouthWestGravity;
if (LocaleCompare("South",value) == 0)
graphic_context[n]->gravity=SouthGravity;
if (LocaleCompare("SouthEast",value) == 0)
graphic_context[n]->gravity=SouthEastGravity;
break;
}
status=False;
break;
}
case 'i':
case 'I':
{
if (LocaleCompare("image",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("Over",value) == 0)
graphic_context[n]->compose=OverCompositeOp;
if (LocaleCompare("In",value) == 0)
graphic_context[n]->compose=InCompositeOp;
if (LocaleCompare("Out",value) == 0)
graphic_context[n]->compose=OutCompositeOp;
if (LocaleCompare("Atop",value) == 0)
graphic_context[n]->compose=AtopCompositeOp;
if (LocaleCompare("Xor",value) == 0)
graphic_context[n]->compose=XorCompositeOp;
if (LocaleCompare("Plus",value) == 0)
graphic_context[n]->compose=PlusCompositeOp;
if (LocaleCompare("Minus",value) == 0)
graphic_context[n]->compose=MinusCompositeOp;
if (LocaleCompare("Add",value) == 0)
graphic_context[n]->compose=AddCompositeOp;
if (LocaleCompare("Subtract",value) == 0)
graphic_context[n]->compose=SubtractCompositeOp;
if (LocaleCompare("Difference",value) == 0)
graphic_context[n]->compose=DifferenceCompositeOp;
if (LocaleCompare("Multiply",value) == 0)
graphic_context[n]->compose=MultiplyCompositeOp;
if (LocaleCompare("Bumpmap",value) == 0)
graphic_context[n]->compose=BumpmapCompositeOp;
if (LocaleCompare("Copy",value) == 0)
graphic_context[n]->compose=CopyCompositeOp;
if (LocaleCompare("CopyRed",value) == 0)
graphic_context[n]->compose=CopyRedCompositeOp;
if (LocaleCompare("CopyGreen",value) == 0)
graphic_context[n]->compose=CopyGreenCompositeOp;
if (LocaleCompare("CopyBlue",value) == 0)
graphic_context[n]->compose=CopyBlueCompositeOp;
if (LocaleCompare("CopyOpacity",value) == 0)
graphic_context[n]->compose=CopyOpacityCompositeOp;
if (LocaleCompare("Clear",value) == 0)
graphic_context[n]->compose=ClearCompositeOp;
primitive_type=ImagePrimitive;
break;
}
status=False;
break;
}
case 'l':
case 'L':
{
if (LocaleCompare("line",keyword) == 0)
{
primitive_type=LinePrimitive;
break;
}
status=False;
break;
}
case 'm':
case 'M':
{
if (LocaleCompare("matte",keyword) == 0)
{
primitive_type=MattePrimitive;
break;
}
status=False;
break;
}
case 'o':
case 'O':
{
if (LocaleCompare("opacity",keyword) == 0)
{
graphic_context[n]->opacity=(Quantum)
ceil(MaxRGB*strtod(q,&q)/100.0-0.5);
graphic_context[n]->fill.opacity=graphic_context[n]->opacity;
graphic_context[n]->stroke.opacity=graphic_context[n]->opacity;
break;
}
status=False;
break;
}
case 'p':
case 'P':
{
if (LocaleCompare("path",keyword) == 0)
{
primitive_type=PathPrimitive;
break;
}
if (LocaleCompare("point",keyword) == 0)
{
primitive_type=PointPrimitive;
break;
}
if (LocaleCompare("polyline",keyword) == 0)
{
primitive_type=PolylinePrimitive;
break;
}
if (LocaleCompare("polygon",keyword) == 0)
{
primitive_type=PolygonPrimitive;
break;
}
if (LocaleCompare("pop",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("clip-path",value) == 0)
break;
if (LocaleCompare("graphic-context",value) == 0)
{
DestroyDrawInfo(graphic_context[n]);
n--;
if (n < 0)
{
ThrowException(&image->exception,CorruptImageWarning,
"unbalanced graphic context push/pop",value);
break;
}
}
break;
}
if (LocaleCompare("push",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleNCompare("clip-path-",value,10) == 0)
{
while (isspace((int) (*q)) && (*q != '\0'))
q++;
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
break;
}
if (LocaleCompare("graphic-context",value) == 0)
{
n++;
ReacquireMemory((void **) &graphic_context,
(n+1)*sizeof(DrawInfo *));
if (graphic_context == (DrawInfo **) NULL)
{
ThrowException(&image->exception,ResourceLimitWarning,
"Unable to draw image","Memory allocation failed");
break;
}
graphic_context[n]=
CloneDrawInfo((ImageInfo *) NULL,graphic_context[n-1]);
}
break;
}
status=False;
break;
}
case 'r':
case 'R':
{
if (LocaleNCompare("rect",keyword,4) == 0)
{
primitive_type=RectanglePrimitive;
break;
}
if (LocaleCompare("roundRectangle",keyword) == 0)
{
primitive_type=RoundRectanglePrimitive;
break;
}
if (LocaleCompare("rotate",keyword) == 0)
{
angle=strtod(q,&q);
affine.sx=cos(DegreesToRadians(fmod(angle,360.0)));
affine.rx=sin(DegreesToRadians(fmod(angle,360.0)));
affine.ry=(-sin(DegreesToRadians(fmod(angle,360.0))));
affine.sy=cos(DegreesToRadians(fmod(angle,360.0)));
break;
}
status=False;
break;
}
case 's':
case 'S':
{
if (LocaleCompare("scale",keyword) == 0)
{
affine.sx=strtod(q,&q);
if (*q == ',')
q++;
affine.sy=strtod(q,&q);
break;
}
if (LocaleCompare("skewX",keyword) == 0)
{
angle=strtod(q,&q);
affine.ry=tan(DegreesToRadians(fmod(angle,360.0)));
break;
}
if (LocaleCompare("skewY",keyword) == 0)
{
angle=strtod(q,&q);
affine.rx=tan(DegreesToRadians(fmod(angle,360.0)));
break;
}
if (LocaleCompare("stroke",keyword) == 0)
{
if ((LocaleNCompare(q,"rgb(",4) == 0))
for (x=0; (*(q-1) != ')') && (*q != '\0'); x++)
value[x]=(*q++);
else
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
(void) QueryColorDatabase(value,&graphic_context[n]->stroke);
if (graphic_context[n]->stroke.opacity != TransparentOpacity)
graphic_context[n]->stroke.opacity=graphic_context[n]->opacity;
break;
}
if (LocaleCompare("stroke-antialias",keyword) == 0)
{
graphic_context[n]->stroke_antialias=(unsigned int) strtod(q,&q);
break;
}
if (LocaleCompare("stroke-dasharray",keyword) == 0)
{
if (IsGeometry(q))
{
char
*r;
r=q;
for (x=0; IsGeometry(r); x++)
(void) strtod(r,&r);
graphic_context[n]->dash_pattern=(unsigned int *)
AcquireMemory((x+1)*sizeof(unsigned int));
if (graphic_context[n]->dash_pattern == (unsigned int *) NULL)
{
ThrowException(&image->exception,ResourceLimitWarning,
"Unable to draw image","Memory allocation failed");
break;
}
for (x=0; IsGeometry(q); x++)
graphic_context[n]->dash_pattern[x]=
(unsigned int) strtod(q,&q);
graphic_context[n]->dash_pattern[x]=0;
break;
}
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare(value,"none") != 0)
break;
if (graphic_context[n]->dash_pattern != (unsigned int *) NULL)
LiberateMemory((void **) &graphic_context[n]->dash_pattern);
graphic_context[n]->dash_pattern=(unsigned int *) NULL;
break;
}
if (LocaleCompare("stroke-dashoffset",keyword) == 0)
{
graphic_context[n]->dash_offset=(unsigned int) strtod(q,&q);
break;
}
if (LocaleCompare("stroke-linecap",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("butt",value) == 0)
graphic_context[n]->linecap=ButtCap;
if (LocaleCompare("round",value) == 0)
graphic_context[n]->linecap=RoundCap;
if (LocaleCompare("square",value) == 0)
graphic_context[n]->linecap=SquareCap;
break;
}
if (LocaleCompare("stroke-linejoin",keyword) == 0)
{
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
value[x]=(*q++);
value[x]='\0';
if (LocaleCompare("butt",value) == 0)
graphic_context[n]->linejoin=MiterJoin;
if (LocaleCompare("round",value) == 0)
graphic_context[n]->linejoin=RoundJoin;
if (LocaleCompare("square",value) == 0)
graphic_context[n]->linejoin=BevelJoin;
break;
}
if (LocaleCompare("stroke-miterlimit",keyword) == 0)
{
graphic_context[n]->miterlimit=(unsigned int) strtod(q,&q);
break;
}
if (LocaleCompare("stroke-opacity",keyword) == 0)
{
graphic_context[n]->stroke.opacity=(Quantum)
ceil(MaxRGB*strtod(q,&q)/100.0-0.5);
break;
}
if (LocaleCompare("stroke-width",keyword) == 0)
{
graphic_context[n]->stroke_width=strtod(q,&q);
continue;
}
status=False;
break;
}
case 't':
case 'T':
{
if (LocaleCompare("text",keyword) == 0)
{
primitive_type=TextPrimitive;
break;
}
if (LocaleCompare("text-antialias",keyword) == 0)
{
graphic_context[n]->text_antialias=(unsigned int) strtod(q,&q);
break;
}
if (LocaleCompare("translate",keyword) == 0)
{
affine.tx=strtod(q,&q);
if (*q == ',')
q++;
affine.ty=strtod(q,&q);
break;
}
status=False;
break;
}
case 'v':
case 'V':
{
if (LocaleCompare("viewbox",keyword) == 0)
{
(void) strtod(q,&q);
if (*q == ',')
q++;
(void) strtod(q,&q);
if (*q == ',')
q++;
(void) strtod(q,&q);
if (*q == ',')
q++;
(void) strtod(q,&q);
break;
}
status=False;
break;
}
default:
{
status=False;
break;
}
}
if (status == False)
break;
if ((affine.sx != 1.0) || (affine.rx != 0.0) || (affine.ry != 0.0) ||
(affine.sy != 1.0) || (affine.tx != 0.0) || (affine.ty != 0.0))
{
graphic_context[n]->affine.sx=current.sx*affine.sx+current.ry*affine.rx;
graphic_context[n]->affine.rx=current.rx*affine.sx+current.sy*affine.rx;
graphic_context[n]->affine.ry=current.sx*affine.ry+current.ry*affine.sy;
graphic_context[n]->affine.sy=current.rx*affine.ry+current.sy*affine.sy;
graphic_context[n]->affine.tx=
current.sx*affine.tx+current.ry*affine.ty+current.tx;
graphic_context[n]->affine.ty=
current.rx*affine.tx+current.sy*affine.ty+current.ty;
}
if (primitive_type == UndefinedPrimitive)
{
if (graphic_context[n]->debug)
(void) fprintf(stdout," %.*s\n",q-p,p);
continue;
}
/*
Parse the primitive attributes.
*/
i=0;
j=0;
for (x=0; *q != '\0'; x++)
{
/*
Define points.
*/
while (isspace((int) (*q)) && (*q != '\0'))
q++;
if (!IsGeometry(q))
break;
point.x=strtod(q,&q);
if (*q == ',')
q++;
point.y=strtod(q,&q);
if (*q == ',')
q++;
primitive_info[i].primitive=primitive_type;
primitive_info[i].point=point;
primitive_info[i].coordinates=0;
primitive_info[i].method=FloodfillMethod;
while ((isspace((int) (*q)) || (*q == ',')) && (*q != '\0'))
q++;
i++;
if (i < (int) (number_points-6*BezierQuantum-360))
continue;
number_points+=6*BezierQuantum+360;
ReacquireMemory((void **) &primitive_info,
number_points*sizeof(PrimitiveInfo));
if (primitive_info == (PrimitiveInfo *) NULL)
{
ThrowException(&image->exception,ResourceLimitWarning,
"Unable to draw image","Memory allocation failed");
break;
}
}
while (isspace((int) (*q)) && (*q != '\0'))
q++;
primitive_info[j].primitive=primitive_type;
primitive_info[j].coordinates=x;
primitive_info[j].method=FloodfillMethod;
primitive_info[j].text=(char *) NULL;
switch (primitive_type)
{
case PointPrimitive:
default:
{
if (primitive_info[j].coordinates != 1)
{
status=False;
break;
}
TracePoint(primitive_info+j,primitive_info[j].point);
i=j+primitive_info[j].coordinates;
break;
}
case LinePrimitive:
{
if (primitive_info[j].coordinates != 2)
{
status=False;
break;
}
TraceLine(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point);
i=j+primitive_info[j].coordinates;
break;
}
case RectanglePrimitive:
{
if (primitive_info[j].coordinates != 2)
{
status=False;
break;
}
TraceRectangle(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point);
i=j+primitive_info[j].coordinates;
break;
}
case RoundRectanglePrimitive:
{
if (primitive_info[j].coordinates != 3)
{
status=False;
break;
}
TraceRoundRectangle(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point,primitive_info[j+2].point);
i=j+primitive_info[j].coordinates;
break;
}
case ArcPrimitive:
{
if (primitive_info[j].coordinates != 3)
{
status=False;
break;
}
TraceArc(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point,primitive_info[j+2].point,0,True,False);
i=j+primitive_info[j].coordinates;
break;
}
case EllipsePrimitive:
{
if (primitive_info[j].coordinates != 3)
{
status=False;
break;
}
TraceEllipse(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point,primitive_info[j+2].point);
i=j+primitive_info[j].coordinates;
break;
}
case CirclePrimitive:
{
if (primitive_info[j].coordinates != 2)
{
status=False;
break;
}
TraceCircle(primitive_info+j,primitive_info[j].point,
primitive_info[j+1].point);
i=j+primitive_info[j].coordinates;
break;
}
case PolylinePrimitive:
{
if (primitive_info[j].coordinates < 2)
{
status=False;
break;
}
break;
}
case PolygonPrimitive:
{
if (primitive_info[j].coordinates < 3)
{
status=False;
break;
}
primitive_info[i]=primitive_info[j];
primitive_info[i].coordinates=0;
primitive_info[j].coordinates++;
i++;
break;
}
case BezierPrimitive:
{
if (primitive_info[j].coordinates < 3)
{
status=False;
break;
}
TraceBezier(primitive_info+j,primitive_info[j].coordinates);
i=j+primitive_info[j].coordinates;
break;
}
case PathPrimitive:
{
char
*path;
int
number_attributes;
if (*q == '\0')
break;
number_attributes=1;
p=q;
if (*q == '"')
{
p++;
for (q++; *q != '\0'; q++)
{
if (isalpha((int) *q))
number_attributes++;
if ((*q == '"') && (*(q-1) != '\\'))
break;
}
}
else
if (*q == '\'')
{
p++;
for (q++; *q != '\0'; q++)
{
if (isalpha((int) *q))
number_attributes++;
if ((*q == '\'') && (*(q-1) != '\\'))
break;
}
}
else
for (q++; *q != '\0'; q++)
{
if (isalpha((int) *q))
number_attributes++;
if (isspace((int) *q) && (*(q-1) != '\\') && (*q != '\0'))
break;
}
path=(char *) AcquireMemory(q-p+1);
if (i > (number_points-6*BezierQuantum*number_attributes-1))
{
number_points+=6*BezierQuantum*number_attributes;
ReacquireMemory((void **) &primitive_info,
number_points*sizeof(PrimitiveInfo));
}
if ((path == (char *) NULL) ||
(primitive_info == (PrimitiveInfo *) NULL))
{
ThrowException(&image->exception,ResourceLimitWarning,
"Unable to draw image","Memory allocation failed");
break;
}
(void) strncpy(path,p,q-p+1);
path[q-p]='\0';
i=j+TracePath(primitive_info+j,path);
LiberateMemory((void **) &path);
break;
}
case ColorPrimitive:
case MattePrimitive:
{
if (primitive_info[j].coordinates != 1)
{
status=False;
break;
}
/*
Define method.
*/
for (x=0; !isspace((int) (*q)) && (*q != '\0'); x++)
keyword[x]=(*q++);
keyword[x]='\0';
if (*keyword == '\0')
break;
if (LocaleCompare("point",keyword) == 0)
primitive_info[j].method=PointMethod;
else
if (LocaleCompare("replace",keyword) == 0)
primitive_info[j].method=ReplaceMethod;
else
if (LocaleCompare("floodfill",keyword) == 0)
primitive_info[j].method=FloodfillMethod;
else
if (LocaleCompare("filltoborder",keyword) == 0)
primitive_info[j].method=FillToBorderMethod;
else
if (LocaleCompare("reset",keyword) == 0)
primitive_info[j].method=ResetMethod;
else
status=False;
break;
}
case TextPrimitive:
{
register char
*p;
if (primitive_info[j].coordinates != 1)
{
status=False;
break;
}
if (*q == '\0')
break;
p=q;
if (*q == '"')
{
p++;
for (q++; *q != '\0'; q++)
if ((*q == '"') && (*(q-1) != '\\'))
break;
}
else
if (*q == '\'')
{
p++;
for (q++; *q != '\0'; q++)
if ((*q == '\'') && (*(q-1) != '\\'))
break;
}
else
for (q++; *q != '\0'; q++)
if (isspace((int) *q) && (*(q-1) != '\\') && (*q != '\0'))
break;
primitive_info[j].text=(char *) AcquireMemory(q-p+1);
if (primitive_info[j].text != (char *) NULL)
{
(void) strncpy(primitive_info[j].text,p,q-p+1);
primitive_info[j].text[q-p]='\0';
}
break;
}
case ImagePrimitive:
{
register char
*p;
if (primitive_info[j].coordinates != 2)
{
status=False;
break;
}
if (*q == '\0')
break;
p=q;
if (*p == '"')
{
p++;
for (q++; *q != '\0'; q++)
if ((*q == '"') && (*(q-1) != '\\'))
break;
}
else
if (*p == '\'')
{
p++;
for (q++; *q != '\0'; q++)
if ((*q == '\'') && (*(q-1) != '\\'))
break;
}
else
for (q++; *q != '\0'; q++)
if (isspace((int) *q) && (*(q-1) != '\\') && (*q != '\0'))
break;
primitive_info[j].text=(char *) AcquireMemory(q-p+1);
if (primitive_info[j].text != (char *) NULL)
{
(void) strncpy(primitive_info[j].text,p,q-p);
primitive_info[j].text[q-p]='\0';
}
break;
}
}
if (primitive_info == (PrimitiveInfo *) NULL)
break;
if (graphic_context[n]->debug)
(void) fprintf(stdout," %.*s\n",q-p,p);
if (status == False)
break;
if ((*q == '"') || (*q == '\''))
q++;
while (isspace((int) (*q)) && (*q != '\0'))
q++;
primitive_info[i].primitive=UndefinedPrimitive;
/*
Transform points.
*/
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++)
{
point=primitive_info[i].point;
primitive_info[i].point.x=graphic_context[n]->affine.sx*point.x+
graphic_context[n]->affine.ry*point.y+graphic_context[n]->affine.tx;
primitive_info[i].point.y=graphic_context[n]->affine.rx*point.x+
graphic_context[n]->affine.sy*point.y+graphic_context[n]->affine.ty;
}
status=DrawPrimitive(graphic_context[n],primitive_info,image);
if (primitive_info->text != (char *) NULL)
LiberateMemory((void **) &primitive_info->text);
if (status == False)
break;
}
if (graphic_context[n]->debug)
(void) fprintf(stdout,"end vector-graphics\n");
/*
Free resources.
*/
if (primitive_info != (PrimitiveInfo *) NULL)
LiberateMemory((void **) &primitive_info);
LiberateMemory((void **) &primitive);
for ( ; n >= 0; n--)
DestroyDrawInfo(graphic_context[n]);
LiberateMemory((void **) &graphic_context);
if (status == False)
ThrowBinaryException(OptionWarning,
"Non-conforming drawing primitive definition",keyword);
image->storage_class=DirectClass;
(void) IsOpaqueImage(image);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D r a w P o l y g o n P r i m i t i v e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawPolygonPrimitive draws a polygon on the image.
%
% The format of the DrawPolygonPrimitive method is:
%
% DrawPolygonPrimitive(const DrawInfo *draw_info,
% const PrimitiveInfo *primitive_info,PolygonInfo *polygon_info,
% Image *image)
%
% A description of each parameter follows:
%
% o draw_info: Specifies a pointer to a DrawInfo structure.
%
% o primitive_info: Specifies a pointer to a PrimitiveInfo structure.
%
% o polygon_info: Specifies a pointer to a PolygonInfo structure.
%
% o image: The address of a structure of type Image.
%
%
*/
static double DistanceToEdge(const PointInfo *p,const double x,
const double y)
{
double
alpha,
beta,
dot_product,
dx,
dy;
/*
Determine distance between a point and an edge.
*/
dx=(p+1)->x-p->x,
dy=(p+1)->y-p->y;
dot_product=dx*(x-p->x)+dy*(y-p->y);
if (dot_product < 0.0)
{
dx=x-p->x;
dy=y-p->y;
return(dx*dx+dy*dy);
}
alpha=dx*dx+dy*dy;
if (dot_product > alpha)
{
dx=x-(p+1)->x;
dy=y-(p+1)->y;
return(dx*dx+dy*dy);
}
beta=dx*(y-p->y)-dy*(x-p->x);
return(beta*beta/alpha+MagickEpsilon);
}
static int GetWindingNumber(const PolygonInfo *polygon_info,
const double x,const double y)
{
double
dx,
dy;
int
j,
winding_number;
register int
i;
register PointInfo
*p;
winding_number=0;
for (i=0; i < polygon_info->number_edges; i++)
{
if (polygon_info->edges[i].bounds.y1 > y)
break;
if (polygon_info->edges[i].bounds.y2 <= y)
continue;
if (polygon_info->edges[i].bounds.x2 < x)
{
winding_number+=polygon_info->edges[i].direction ? 1 : -1;
continue;
}
if (polygon_info->edges[i].bounds.x1 > x)
continue;
j=polygon_info->edges[i].highwater > 0 ?
polygon_info->edges[i].highwater: 1;
for ( ; j < polygon_info->edges[i].number_points; j++)
if (polygon_info->edges[i].points[j].y > y)
break;
p=polygon_info->edges[i].points+j-1;
dx=(p+1)->x-p->x;
dy=(p+1)->y-p->y;
if ((dy*(x-p->x)) > (dx*(y-p->y)))
winding_number+=polygon_info->edges[i].direction ? 1 : -1;
}
return(winding_number);
}
static void DrawPolygonPrimitive(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info,PolygonInfo *polygon_info,Image *image)
{
double
alpha,
beta,
distance,
fill_opacity,
mid,
stroke_opacity,
subpath_opacity;
int
fill,
j,
winding_number,
y;
PixelPacket
fill_color,
stroke_color;
register EdgeInfo
*p;
register int
i,
x;
register PixelPacket
*q;
SegmentInfo
bounds;
/*
Compute bounding box.
*/
assert(primitive_info != (PrimitiveInfo *) NULL);
assert(draw_info != (DrawInfo *) NULL);
assert(draw_info->signature == MagickSignature);
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
fill=(primitive_info->method == FillToBorderMethod) ||
(primitive_info->method == FloodfillMethod);
fill_color=draw_info->fill;
mid=ExpandAffine(&draw_info->affine)*draw_info->stroke_width/2.0;
stroke_color=draw_info->stroke;
bounds=polygon_info->edges[0].bounds;
for (i=1; i < polygon_info->number_edges; i++)
{
p=polygon_info->edges+i;
if (p->bounds.x1 < bounds.x1)
bounds.x1=p->bounds.x1;
if (p->bounds.y1 < bounds.y1)
bounds.y1=p->bounds.y1;
if (p->bounds.x2 > bounds.x2)
bounds.x2=p->bounds.x2;
if (p->bounds.y2 > bounds.y2)
bounds.y2=p->bounds.y2;
}
bounds.x1-=(mid+1.0);
if (bounds.x1 < 0.0)
bounds.x1=0.0;
bounds.y1-=(mid+1.0);
if (bounds.y1 < 0.0)
bounds.y1=0.0;
bounds.x2+=(mid+1.0);
if (bounds.x2 >= image->columns)
bounds.x2=image->columns-1.0;
bounds.y2+=(mid+1.0);
if (bounds.y2 >= image->rows)
bounds.y2=image->rows-1.0;
for (y=(int) ceil(bounds.y1-0.5); y <= (int) floor(bounds.y2+0.5); y++)
{
x=(int) ceil(bounds.x1-0.5);
q=GetImagePixels(image,x,y,(int) floor(bounds.x2+0.5)-x,1);
if (q == (PixelPacket *) NULL)
break;
switch (primitive_info->coordinates)
{
case 0:
break;
case 1:
{
/*
Point.
*/
for ( ; x <= (int) floor(bounds.x2+0.5); x++)
{
if ((x == (int) ceil(primitive_info->point.x-0.5)) &&
(y == (int) ceil(primitive_info->point.y-0.5)))
*q=stroke_color;
q++;
}
}
default:
{
/*
Polygon or line.
*/
for ( ; x <= (int) floor(bounds.x2+0.5); x++)
{
fill_opacity=0.0;
stroke_opacity=0.0;
subpath_opacity=0.0;
for (i=0; i < polygon_info->number_edges; i++)
{
p=polygon_info->edges+i;
if (y < (p->bounds.y1-mid-0.5))
break;
if (y >= (p->bounds.y2+mid+0.5))
{
(void) DestroyEdge(polygon_info,i);
continue;
}
if ((x < (p->bounds.x1-mid-0.5)) || (x >= (p->bounds.x2+mid+0.5)))
continue;
for (j=Max(p->highwater,1) ; j < p->number_points; j++)
{
if (y < (p->points[j-1].y-mid-0.5))
break;
if (y >= (p->points[j].y+mid+0.5))
continue;
if (p->scanline != y)
{
p->scanline=y;
p->highwater=j;
}
distance=DistanceToEdge(p->points+j-1,x,y);
beta=0.0;
if (!p->ghostline)
{
alpha=mid+0.5;
if ((stroke_opacity < 1.0) && (distance <= (alpha*alpha)))
{
alpha=mid-0.5;
if (distance <= (alpha*alpha))
stroke_opacity=1.0;
else
{
beta=sqrt(distance);
alpha=beta-mid-0.5;
stroke_opacity=Max(stroke_opacity,alpha*alpha);
}
}
}
if (!fill || (distance > 1.0) || (subpath_opacity >= 1.0))
continue;
if (distance <= 0.0)
{
subpath_opacity=1.0;
continue;
}
if (distance > 1.0)
continue;
alpha=(beta == 0.0 ? sqrt(distance) : beta)-1.0;
subpath_opacity=Max(subpath_opacity,alpha*alpha);
}
}
if (fill)
{
if (subpath_opacity > 0.0)
fill_opacity=subpath_opacity;
winding_number=GetWindingNumber(polygon_info,x,y);
if (draw_info->fill_rule != NonZeroRule)
{
if (AbsoluteValue(winding_number) & 0x01)
fill_opacity=1.0;
}
else
if (AbsoluteValue(winding_number) > 0)
fill_opacity=1.0;
}
/*
Fill.
*/
if (draw_info->tile != (Image *) NULL)
fill_color=GetOnePixel(draw_info->tile,x %
draw_info->tile->columns,y % draw_info->tile->rows);
if (!draw_info->stroke_antialias)
{
fill_opacity=fill_opacity >= 0.25-MagickEpsilon ? 1.0 : 0.0;
stroke_opacity=stroke_opacity >= 0.25-MagickEpsilon ? 1.0 : 0.0;
}
fill_opacity=MaxRGB-fill_opacity*(MaxRGB-fill_color.opacity);
stroke_opacity=MaxRGB-stroke_opacity*(MaxRGB-stroke_color.opacity);
if (stroke_opacity != OpaqueOpacity)
switch ((int) fill_opacity)
{
case TransparentOpacity:
break;
case OpaqueOpacity:
{
*q=fill_color;
break;
}
default:
{
AlphaComposite(&fill_color,fill_opacity,q,q->opacity);
break;
}
}
/*
Stroke.
*/
switch ((int) stroke_opacity)
{
case TransparentOpacity:
break;
case OpaqueOpacity:
{
*q=stroke_color;
break;
}
default:
{
AlphaComposite(&stroke_color,stroke_opacity,q,q->opacity);
break;
}
}
q++;
}
break;
}
}
if (!SyncImagePixels(image))
break;
}
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D r a w P r i m i t i v e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawPrimitive draws a primitive (line, rectangle, ellipse) on the
% image.
%
% The format of the DrawPrimitive method is:
%
% void DrawPrimitive(const DrawInfo *draw_info,
% PrimitiveInfo *primitive_info,Image *image)
%
% A description of each parameter follows:
%
% o draw_info: The address of a DrawInfo structure.
%
% o primitive_info: Specifies a pointer to a PrimitiveInfo structure.
%
% o image: The address of a structure of type Image.
%
%
*/
static void PrintPrimitiveInfo(const PrimitiveInfo *primitive_info)
{
char
*methods[] =
{
(char *) "point",
(char *) "replace",
(char *) "floodfill",
(char *) "filltoborder",
(char *) "reset",
(char *) "?"
};
int
coordinates,
y;
PointInfo
p,
q,
point;
register int
i,
x;
x=(int) ceil(primitive_info->point.x-0.5);
y=(int) ceil(primitive_info->point.y-0.5);
switch (primitive_info->primitive)
{
case PointPrimitive:
{
(void) fprintf(stdout,"PointPrimitive %d,%d %s\n",x,y,
methods[primitive_info->method]);
return;
}
case ColorPrimitive:
{
(void) fprintf(stdout,"ColorPrimitive %d,%d %s\n",x,y,
methods[primitive_info->method]);
return;
}
case MattePrimitive:
{
(void) fprintf(stdout,"MattePrimitive %d,%d %s\n",x,y,
methods[primitive_info->method]);
return;
}
case TextPrimitive:
{
(void) fprintf(stdout,"TextPrimitive %d,%d\n",x,y);
return;
}
case ImagePrimitive:
{
(void) fprintf(stdout,"ImagePrimitive %d,%d\n",x,y);
return;
}
default:
break;
}
coordinates=0;
q.x=(-1.0);
q.y=(-1.0);
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++)
{
point=primitive_info[i].point;
if (coordinates <= 0)
{
coordinates=primitive_info[i].coordinates;
(void) fprintf(stdout," begin open (%d)\n",coordinates);
p=point;
}
point=primitive_info[i].point;
if ((fabs(q.x-point.x) > MagickEpsilon) ||
(fabs(q.y-point.y) > MagickEpsilon))
(void) fprintf(stdout," %d: %g,%g\n",coordinates,point.x,point.y);
else
(void) fprintf(stdout," %d: %g,%g (duplicate)\n",coordinates,point.x,
point.y);
q=point;
coordinates--;
if (coordinates > 0)
continue;
if ((fabs(p.x-point.x) > MagickEpsilon) ||
(fabs(p.y-point.y) > MagickEpsilon))
(void) fprintf(stdout," end q (%d)\n",coordinates);
else
(void) fprintf(stdout," end open (%d)\n",coordinates);
}
}
static unsigned int DrawPrimitive(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info,Image *image)
{
int
y;
register int
i,
x;
register PixelPacket
*q;
unsigned int
status;
status=True;
x=(int) ceil(primitive_info->point.x-0.5);
y=(int) ceil(primitive_info->point.y-0.5);
switch (primitive_info->primitive)
{
case PointPrimitive:
{
q=GetImagePixels(image,x,y,1,1);
if (q == (PixelPacket *) NULL)
break;
*q=draw_info->fill;
(void) SyncImagePixels(image);
}
case ColorPrimitive:
{
switch (primitive_info->method)
{
case PointMethod:
default:
{
q=GetImagePixels(image,x,y,1,1);
if (q == (PixelPacket *) NULL)
break;
*q=draw_info->fill;
(void) SyncImagePixels(image);
break;
}
case ReplaceMethod:
{
PixelPacket
color,
target;
color=draw_info->fill;
target=GetOnePixel(image,x,y);
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
for (x=0; x < (int) image->columns; x++)
{
if (!ColorMatch(*q,target,image->fuzz))
{
q++;
continue;
}
if (draw_info->tile != (Image *) NULL)
{
color=GetOnePixel(draw_info->tile,
x % draw_info->tile->columns,y % draw_info->tile->rows);
if (!draw_info->tile->matte)
color.opacity=OpaqueOpacity;
}
switch (color.opacity)
{
case TransparentOpacity:
break;
case OpaqueOpacity:
{
*q=color;
break;
}
default:
{
AlphaComposite(&color,color.opacity,q,q->opacity);
break;
}
}
q++;
}
if (!SyncImagePixels(image))
break;
}
break;
}
case FloodfillMethod:
case FillToBorderMethod:
{
PixelPacket
border_color,
target;
target=GetOnePixel(image,x,y);
if (primitive_info->method == FillToBorderMethod)
{
border_color=draw_info->border_color;
target=border_color;
}
(void) ColorFloodfillImage(image,draw_info,target,x,y,
primitive_info->method);
break;
}
case ResetMethod:
{
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
for (x=0; x < (int) image->columns; x++)
{
*q=draw_info->fill;
q++;
}
if (!SyncImagePixels(image))
break;
}
break;
}
}
break;
}
case MattePrimitive:
{
if (!image->matte)
SetImageOpacity(image,OpaqueOpacity);
switch (primitive_info->method)
{
case PointMethod:
default:
{
q=GetImagePixels(image,x,y,1,1);
if (q == (PixelPacket *) NULL)
break;
q->opacity=TransparentOpacity;
(void) SyncImagePixels(image);
break;
}
case ReplaceMethod:
{
PixelPacket
target;
target=GetOnePixel(image,x,y);
(void) TransparentImage(image,target,TransparentOpacity);
break;
}
case FloodfillMethod:
case FillToBorderMethod:
{
PixelPacket
border_color,
target;
target=GetOnePixel(image,x,y);
if (primitive_info->method == FillToBorderMethod)
{
border_color=draw_info->border_color;
target=border_color;
}
(void) MatteFloodfillImage(image,target,TransparentOpacity,x,y,
primitive_info->method);
break;
}
case ResetMethod:
{
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
for (x=0; x < (int) image->columns; x++)
{
q->opacity=draw_info->fill.opacity;
q++;
}
if (!SyncImagePixels(image))
break;
}
break;
}
}
break;
}
case TextPrimitive:
{
char
geometry[MaxTextExtent];
DrawInfo
*clone_info;
if (primitive_info->text == (char *) NULL)
break;
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
CloneString(&clone_info->text,primitive_info->text);
FormatString(geometry,"%+g%+g",primitive_info->point.x,
primitive_info->point.y);
CloneString(&clone_info->geometry,geometry);
status=AnnotateImage(image,clone_info);
DestroyDrawInfo(clone_info);
break;
}
case ImagePrimitive:
{
ExceptionInfo
exception;
Image
*composite_image;
ImageInfo
*clone_info;
unsigned int
matte;
if (primitive_info->text == (char *) NULL)
break;
clone_info=CloneImageInfo((ImageInfo *) NULL);
(void) strcpy(clone_info->filename,primitive_info->text);
composite_image=ReadImage(clone_info,&exception);
if (exception.severity != UndefinedException)
MagickWarning(exception.severity,exception.reason,
exception.description);
DestroyImageInfo(clone_info);
if (composite_image == (Image *) NULL)
break;
if (draw_info->opacity != OpaqueOpacity)
SetImageOpacity(composite_image,draw_info->opacity);
if ((primitive_info[1].point.x != 0) && (primitive_info[1].point.y != 0))
{
char
geometry[MaxTextExtent];
/*
Resize image.
*/
FormatString(geometry,"%gx%g",primitive_info[1].point.x,
primitive_info[1].point.y);
TransformImage(&composite_image,(char *) NULL,geometry);
}
if ((draw_info->affine.rx != 0.0) || (draw_info->affine.ry != 0.0))
{
if (((draw_info->affine.sx-draw_info->affine.sy) == 0.0) &&
((draw_info->affine.rx+draw_info->affine.ry) == 0.0))
{
double
theta;
Image
*rotate_image;
theta=(180.0/MagickPI)*
atan2(draw_info->affine.rx,draw_info->affine.sx);
rotate_image=RotateImage(composite_image,theta,&image->exception);
if (rotate_image != (Image *) NULL)
{
DestroyImage(composite_image);
composite_image=rotate_image;
}
}
}
matte=image->matte;
CompositeImage(image,composite_image->matte ? OverCompositeOp :
draw_info->compose,composite_image,x,y);
DestroyImage(composite_image);
image->matte=matte;
break;
}
default:
{
double
mid,
scale;
DrawInfo
*clone_info;
PathInfo
*path_info;
PolygonInfo
*polygon_info;
if (draw_info->debug)
PrintPrimitiveInfo(primitive_info);
path_info=ConvertPrimitiveToPath(draw_info,primitive_info);
if (path_info == (PathInfo *) NULL)
return(False);
polygon_info=ConvertPathToPolygon(draw_info,path_info);
LiberateMemory((void **) &path_info);
if (polygon_info == (PolygonInfo *) NULL)
return(False);
if (draw_info->debug)
DrawBoundingRectangles(draw_info,polygon_info,image);
scale=ExpandAffine(&draw_info->affine);
if ((draw_info->dash_pattern != (unsigned *) NULL) &&
(scale*draw_info->stroke_width > MagickEpsilon) &&
(draw_info->stroke.opacity != TransparentOpacity))
{
/*
Draw dash polygon.
*/
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
clone_info->stroke_width=0.0;
clone_info->stroke.opacity=TransparentOpacity;
DrawPolygonPrimitive(clone_info,primitive_info,polygon_info,image);
DestroyDrawInfo(clone_info);
DestroyPolygonInfo(polygon_info);
DrawDashPolygon(draw_info,primitive_info,image);
break;
}
mid=ExpandAffine(&draw_info->affine)*draw_info->stroke_width/2.0;
if ((mid > 1.0) && (draw_info->stroke.opacity != TransparentOpacity))
{
unsigned int
closed_path;
/*
Draw strokes while respecting line cap/join attributes.
*/
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++);
closed_path=
(primitive_info[i-1].point.x == primitive_info[0].point.x) &&
(primitive_info[i-1].point.y == primitive_info[0].point.y);
i=primitive_info[0].coordinates;
if ((((draw_info->linecap == RoundCap) || closed_path) &&
(draw_info->linejoin == RoundJoin)) ||
(primitive_info[i].primitive != UndefinedPrimitive))
{
DrawPolygonPrimitive(draw_info,primitive_info,polygon_info,image);
DestroyPolygonInfo(polygon_info);
break;
}
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
clone_info->stroke_width=0.0;
clone_info->stroke.opacity=TransparentOpacity;
DrawPolygonPrimitive(clone_info,primitive_info,polygon_info,image);
DestroyDrawInfo(clone_info);
DestroyPolygonInfo(polygon_info);
DrawStrokePolygon(draw_info,primitive_info,image);
break;
}
DrawPolygonPrimitive(draw_info,primitive_info,polygon_info,image);
DestroyPolygonInfo(polygon_info);
break;
}
}
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D r a w S t r o k e P o l y g o n %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method DrawStrokePolygon draws a stroked polygon (line, rectangle, ellipse)
% on the image while respecting the line cap and join attributes.
%
% The format of the DrawStrokePolygon method is:
%
% void DrawStrokePolygon(const DrawInfo *draw_info,
% const PrimitiveInfo *primitive_info,Image *image)
%
% A description of each parameter follows:
%
% o draw_info: The address of a DrawInfo structure.
%
% o primitive_info: Specifies a pointer to a PrimitiveInfo structure.
%
% o image: The address of a structure of type Image.
%
%
*/
static void DrawRoundLinecap(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info,Image *image)
{
PathInfo
*path_info;
PolygonInfo
*polygon_info;
PrimitiveInfo
linecap[5];
register int
i;
for (i=0; i < 4; i++)
linecap[i]=(*primitive_info);
linecap[0].coordinates=4;
linecap[1].point.x+=10.0*MagickEpsilon;
linecap[2].point.x+=10.0*MagickEpsilon;
linecap[2].point.y+=10.0*MagickEpsilon;
linecap[3].point.y+=10.0*MagickEpsilon;
linecap[4].primitive=UndefinedPrimitive;
path_info=ConvertPrimitiveToPath(draw_info,linecap);
if (path_info == (PathInfo *) NULL)
return;
polygon_info=ConvertPathToPolygon(draw_info,path_info);
LiberateMemory((void **) &path_info);
if (polygon_info == (PolygonInfo *) NULL)
return;
DrawPolygonPrimitive(draw_info,linecap,polygon_info,image);
DestroyPolygonInfo(polygon_info);
}
static void DrawStrokePolygon(const DrawInfo *draw_info,
const PrimitiveInfo *primitive_info,Image *image)
{
typedef struct _LineSegment
{
double
p,
q;
} LineSegment;
double
delta_theta,
dot_product,
mid,
miterlimit;
DrawInfo
*clone_info;
int
arc_segments,
closed_path,
j,
l,
max_strokes,
n,
r;
LineSegment
dx,
dy,
inverse_slope,
slope,
theta;
PathInfo
*path_info;
PointInfo
center,
left_points[5],
*left_strokes,
offset,
right_points[5],
*right_strokes;
PolygonInfo
*polygon_info;
PrimitiveInfo
*stroke_polygon,
*polygon_primitive;
register int
i;
unsigned int
number_vertices;
/*
Clone the polygon primitive.
*/
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++);
closed_path=(primitive_info[i-1].point.x == primitive_info[0].point.x) &&
(primitive_info[i-1].point.y == primitive_info[0].point.y);
number_vertices=i;
polygon_primitive=(PrimitiveInfo *)
AcquireMemory((number_vertices+1)*sizeof(PrimitiveInfo));
if (polygon_primitive == (PrimitiveInfo *) NULL)
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
memcpy(polygon_primitive,primitive_info,number_vertices*
sizeof(PrimitiveInfo));
/*
Compute the slope for the first line segment, p.
*/
if ((draw_info->linejoin != RoundJoin) &&
((draw_info->linejoin != MiterJoin) || !closed_path))
polygon_primitive[number_vertices].primitive=UndefinedPrimitive;
else
{
polygon_primitive[number_vertices]=primitive_info[1];
number_vertices++;
}
for (n=1; n < number_vertices; n++)
{
dx.p=polygon_primitive[n].point.x-polygon_primitive[0].point.x;
dy.p=polygon_primitive[n].point.y-polygon_primitive[0].point.y;
if ((fabs(dx.p) >= MagickEpsilon) || (fabs(dy.p) >= MagickEpsilon))
break;
}
slope.p=0.0;
inverse_slope.p=0.0;
if (fabs(dx.p) <= MagickEpsilon)
{
if (dx.p >= 0.0)
slope.p=dy.p < 0.0 ? -1.0/MagickEpsilon : 1.0/MagickEpsilon;
else
slope.p=dy.p < 0.0 ? 1.0/MagickEpsilon : -1.0/MagickEpsilon;
}
else
if (fabs(dy.p) <= MagickEpsilon)
{
if (dy.p >= 0.0)
inverse_slope.p=dx.p < 0.0 ? -1.0/MagickEpsilon : 1.0/MagickEpsilon;
else
inverse_slope.p=dx.p < 0.0 ? 1.0/MagickEpsilon : -1.0/MagickEpsilon;
}
else
{
slope.p=dy.p/dx.p;
inverse_slope.p=(-1.0/slope.p);
}
l=0;
r=0;
max_strokes=2*number_vertices+1;
right_strokes=(PointInfo *) AcquireMemory(max_strokes*sizeof(PointInfo));
left_strokes=(PointInfo *) AcquireMemory(max_strokes*sizeof(PointInfo));
if ((right_strokes == (PointInfo *) NULL) ||
(left_strokes == (PointInfo *) NULL))
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
mid=ExpandAffine(&draw_info->affine)*draw_info->stroke_width/2.0;
miterlimit=draw_info->miterlimit*draw_info->miterlimit*mid*mid;
if ((draw_info->linecap == SquareCap) && !closed_path)
TraceSquareLinecap(polygon_primitive,number_vertices,mid);
offset.x=sqrt(mid*mid/(inverse_slope.p*inverse_slope.p+1.0));
offset.y=offset.x*inverse_slope.p;
if ((dy.p*offset.x-dx.p*offset.y) > 0.0)
{
left_points[0].x=polygon_primitive[0].point.x+offset.x;
left_points[1].x=polygon_primitive[n].point.x+offset.x;
left_points[0].y=polygon_primitive[0].point.y+offset.x*inverse_slope.p;
left_points[1].y=polygon_primitive[n].point.y+offset.x*inverse_slope.p;
right_points[0].x=polygon_primitive[0].point.x-offset.x;
right_points[1].x=polygon_primitive[n].point.x-offset.x;
right_points[0].y=polygon_primitive[0].point.y-offset.x*inverse_slope.p;
right_points[1].y=polygon_primitive[n].point.y-offset.x*inverse_slope.p;
}
else
{
right_points[0].x=polygon_primitive[0].point.x+offset.x;
right_points[1].x=polygon_primitive[n].point.x+offset.x;
right_points[0].y=polygon_primitive[0].point.y+offset.y;
right_points[1].y=polygon_primitive[n].point.y+offset.y;
left_points[0].x=polygon_primitive[0].point.x-offset.x;
left_points[1].x=polygon_primitive[n].point.x-offset.x;
left_points[0].y=polygon_primitive[0].point.y-offset.y;
left_points[1].y=polygon_primitive[n].point.y-offset.y;
}
/*
Create strokes for the line join attribute: bevel, miter, round.
*/
for (i=0; primitive_info[i].primitive != UndefinedPrimitive; i++);
left_strokes[0].x=left_points[0].x;
left_strokes[0].y=left_points[0].y;
right_strokes[0].x=right_points[0].x;
right_strokes[0].y=right_points[0].y;
l++;
r++;
for (i=n+1; i < number_vertices; i++)
{
/*
Compute the slope for this line segment, q.
*/
dx.q=polygon_primitive[i].point.x-polygon_primitive[n].point.x;
dy.q=polygon_primitive[i].point.y-polygon_primitive[n].point.y;
dot_product=dx.q*dx.q+dy.q*dy.q;
if (dot_product < 0.25)
continue;
slope.q=0.0;
inverse_slope.q=0.0;
if (fabs(dx.q) < MagickEpsilon)
{
if (dx.q >= 0.0)
slope.q=dy.q < 0.0 ? -1.0/MagickEpsilon : 1.0/MagickEpsilon;
else
slope.q=dy.q < 0.0 ? 1.0/MagickEpsilon : -1.0/MagickEpsilon;
}
else
if (fabs(dy.q) <= MagickEpsilon)
{
if (dy.q >= 0.0)
inverse_slope.q=dx.q < 0.0 ? -1.0/MagickEpsilon : 1.0/MagickEpsilon;
else
inverse_slope.q=dx.q < 0.0 ? 1.0/MagickEpsilon : -1.0/MagickEpsilon;
}
else
{
slope.q=dy.q/dx.q;
inverse_slope.q=(-1.0/slope.q);
}
offset.x=sqrt(mid*mid/(inverse_slope.q*inverse_slope.q+1.0));
offset.y=offset.x*inverse_slope.q;
dot_product=dy.q*offset.x-dx.q*offset.y;
if (dot_product > 0.0)
{
left_points[2].x=polygon_primitive[n].point.x+offset.x;
left_points[3].x=polygon_primitive[i].point.x+offset.x;
left_points[2].y=polygon_primitive[n].point.y+offset.y;
left_points[3].y=polygon_primitive[i].point.y+offset.y;
right_points[2].x=polygon_primitive[n].point.x-offset.x;
right_points[3].x=polygon_primitive[i].point.x-offset.x;
right_points[2].y=polygon_primitive[n].point.y-offset.y;
right_points[3].y=polygon_primitive[i].point.y-offset.y;
}
else
{
right_points[2].x=polygon_primitive[n].point.x+offset.x;
right_points[3].x=polygon_primitive[i].point.x+offset.x;
right_points[2].y=polygon_primitive[n].point.y+offset.y;
right_points[3].y=polygon_primitive[i].point.y+offset.y;
left_points[2].x=polygon_primitive[n].point.x-offset.x;
left_points[3].x=polygon_primitive[i].point.x-offset.x;
left_points[2].y=polygon_primitive[n].point.y-offset.y;
left_points[3].y=polygon_primitive[i].point.y-offset.y;
}
if (fabs(slope.p-slope.q) <= MagickEpsilon)
{
right_points[4].x=right_points[1].x;
left_points[4].x=left_points[1].x;
right_points[4].y=right_points[1].y;
left_points[4].y=left_points[1].y;
}
else
{
right_points[4].x=(slope.p*right_points[0].x-right_points[0].y-
slope.q*right_points[3].x+right_points[3].y)/(slope.p-slope.q);
right_points[4].y=slope.p*(right_points[4].x-right_points[0].x)+
right_points[0].y;
left_points[4].x=(slope.p*left_points[0].x-left_points[0].y-slope.q*
left_points[3].x+left_points[3].y)/(slope.p-slope.q);
left_points[4].y=slope.p*(left_points[4].x-left_points[0].x)+
left_points[0].y;
}
if (l >= (int) (max_strokes-6*BezierQuantum-360))
{
max_strokes+=6*BezierQuantum+360;
ReacquireMemory((void **) &right_strokes,
max_strokes*sizeof(PointInfo));
ReacquireMemory((void **) &left_strokes,max_strokes*sizeof(PointInfo));
if ((right_strokes == (PointInfo *) NULL) ||
(left_strokes == (PointInfo *) NULL))
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
}
dot_product=dx.q*dy.p-dx.p*dy.q;
if (dot_product <= 0.0)
switch (draw_info->linejoin)
{
case BevelJoin:
{
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
l++;
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product <= miterlimit)
{
right_strokes[r].x=right_points[4].x;
right_strokes[r].y=right_points[4].y;
}
else
{
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
}
r++;
break;
}
case MiterJoin:
{
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product > miterlimit)
{
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
l++;
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
r++;
}
else
{
left_strokes[l].x=left_points[4].x;
left_strokes[l].y=left_points[4].y;
l++;
right_strokes[r].x=right_points[4].x;
right_strokes[r].y=right_points[4].y;
r++;
}
break;
}
case RoundJoin:
{
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product <= miterlimit)
{
right_strokes[r].x=right_points[4].x;
right_strokes[r].y=right_points[4].y;
}
else
{
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
}
r++;
center=polygon_primitive[n].point;
theta.p=atan2(left_points[1].y-center.y,left_points[1].x-center.x);
theta.q=atan2(left_points[2].y-center.y,left_points[2].x-center.x);
if (theta.q < theta.p)
theta.q+=2.0*MagickPI;
arc_segments=(int) ceil(((theta.q-theta.p)/(2.0*sqrt(1.0/mid)))-0.5);
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
for (j=1; j < arc_segments; j++)
{
delta_theta=j*(theta.q-theta.p)/arc_segments;
left_strokes[l].x=center.x+mid*cos(theta.p+delta_theta);
left_strokes[l].y=center.y+mid*sin(theta.p+delta_theta);
l++;
}
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
l++;
break;
}
default:
break;
}
else
switch (draw_info->linejoin)
{
case BevelJoin:
{
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
r++;
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product <= miterlimit)
{
left_strokes[l].x=left_points[4].x;
left_strokes[l].y=left_points[4].y;
}
else
{
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
}
l++;
break;
}
case MiterJoin:
{
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product <= miterlimit)
{
left_strokes[l].x=left_points[4].x;
left_strokes[l].y=left_points[4].y;
l++;
right_strokes[r].x=right_points[4].x;
right_strokes[r].y=right_points[4].y;
r++;
}
else
{
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
l++;
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
r++;
}
break;
}
case RoundJoin:
{
dot_product=(left_points[4].x-right_points[4].x)*(left_points[4].x-
right_points[4].x)+(left_points[4].y-right_points[4].y)*
(left_points[4].y-right_points[4].y);
if (dot_product <= miterlimit)
{
left_strokes[l].x=left_points[4].x;
left_strokes[l].y=left_points[4].y;
}
else
{
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
left_strokes[l].x=left_points[2].x;
left_strokes[l].y=left_points[2].y;
}
l++;
center=polygon_primitive[n].point;
theta.p=atan2(right_points[1].y-center.y,right_points[1].x-center.x);
theta.q=atan2(right_points[2].y-center.y,right_points[2].x-center.x);
if (theta.p < theta.q)
theta.p+=2.0*MagickPI;
arc_segments=(int) ceil(((theta.p-theta.q)/(2.0*sqrt(1.0/mid)))-0.5);
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
for (j=1; j < arc_segments; j++)
{
delta_theta=j*(theta.q-theta.p)/arc_segments;
right_strokes[r].x=center.x+mid*cos(theta.p+delta_theta);
right_strokes[r].y=center.y+mid*sin(theta.p+delta_theta);
r++;
}
right_strokes[r].x=right_points[2].x;
right_strokes[r].y=right_points[2].y;
r++;
break;
}
default:
break;
}
slope.p=slope.q;
inverse_slope.p=inverse_slope.q;
left_points[0].x=left_points[2].x;
left_points[1].x=left_points[3].x;
left_points[0].y=left_points[2].y;
left_points[1].y=left_points[3].y;
right_points[0].x=right_points[2].x;
right_points[1].x=right_points[3].x;
right_points[0].y=right_points[2].y;
right_points[1].y=right_points[3].y;
dx.p=dx.q;
dy.p=dy.q;
n=i;
}
right_strokes[r].x=right_points[1].x;
right_strokes[r].y=right_points[1].y;
r++;
left_strokes[l].x=left_points[1].x;
left_strokes[l].y=left_points[1].y;
l++;
/*
Trace stroked polygon.
*/
stroke_polygon=(PrimitiveInfo *)
AcquireMemory((l+r+2*closed_path+2)*sizeof(PrimitiveInfo));
if (stroke_polygon == (PrimitiveInfo *) NULL)
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
for (i=0; i < r; i++)
{
stroke_polygon[i]=polygon_primitive[0];
stroke_polygon[i].point=right_strokes[i];
stroke_polygon[i].coordinates=1;
}
if (closed_path)
{
stroke_polygon[i]=polygon_primitive[0];
stroke_polygon[i].point=stroke_polygon[0].point;
stroke_polygon[i].coordinates=1;
i++;
}
for ( ; i < (r+l+closed_path); i++)
{
stroke_polygon[i]=polygon_primitive[0];
stroke_polygon[i].point=left_strokes[l+r+closed_path-(i+1)];
stroke_polygon[i].coordinates=1;
}
if (closed_path)
{
stroke_polygon[i]=polygon_primitive[0];
stroke_polygon[i].point=stroke_polygon[r+closed_path].point;
stroke_polygon[i].coordinates=1;
i++;
}
stroke_polygon[i]=polygon_primitive[0];
stroke_polygon[i].point=stroke_polygon[0].point;
stroke_polygon[i].coordinates=1;
stroke_polygon[0].coordinates=l+r+2*closed_path+1;
stroke_polygon[i+1].primitive=UndefinedPrimitive;
LiberateMemory((void **) &left_strokes);
LiberateMemory((void **) &right_strokes);
/*
Draw stroked polygon.
*/
path_info=ConvertPrimitiveToPath(draw_info,stroke_polygon);
if (path_info == (PathInfo *) NULL)
return;
polygon_info=ConvertPathToPolygon(draw_info,path_info);
LiberateMemory((void **) &path_info);
if (polygon_info == (PolygonInfo *) NULL)
return;
clone_info=CloneDrawInfo((ImageInfo *) NULL,draw_info);
clone_info->fill=draw_info->stroke;
clone_info->stroke.opacity=TransparentOpacity;
clone_info->stroke_width=0.0;
clone_info->fill_rule=NonZeroRule;
DrawPolygonPrimitive(clone_info,stroke_polygon,polygon_info,image);
DestroyDrawInfo(clone_info);
LiberateMemory((void **) &stroke_polygon);
DestroyPolygonInfo(polygon_info);
if ((draw_info->linecap == RoundCap) && !closed_path)
{
DrawRoundLinecap(draw_info,&polygon_primitive[0],image);
DrawRoundLinecap(draw_info,&polygon_primitive[number_vertices-1],image);
}
LiberateMemory((void **) &polygon_primitive);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t D r a w I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method GetDrawInfo initializes the DrawInfo structure.
%
% The format of the GetDrawInfo method is:
%
% void GetDrawInfo(const ImageInfo *image_info,DrawInfo *draw_info)
%
% A description of each parameter follows:
%
% o image_info: Specifies a pointer to an ImageInfo structure.
%
% o draw_info: Specifies a pointer to a DrawInfo structure.
%
%
*/
MagickExport void GetDrawInfo(const ImageInfo *image_info,DrawInfo *draw_info)
{
ImageInfo
*clone_info;
/*
Initialize draw attributes.
*/
assert(draw_info != (DrawInfo *) NULL);
memset(draw_info,0,sizeof(DrawInfo));
clone_info=CloneImageInfo(image_info);
IdentityAffine(&draw_info->affine);
draw_info->gravity=NorthWestGravity;
draw_info->opacity=OpaqueOpacity;
draw_info->fill=clone_info->pen;
(void) QueryColorDatabase("none",&draw_info->stroke);
draw_info->stroke_antialias=clone_info->antialias;
draw_info->stroke_width=1.0;
draw_info->fill_rule=EvenOddRule;
draw_info->linecap=ButtCap;
draw_info->linejoin=MiterJoin;
draw_info->miterlimit=10;
draw_info->decorate=NoDecoration;
if (clone_info->font != (char *) NULL)
draw_info->font=AllocateString(clone_info->font);
if (clone_info->density != (char *) NULL)
draw_info->density=AllocateString(clone_info->density);
draw_info->text_antialias=clone_info->antialias;
draw_info->pointsize=clone_info->pointsize;
(void) QueryColorDatabase("none",&draw_info->box);
draw_info->border_color=clone_info->border_color;
draw_info->compose=CopyCompositeOp;
if (clone_info->server_name != (char *) NULL)
draw_info->server_name=AllocateString(clone_info->server_name);
draw_info->debug=clone_info->debug;
draw_info->signature=MagickSignature;
DestroyImageInfo(clone_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% M a t t e F l o o d f i l l I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method MatteFloodfillImage floodfills the designated area with a matte
% value. The floodfill algorithm is strongly based on a similar algorithm in
% "Graphics Gems" by Paul Heckbert.
%
% The format of the MatteFloodfillImage method is:
%
% unsigned int MatteFloodfillImage(Image *image,const PixelPacket target,
% const unsigned int matte,const int x_offset,const int y_offset,
% const PaintMethod method)
%
% A description of each parameter follows:
%
% o image: The address of a structure of type Image.
%
% o target: A PixelPacket structure. This is the RGB value of the target
% color.
%
% o matte: A integer value representing the amount of transparency.
%
% o x,y: Unsigned integers representing the current location of the pen.
%
% o method: drawing method of type PrimitiveType: floodfill or fill to
% border.
%
%
*/
MagickExport unsigned int MatteFloodfillImage(Image *image,
const PixelPacket target,const unsigned int matte,const int x_offset,
const int y_offset,const PaintMethod method)
{
int
offset,
skip,
start,
x1,
x2,
y;
register int
x;
register PixelPacket
*q;
register SegmentInfo
*s;
SegmentInfo
*segment_stack;
/*
Check boundary conditions.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if ((x_offset < 0) || (x_offset >= (int) image->columns))
return(False);
if ((y_offset < 0) || (y_offset >= (int) image->rows))
return(False);
if (target.opacity == matte)
return(False);
q=GetImagePixels(image,x_offset,y_offset,1,1);
if (q == (PixelPacket *) NULL)
return(False);
if (q->opacity == matte)
return(False);
/*
Allocate segment stack.
*/
segment_stack=(SegmentInfo *) AcquireMemory(MaxStacksize*sizeof(SegmentInfo));
if (segment_stack == (SegmentInfo *) NULL)
ThrowBinaryException(ResourceLimitWarning,"Unable to floodfill image",
image->filename);
/*
Push initial segment on stack.
*/
image->storage_class=DirectClass;
if (!image->matte)
SetImageOpacity(image,OpaqueOpacity);
x=x_offset;
y=y_offset;
start=0;
s=segment_stack;
Push(y,x,x,1);
Push(y+1,x,x,-1);
while (s > segment_stack)
{
/*
Pop segment off stack.
*/
s--;
x1=(int) s->x1;
x2=(int) s->x2;
offset=(int) s->y2;
y=(int) s->y1+offset;
/*
Recolor neighboring points.
*/
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
q+=x1;
for (x=x1; x >= 0 ; x--)
{
if (method == FloodfillMethod)
{
if (!MatteMatch(*q,target,image->fuzz))
break;
}
else
if (MatteMatch(*q,target,image->fuzz) || (q->opacity == matte))
break;
q->opacity=matte;
q--;
}
if (!SyncImagePixels(image))
break;
skip=x >= x1;
if (!skip)
{
start=x+1;
if (start < x1)
Push(y,start,x1-1,-offset);
x=x1+1;
}
do
{
if (!skip)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
q+=x;
for ( ; x < (int) image->columns; x++)
{
if (method == FloodfillMethod)
{
if (!MatteMatch(*q,target,image->fuzz))
break;
}
else
if (MatteMatch(*q,target,image->fuzz) || (q->opacity == matte))
break;
q->opacity=matte;
q++;
}
if (!SyncImagePixels(image))
break;
Push(y,start,x-1,offset);
if (x > (x2+1))
Push(y,x2+1,x-1,-offset);
}
skip=False;
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
q+=x;
for (x++; x <= x2 ; x++)
{
q++;
if (method == FloodfillMethod)
{
if (MatteMatch(*q,target,image->fuzz))
break;
}
else
if (!MatteMatch(*q,target,image->fuzz) && (q->opacity != matte))
break;
}
start=x;
} while (x <= x2);
}
LiberateMemory((void **) &segment_stack);
return(True);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% O p a q u e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method OpaqueImage changes the color of an opaque point to the pen color.
%
% The format of the OpaqueImage method is:
%
% unsigned int OpaqueImage(Image *image,const PixelPacket target,
% const PixelPacket pen_color)
%
% A description of each parameter follows:
%
% o image: The address of a structure of type Image; returned from
% ReadImage.
%
% o target: the color to search for in the image.
%
% o pen_color: the color to replace it with.
%
%
*/
MagickExport unsigned int OpaqueImage(Image *image,const PixelPacket target,
const PixelPacket pen_color)
{
#define OpaqueImageText " Setting opaque color in the image... "
int
y;
register int
i,
x;
register PixelPacket
*q;
/*
Make image color opaque.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
switch (image->storage_class)
{
case DirectClass:
default:
{
/*
Make DirectClass image opaque.
*/
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
for (x=0; x < (int) image->columns; x++)
{
if (ColorMatch(*q,target,image->fuzz))
*q=pen_color;
q++;
}
if (!SyncImagePixels(image))
break;
if (QuantumTick(y,image->rows))
MagickMonitor(OpaqueImageText,y,image->rows);
}
break;
}
case PseudoClass:
{
/*
Make PseudoClass image opaque.
*/
for (i=0; i < (int) image->colors; i++)
{
if (ColorMatch(image->colormap[i],target,image->fuzz))
image->colormap[i]=pen_color;
if (QuantumTick(i,image->colors))
MagickMonitor(OpaqueImageText,i,image->colors);
}
SyncImage(image);
break;
}
}
return(True);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ T r a c e P r i m i t i v e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% TracePrimitive is a collection of methods for generating graphic
% primitives such as arcs, ellipses, paths, etc.
%
%
*/
static void TraceArc(PrimitiveInfo *primitive_info,const PointInfo start,
const PointInfo end,const PointInfo arc,const double angle,
const unsigned int large_arc,const unsigned int sweep)
{
double
alpha,
beta,
factor,
gamma,
theta;
int
arc_segments;
PointInfo
center,
points[3];
register double
cosine,
sine;
register int
i;
register PrimitiveInfo
*p;
primitive_info->coordinates=0;
if ((arc.x == 0.0) || (arc.y == 0.0))
return;
cosine=cos(DegreesToRadians(angle));
sine=sin(DegreesToRadians(angle));
points[0].x=cosine*start.x/arc.x+sine*start.y/arc.x;
points[0].y=cosine*start.y/arc.y-sine*start.x/arc.y;
points[1].x=cosine*end.x/arc.x+sine*end.y/arc.x;
points[1].y=cosine*end.y/arc.y-sine*end.x/arc.y;
alpha=points[1].x-points[0].x;
beta=points[1].y-points[0].y;
factor=1.0/(alpha*alpha+beta*beta)-0.25;
if (factor <= 0.0)
factor=0.0;
else
{
factor=sqrt(factor);
if (sweep == large_arc)
factor=(-factor);
}
center.x=0.5*(points[0].x+points[1].x)-factor*beta;
center.y=0.5*(points[0].y+points[1].y)+factor*alpha;
alpha=atan2(points[0].y-center.y,points[0].x-center.x);
theta=atan2(points[1].y-center.y,points[1].x-center.x)-alpha;
if ((theta < 0.0) && sweep)
theta+=2.0*MagickPI;
else
if ((theta > 0.0) && !sweep)
theta-=2.0*MagickPI;
arc_segments=(int) ceil((fabs(theta/(0.5*MagickPI+MagickEpsilon)))-0.5);
p=primitive_info;
for (i=0; i < arc_segments; i++)
{
beta=0.5*((alpha+(i+1)*theta/arc_segments)-
(alpha+i*theta/arc_segments));
gamma=(8.0/3.0)*sin(0.5*beta)*sin(0.5*beta)/sin(beta);
points[0].x=center.x+cos((alpha+i*theta/arc_segments))-
gamma*sin((alpha+i*theta/arc_segments));
points[0].y=center.y+sin((alpha+i*theta/arc_segments))+
gamma*cos((alpha+i*theta/arc_segments));
points[2].x=center.x+cos((alpha+(i+1)*theta/arc_segments));
points[2].y=center.y+sin((alpha+(i+1)*theta/arc_segments));
points[1].x=points[2].x+gamma*sin((alpha+(i+1)*theta/arc_segments));
points[1].y=points[2].y-gamma*cos((alpha+(i+1)*theta/arc_segments));
p->point.x=(p == primitive_info) ? start.x : (p-1)->point.x;
p->point.y=(p == primitive_info) ? start.y : (p-1)->point.y;
(p+1)->point.x=cosine*arc.x*points[0].x-sine*arc.y*points[0].y;
(p+1)->point.y=sine*arc.x*points[0].x+cosine*arc.y*points[0].y;
(p+2)->point.x=cosine*arc.x*points[1].x-sine*arc.y*points[1].y;
(p+2)->point.y=sine*arc.x*points[1].x+cosine*arc.y*points[1].y;
(p+3)->point.x=cosine*arc.x*points[2].x-sine*arc.y*points[2].y;
(p+3)->point.y=sine*arc.x*points[2].x+cosine*arc.y*points[2].y;
if (i == (arc_segments-1))
(p+3)->point=end;
TraceBezier(p,4);
p+=p->coordinates;
}
primitive_info->coordinates=p-primitive_info;
for (i=0; i < primitive_info->coordinates; i++)
{
p->primitive=primitive_info->primitive;
p--;
}
}
static void TraceBezier(PrimitiveInfo *primitive_info,
const unsigned int number_coordinates)
{
double
alpha,
*coefficients,
weight;
PointInfo
end,
point,
*points;
register int
i,
j;
register PrimitiveInfo
*p;
unsigned int
control_points,
quantum;
/*
Allocate coeficients.
*/
quantum=number_coordinates;
for (i=0; i < (int) number_coordinates; i++)
{
for (j=i+1; j < (int) number_coordinates; j++)
{
alpha=fabs(primitive_info[j].point.x-primitive_info[i].point.x);
if (alpha > quantum)
quantum=(unsigned int) alpha;
alpha=fabs(primitive_info[j].point.y-primitive_info[i].point.y);
if (alpha > quantum)
quantum=(unsigned int) alpha;
}
}
quantum=Min(quantum/number_coordinates,BezierQuantum);
control_points=quantum*number_coordinates;
coefficients=(double *) AcquireMemory(number_coordinates*sizeof(double));
points=(PointInfo *) AcquireMemory(control_points*sizeof(PointInfo));
if ((coefficients == (double *) NULL) || (points == (PointInfo *) NULL))
MagickError(ResourceLimitWarning,"Unable to draw image",
"Memory allocation failed");
/*
Compute bezier points.
*/
end=primitive_info[number_coordinates-1].point;
weight=0.0;
for (i=0; i < (int) number_coordinates; i++)
coefficients[i]=Permutate(number_coordinates-1,i);
for (i=0; i < (int) control_points; i++)
{
p=primitive_info;
point.x=0;
point.y=0;
alpha=pow(1.0-weight,number_coordinates-1);
for (j=0; j < (int) number_coordinates; j++)
{
point.x+=alpha*coefficients[j]*p->point.x;
point.y+=alpha*coefficients[j]*p->point.y;
alpha*=weight/(1.0-weight);
p++;
}
points[i]=point;
weight+=1.0/quantum/number_coordinates;
}
/*
Bezier curves are just short segmented polys.
*/
p=primitive_info;
for (i=0; i < (int) control_points; i++)
{
TracePoint(p,points[i]);
p++;
}
TracePoint(p,end);
primitive_info->coordinates=p-primitive_info+1;
for (i=0; i < primitive_info->coordinates; i++)
{
p->primitive=primitive_info->primitive;
p--;
}
LiberateMemory((void **) &points);
LiberateMemory((void **) &coefficients);
}
static void TraceCircle(PrimitiveInfo *primitive_info,const PointInfo start,
const PointInfo end)
{
double
alpha,
beta,
radius;
PointInfo
offset,
degrees;
alpha=end.x-start.x;
beta=end.y-start.y;
radius=sqrt(alpha*alpha+beta*beta);
offset.x=radius;
offset.y=radius;
degrees.x=0.0;
degrees.y=360.0;
TraceEllipse(primitive_info,start,offset,degrees);
}
static void TraceEllipse(PrimitiveInfo *primitive_info,const PointInfo start,
const PointInfo end,const PointInfo degrees)
{
double
angle;
PointInfo
point;
register int
i;
register PrimitiveInfo
*p;
/*
Ellipses are just short segmented polys.
*/
p=primitive_info;
for (angle=degrees.x; angle <= degrees.y; angle+=1.0)
{
point.x=cos(DegreesToRadians(fmod(angle,360.0)))*end.x+start.x;
point.y=sin(DegreesToRadians(fmod(angle,360.0)))*end.y+start.y;
TracePoint(p,point);
p++;
}
primitive_info->coordinates=p-primitive_info;
for (i=0; i < primitive_info->coordinates; i++)
{
p->primitive=primitive_info->primitive;
p--;
}
}
static void TraceLine(PrimitiveInfo *primitive_info,const PointInfo start,
const PointInfo end)
{
TracePoint(primitive_info,start);
TracePoint(primitive_info+1,end);
(primitive_info+1)->primitive=primitive_info->primitive;
primitive_info->coordinates=2;
}
static unsigned int TracePath(PrimitiveInfo *primitive_info,const char *path)
{
char
*p;
double
x,
y;
int
attribute;
PointInfo
end,
points[4],
point,
start;
PrimitiveType
primitive_type;
register int
i;
register PrimitiveInfo
*q;
unsigned int
number_coordinates,
subpath,
z_count;
point.x=0;
point.y=0;
number_coordinates=0;
subpath=False;
z_count=0;
primitive_type=primitive_info->primitive;
q=primitive_info;
for (p=(char *) path; *p != '\0'; )
{
while (isspace((int) *p))
p++;
if (*p == '\0')
break;
attribute=(*p++);
switch (attribute)
{
case 'a':
case 'A':
{
double
angle;
PointInfo
arc;
unsigned int
large_arc,
sweep;
/*
Compute arc points.
*/
subpath=True;
arc.x=strtod(p,&p);
if (*p == ',')
p++;
arc.y=strtod(p,&p);
if (*p == ',')
p++;
angle=strtod(p,&p);
if (*p == ',')
p++;
large_arc=(unsigned int) strtod(p,&p);
if (*p == ',')
p++;
sweep=(unsigned int) strtod(p,&p);
if (*p == ',')
p++;
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
end.x=attribute == 'A' ? x : point.x+x;
end.y=attribute == 'A' ? y : point.y+y;
TraceArc(q,point,end,arc,angle,large_arc,sweep);
q+=q->coordinates;
point=end;
break;
}
case 'c':
case 'C':
{
/*
Compute bezier points.
*/
subpath=True;
do
{
points[0]=point;
for (i=1; i <= 3; i++)
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
if (*p == ',')
p++;
end.x=attribute == 'C' ? x : point.x+x;
end.y=attribute == 'C' ? y : point.y+y;
points[i]=end;
}
for (i=0; i <= 3; i++)
(q+i)->point=points[i];
TraceBezier(q,4);
q+=q->coordinates;
point=end;
} while (IsGeometry(p));
break;
}
case 'H':
case 'h':
{
do
{
x=strtod(p,&p);
point.x=attribute == 'H' ? x: point.x+x;
TracePoint(q,point);
q+=q->coordinates;
} while (IsGeometry(p));
break;
}
case 'l':
case 'L':
{
do
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
if (*p == ',')
p++;
point.x=attribute == 'L' ? x : point.x+x;
point.y=attribute == 'L' ? y : point.y+y;
TracePoint(q,point);
q+=q->coordinates;
} while (IsGeometry(p));
break;
}
case 'M':
case 'm':
{
if (q != primitive_info)
{
primitive_info->coordinates=q-primitive_info;
number_coordinates+=primitive_info->coordinates;
primitive_info=q;
}
do
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
point.x=attribute == 'M' ? x : point.x+x;
point.y=attribute == 'M' ? y : point.y+y;
TracePoint(q,point);
q+=q->coordinates;
} while (IsGeometry(p));
start=point;
break;
}
case 'q':
case 'Q':
{
/*
Compute bezier points.
*/
subpath=True;
do
{
points[0]=point;
for (i=1; i < 3; i++)
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
if (*p == ',')
p++;
end.x=attribute == 'Q' ? x : point.x+x;
end.y=attribute == 'Q' ? y : point.y+y;
points[i]=end;
}
for (i=0; i < 3; i++)
(q+i)->point=points[i];
TraceBezier(q,3);
q+=q->coordinates;
point=end;
} while (IsGeometry(p));
break;
}
case 's':
case 'S':
{
/*
Compute bezier points.
*/
subpath=True;
do
{
points[0]=points[3];
points[1].x=2.0*points[3].x-points[2].x;
points[1].y=2.0*points[3].y-points[2].y;
for (i=2; i <= 3; i++)
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
if (*p == ',')
p++;
end.x=attribute == 'S' ? x : point.x+x;
end.y=attribute == 'S' ? y : point.y+y;
points[i]=end;
}
for (i=0; i <= 4; i++)
(q+i)->point=points[i];
TraceBezier(q,4);
q+=q->coordinates;
point=end;
} while (IsGeometry(p));
break;
}
case 't':
case 'T':
{
/*
Compute bezier points.
*/
subpath=True;
do
{
points[0]=points[2];
points[1].x=2.0*points[2].x-points[1].x;
points[1].y=2.0*points[2].y-points[1].y;
for (i=2; i < 3; i++)
{
x=strtod(p,&p);
if (*p == ',')
p++;
y=strtod(p,&p);
if (*p == ',')
p++;
end.x=attribute == 'T' ? x : point.x+x;
end.y=attribute == 'T' ? y : point.y+y;
points[i]=end;
}
for (i=0; i < 3; i++)
(q+i)->point=points[i];
TraceBezier(q,3);
q+=q->coordinates;
point=end;
} while (IsGeometry(p));
break;
}
case 'v':
case 'V':
{
do
{
y=strtod(p,&p);
point.y=attribute == 'V' ? y : point.y+y;
TracePoint(q,point);
q+=q->coordinates;
} while (IsGeometry(p));
break;
}
case 'z':
case 'Z':
{
point=start;
TracePoint(q,point);
q+=q->coordinates;
primitive_info->coordinates=q-primitive_info;
number_coordinates+=primitive_info->coordinates;
primitive_info=q;
z_count++;
break;
}
default:
{
if (isalpha((int) attribute))
(void) fprintf(stderr,"attribute not recognized: %c\n",attribute);
break;
}
}
}
if (z_count == 0)
{
TracePoint(q,point);
q+=q->coordinates;
}
primitive_info->coordinates=q-primitive_info;
number_coordinates+=primitive_info->coordinates;
for (i=0; i < number_coordinates; i++)
{
q--;
q->primitive=primitive_type;
if (z_count > 1)
q->method=FillToBorderMethod;
}
return(number_coordinates);
}
static void TracePoint(PrimitiveInfo *primitive_info,const PointInfo point)
{
primitive_info->coordinates=1;
primitive_info->point=point;
}
static void TraceRectangle(PrimitiveInfo *primitive_info,const PointInfo start,
const PointInfo end)
{
PointInfo
point;
register int
i;
register PrimitiveInfo
*p;
p=primitive_info;
TracePoint(p,start);
p+=p->coordinates;
point.x=start.x;
point.y=end.y;
TracePoint(p,point);
p+=p->coordinates;
TracePoint(p,end);
p+=p->coordinates;
point.x=end.x;
point.y=start.y;
TracePoint(p,point);
p+=p->coordinates;
TracePoint(p,start);
p+=p->coordinates;
primitive_info->coordinates=p-primitive_info;
for (i=0; i < primitive_info->coordinates; i++)
{
p->primitive=primitive_info->primitive;
p--;
}
}
static void TraceRoundRectangle(PrimitiveInfo *primitive_info,
const PointInfo start,const PointInfo end,PointInfo arc)
{
PointInfo
degrees,
offset,
point;
register int
i;
register PrimitiveInfo
*p;
p=primitive_info;
offset.x=end.x-start.x;
offset.y=end.y-start.y;
if (arc.x > (0.5*offset.x))
arc.x=0.5*offset.x;
if (arc.y > (0.5*offset.y))
arc.y=0.5*offset.y;
point.x=start.x+offset.x-arc.x;
point.y=start.y+arc.y;
degrees.x=270.0;
degrees.y=360.0;
TraceEllipse(p,point,arc,degrees);
p+=p->coordinates;
point.x=start.x+offset.x-arc.x;
point.y=start.y+offset.y-arc.y;
degrees.x=0.0;
degrees.y=90.0;
TraceEllipse(p,point,arc,degrees);
p+=p->coordinates;
point.x=start.x+arc.x;
point.y=start.y+offset.y-arc.y;
degrees.x=90.0;
degrees.y=180.0;
TraceEllipse(p,point,arc,degrees);
p+=p->coordinates;
point.x=start.x+arc.x;
point.y=start.y+arc.y;
degrees.x=180.0;
degrees.y=270.0;
TraceEllipse(p,point,arc,degrees);
p+=p->coordinates;
TracePoint(p,primitive_info->point);
p+=p->coordinates;
primitive_info->coordinates=p-primitive_info;
for (i=0; i < primitive_info->coordinates; i++)
{
p->primitive=primitive_info->primitive;
p--;
}
}
static void TraceSquareLinecap(PrimitiveInfo *primitive_info,
const int number_vertices,const double offset)
{
double
distance;
register double
dx,
dy;
register int
i;
dx=0.0;
dy=0.0;
for (i=1; i < number_vertices; i++)
{
dx=primitive_info[0].point.x-primitive_info[i].point.x;
dy=primitive_info[0].point.y-primitive_info[i].point.y;
if ((fabs(dx) >= MagickEpsilon) || (fabs(dy) >= MagickEpsilon))
break;
}
distance=sqrt(dx*dx+dy*dy+MagickEpsilon);
primitive_info[0].point.x=primitive_info[i].point.x+
dx*(distance+offset)/distance;
primitive_info[0].point.y=primitive_info[i].point.y+
dy*(distance+offset)/distance;
for (i=number_vertices-2; i >= 0; i--)
{
dx=primitive_info[number_vertices-1].point.x-primitive_info[i].point.x;
dy=primitive_info[number_vertices-1].point.y-primitive_info[i].point.y;
if ((fabs(dx) >= MagickEpsilon) || (fabs(dy) >= MagickEpsilon))
break;
}
distance=sqrt(dx*dx+dy*dy+MagickEpsilon);
primitive_info[number_vertices-1].point.x=primitive_info[i].point.x+
dx*(distance+offset)/distance;
primitive_info[number_vertices-1].point.y=primitive_info[i].point.y+
dy*(distance+offset)/distance;
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% T r a n s p a r e n t I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Method TransparentImage creates a matte image associated with the
% image. All pixel locations are initially set to opaque. Any pixel
% that matches the specified color are set to supplied opacity value.
%
% The format of the TransparentImage method is:
%
% unsigned int TransparentImage(Image *image,const PixelPacket target,
% const unsigned int opacity)
%
% A description of each parameter follows:
%
% o image: The address of a structure of type Image; returned from
% ReadImage.
%
% o target: The color to search for in the image.
%
%
*/
MagickExport unsigned int TransparentImage(Image *image,
const PixelPacket target,const unsigned int opacity)
{
#define TransparentImageText " Setting transparent color in the image... "
int
y;
register int
x;
register PixelPacket
*q;
/*
Make image color transparent.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (!image->matte)
SetImageOpacity(image,OpaqueOpacity);
for (y=0; y < (int) image->rows; y++)
{
q=GetImagePixels(image,0,y,image->columns,1);
if (q == (PixelPacket *) NULL)
break;
for (x=0; x < (int) image->columns; x++)
{
if (ColorMatch(*q,target,image->fuzz))
q->opacity=opacity;
q++;
}
if (!SyncImagePixels(image))
break;
if (QuantumTick(y,image->rows))
MagickMonitor(TransparentImageText,y,image->rows);
}
return(True);
}
