1 #include "../../config.h"
3 #include "../gfxdevice.h"
4 #include "../gfxtools.h"
5 #include "../art/libart.h"
9 ArtVpath* gfxline_to_ArtVpath(gfxline_t*line)
16 /* factor which determines into how many line fragments a spline is converted */
17 double subfraction = 2.4;//0.3
21 if(l2->type == gfx_moveTo) {
23 } if(l2->type == gfx_lineTo) {
25 } if(l2->type == gfx_splineTo) {
26 int parts = (int)(sqrt(fabs(l2->x-2*l2->sx+x) + fabs(l2->y-2*l2->sy+y))*subfraction);
37 vec = art_new (ArtVpath, len+1);
42 if(l2->type == gfx_moveTo) {
43 vec[pos].code = ART_MOVETO;
48 } else if(l2->type == gfx_lineTo) {
49 vec[pos].code = ART_LINETO;
54 } else if(l2->type == gfx_splineTo) {
56 int parts = (int)(sqrt(fabs(l2->x-2*l2->sx+x) + fabs(l2->y-2*l2->sy+y))*subfraction);
57 double stepsize = parts?1.0/parts:0;
58 for(i=0;i<=parts;i++) {
59 double t = (double)i*stepsize;
60 vec[pos].code = ART_LINETO;
61 vec[pos].x = l2->x*t*t + 2*l2->sx*t*(1-t) + x*(1-t)*(1-t);
62 vec[pos].y = l2->y*t*t + 2*l2->sy*t*(1-t) + y*(1-t)*(1-t);
71 vec[pos].code = ART_END;
73 /* fix "dotted" lines */
76 for(t=0;vec[t].code!=ART_END;t++) {
77 if(t>0 && vec[t-1].code==ART_MOVETO && vec[t].code==ART_LINETO
78 && vec[t+1].code!=ART_LINETO
79 && vec[t-1].x == vec[t].x
80 && vec[t-1].y == vec[t].y) {
83 if(vec[t].code==ART_MOVETO)
89 // Spot adjacent identical points
93 if ((vec[t-1].x == vec[t].x) && (vec[t-1].y == vec[t].y)) {
94 // adjacent identical points; remove one
95 memcpy(&(vec[t]), &(vec[t + 1]), sizeof(vec[t]) * (pos - t));
102 /* adjacency remover disabled for now, pending code inspection */
105 // Check for further non-adjacent identical points. We don't want any
106 // points other than the first and last points to exactly match.
108 // If we do find matching points, move the second point slightly. This
109 // currently moves the duplicate 2% towards the midpoint of its neighbours
110 // (easier to calculate than 2% down the perpendicular to the line joining
111 // the neighbours) but limiting the change to 0.1 twips to avoid visual
112 // problems when the shapes are large. Note that there is no minimum
113 // change: if the neighbouring points are colinear and equally spaced,
114 // e.g. they were generated as part of a straight spline, then the
115 // duplicate point may not actually move.
117 // The scan for duplicates algorithm is quadratic in the number of points:
118 // there's probably a better method but the numbers of points is generally
119 // small so this will do for now.
122 for(; i < (pos - 1); ++i)
124 for (j = 0; j < i; ++j)
126 if ((vec[i].x == vec[j].x)
127 && (vec[i].y == vec[j].y))
129 // points match; shuffle point
130 double dx = (vec[i-1].x + vec[i+1].x - (vec[i].x * 2.0)) / 100.0;
131 double dy = (vec[i-1].y + vec[i+1].y - (vec[i].y * 2.0)) / 100.0;
132 double dxxyy = (dx*dx) + (dy*dy);
135 // This is more than 0.1 twip's distance; scale down
136 double dscale = sqrt(dxxyy) * 10.0;
151 void show_path(ArtSVP*path)
154 printf("Segments: %d\n", path->n_segs);
155 for(t=0;t<path->n_segs;t++) {
156 ArtSVPSeg* seg = &path->segs[t];
157 printf("Segment %d: %d points, %s, BBox: (%f,%f,%f,%f)\n",
158 t, seg->n_points, seg->dir==0?"UP ":"DOWN",
159 seg->bbox.x0, seg->bbox.y0, seg->bbox.x1, seg->bbox.y1);
161 for(p=0;p<seg->n_points;p++) {
162 ArtPoint* point = &seg->points[p];
163 printf(" (%f,%f)\n", point->x, point->y);
169 ArtSVP* gfxfillToSVP(gfxline_t*line, int perturb)
171 ArtVpath* vec = gfxline_to_ArtVpath(line);
173 ArtVpath* vec2 = art_vpath_perturb(vec);
177 ArtSVP *svp = art_svp_from_vpath(vec);
180 // We need to make sure that the SVP we now have bounds an area (i.e. the
181 // source line wound anticlockwise) rather than excludes an area (i.e. the
182 // line wound clockwise). It seems that PDF (or xpdf) is less strict about
183 // this for bitmaps than it is for fill areas.
185 // To check this, we'll sum the cross products of all pairs of adjacent
186 // lines. If the result is positive, the direction is correct; if not, we
187 // need to reverse the sense of the SVP generated. The easiest way to do
188 // this is to flip the up/down flags of all the segments.
190 // This is approximate; since the gfxline_t structure can contain any
191 // combination of moveTo, lineTo and splineTo in any order, not all pairs
192 // of lines in the shape that share a point need be described next to each
193 // other in the sequence. For ease, we'll consider only pairs of lines
194 // stored as lineTos and splineTos without intervening moveTos.
196 // TODO is this a valid algorithm? My vector maths is rusty.
198 // It may be more correct to instead reverse the line before we feed it
199 // into gfxfilltoSVP. However, this seems equivalent and is easier to
201 double total_cross_product = 0.0;
202 gfxline_t* cursor = line;
205 double x_last = cursor->x;
206 double y_last = cursor->y;
207 cursor = cursor->next;
209 while((cursor != NULL) && (cursor->next != NULL))
211 if (((cursor->type == gfx_lineTo) || (cursor->type == gfx_splineTo))
212 && ((cursor->next->type == gfx_lineTo) || (cursor->next->type == gfx_splineTo)))
214 // Process these lines
216 // In this space (x right, y down) the cross-product is
217 // (x1 * y0) - (x0 * y1)
218 double x0 = cursor->x - x_last;
219 double y0 = cursor->y - y_last;
220 double x1 = cursor->next->x - cursor->x;
221 double y1 = cursor->next->y - cursor->y;
222 total_cross_product += (x1 * y0) - (x0 * y1);
227 cursor = cursor->next;
230 if (total_cross_product < 0.0)
233 for(; i < svp->n_segs; ++i)
235 if (svp->segs[i].dir != 0)
236 svp->segs[i].dir = 0;
238 svp->segs[i].dir = 1;
243 ArtSVP* boxToSVP(double x1, double y1,double x2, double y2)
245 ArtVpath *vec = art_new (ArtVpath, 5+1);
246 vec[0].code = ART_MOVETO;
249 vec[1].code = ART_LINETO;
252 vec[2].code = ART_LINETO;
255 vec[3].code = ART_LINETO;
258 vec[4].code = ART_LINETO;
261 vec[5].code = ART_END;
264 ArtSVP *svp = art_svp_from_vpath(vec);
269 ArtSVP* gfxstrokeToSVP(gfxline_t*line, gfxcoord_t width, gfx_capType cap_style, gfx_joinType joint_style, double miterLimit)
271 ArtVpath* vec = gfxline_to_ArtVpath(line);
273 ArtSVP *svp = art_svp_vpath_stroke (vec,
274 (joint_style==gfx_joinMiter)?ART_PATH_STROKE_JOIN_MITER:
275 ((joint_style==gfx_joinRound)?ART_PATH_STROKE_JOIN_ROUND:
276 ((joint_style==gfx_joinBevel)?ART_PATH_STROKE_JOIN_BEVEL:ART_PATH_STROKE_JOIN_BEVEL)),
277 (cap_style==gfx_capButt)?ART_PATH_STROKE_CAP_BUTT:
278 ((cap_style==gfx_capRound)?ART_PATH_STROKE_CAP_ROUND:
279 ((cap_style==gfx_capSquare)?ART_PATH_STROKE_CAP_SQUARE:ART_PATH_STROKE_CAP_SQUARE)),
281 miterLimit, //miter_limit
288 gfxline_t* SVPtogfxline(ArtSVP*svp)
293 for(t=0;t<svp->n_segs;t++) {
294 size += svp->segs[t].n_points + 1;
296 gfxline_t* lines = (gfxline_t*)rfx_alloc(sizeof(gfxline_t)*size);
298 for(t=0;t<svp->n_segs;t++) {
299 ArtSVPSeg* seg = &svp->segs[t];
301 for(p=0;p<seg->n_points;p++) {
302 lines[pos].type = p==0?gfx_moveTo:gfx_lineTo;
303 ArtPoint* point = &seg->points[p];
304 lines[pos].x = point->x;
305 lines[pos].y = point->y;
306 lines[pos].next = &lines[pos+1];
311 lines[pos-1].next = 0;