cpml/cpml-arc.c

   1 /* CPML - Cairo Path Manipulation Library
   2  * Copyright (C) 2008, 2009  Nicola Fontana <ntd at entidi.it>
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Lesser General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Lesser General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Lesser General Public
  15  * License along with this library; if not, write to the
  16  * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  17  * Boston, MA  02110-1301, USA.
  18  */
  19
  20
  21 /**
  22  * SECTION:cpml-arc
  23  * @Section_Id:CpmlArc
  24  * @title: CpmlArc
  25  * @short_description: Manipulation of circular arcs
  26  *
  27  * The following functions manipulate #CAIRO_PATH_ARC_TO #CpmlPrimitive.
  28  * No validation is made on the input so use the following methods
  29  * only when you are sure the <varname>primitive</varname> argument
  30  * is effectively an arc-to.
  31  *
  32  * The arc primitive is defined by 3 points: the first one is the usual
  33  * implicit point got from the previous primitive, the second point is
  34  * an arbitrary intermediate point laying on the arc and the third point
  35  * is the end of the arc. These points identify univocally an arc:
  36  * furthermore, the intermediate point also gives the side of
  37  * the arc.
  38  *
  39  * As a special case, when the first point is coincident with the end
  40  * point the primitive is considered a circle with diameter defined by
  41  * the segment between the first and the intermediate point.
  42  *
  43  * <important>
  44  * <para>
  45  * An arc is not a native cairo primitive and should be treated specially.
  46  * </para>
  47  * </important>
  48  *
  49  * Using these CPML APIs you are free to use #CAIRO_PATH_ARC_TO whenever
  50  * you want but, if you are directly accessing the struct fields, you
  51  * are responsible of converting arcs to curves before passing them
  52  * to cairo. In other words, do not directly feed #CpmlPath struct to
  53  * cairo (throught cairo_append_path() for example) or at least do not
  54  * expect it will work.
  55  *
  56  * The conversion is provided by two APIs: cpml_arc_to_cairo() and
  57  * cpml_arc_to_curves(). The former directly renders to a cairo context
  58  * and is internally used by all the ..._to_cairo() functions when an
  59  * arc is met. The latter provided a more powerful (and more complex)
  60  * approach as it allows to specify the number of curves to use and do
  61  * not need a cairo context.
  62  **/
  63
  64
  65 #include "cpml-arc.h"
  66 #include "cpml-pair.h"
  67
  68 #include <stdlib.h>
  69 #include <math.h>
  70
  71
  72 /* Hardcoded max angle of the arc to be approximated by a Bézier curve:
  73  * this influence the arc quality (the default value is got from cairo) */
  74 #define ARC_MAX_ANGLE   M_PI_2
  75
  76
  77 static cairo_bool_t     get_center      (const CpmlPair *p,
  78                                          CpmlPair       *dest);
  79 static void             get_angles      (const CpmlPair *p,
  80                                          const CpmlPair *center,
  81                                          double         *start,
  82                                          double         *end);
  83 static void             arc_to_curve    (CpmlPrimitive  *curve,
  84                                          const CpmlPair *center,
  85                                          double          r,
  86                                          double          start,
  87                                          double          end);
  88
  89
  90 /**
  91  * cpml_arc_type_get_npoints:
  92  *
  93  * Returns the number of point needed to properly specify an arc primitive.
  94  *
  95  * Return value: 3
  96  **/
  97 int
  98 cpml_arc_type_get_npoints(void)
  99 {
 100     return 3;
 101 }
 102
 103 /**
 104  * cpml_arc_info:
 105  * @arc:    the #CpmlPrimitive arc data
 106  * @center: where to store the center coordinates (can be %NULL)
 107  * @r:      where to store the radius (can be %NULL)
 108  * @start:  where to store the starting angle (can be %NULL)
 109  * @end:    where to store the ending angle (can be %NULL)
 110  *
 111  * Given an @arc, this function calculates and returns its basic data.
 112  * Any pointer can be %NULL, in which case the requested info is not
 113  * returned. This function can fail (when the three points lay on a
 114  * straight line, for example) in which case 0 is returned and no
 115  * data can be considered valid.
 116  *
 117  * The radius @r can be 0 when the three points are coincidents: a
 118  * circle with radius 0 is considered a valid path.
 119  *
 120  * When the start and end angle are returned, together with their
 121  * values these angles implicitely gives another important information:
 122  * the arc direction.
 123  *
 124  * If @start < @end the arc must be rendered with increasing angle
 125  * value (clockwise direction using the ordinary cairo coordinate
 126  * system) while if @start > @end the arc must be rendered in reverse
 127  * order (that is counterclockwise in the cairo world). This is the
 128  * reason the angle values are returned in the range
 129  * { -M_PI < value < 3*M_PI } inclusive instead of the usual
 130  * { -M_PI < value < M_PI } range.
 131  *
 132  * Return value: 1 if the function worked succesfully, 0 on errors
 133  **/
 134 cairo_bool_t
 135 cpml_arc_info(const CpmlPrimitive *arc, CpmlPair *center,
 136               double *r, double *start, double *end)
 137 {
 138     CpmlPair p[3], l_center;
 139
 140     cpml_pair_from_cairo(&p[0], arc->org);
 141     cpml_pair_from_cairo(&p[1], &arc->data[1]);
 142     cpml_pair_from_cairo(&p[2], &arc->data[2]);
 143
 144     if (!get_center(p, &l_center))
 145         return 0;
 146
 147     if (center)
 148         *center = l_center;
 149
 150     if (r != NULL)
 151         *r = cpml_pair_distance(&p[0], &l_center);
 152
 153     if (start != NULL || end != NULL) {
 154         double l_start, l_end;
 155
 156         get_angles(p, &l_center, &l_start, &l_end);
 157
 158         if (start != NULL)
 159             *start = l_start;
 160         if (end != NULL)
 161             *end = l_end;
 162     }
 163
 164     return 1;
 165 }
 166
 167 /**
 168  * cpml_arc_length:
 169  * @arc:  the #CpmlPrimitive arc data
 170  *
 171  * Given the @arc primitive, returns its length.
 172  *
 173  * Return value: the requested length or 0 on errors
 174  **/
 175 double
 176 cpml_arc_length(const CpmlPrimitive *arc)
 177 {
 178     double r, start, end, delta;
 179
 180     if (!cpml_arc_info(arc, NULL, &r, &start, &end) || start == end)
 181         return 0.;
 182
 183     delta = end - start;
 184     if (delta < 0)
 185         delta += M_PI*2;
 186
 187     return r*delta;
 188 }
 189
 190 /**
 191  * cpml_arc_pair_at:
 192  * @arc:  the #CpmlPrimitive arc data
 193  * @pair: the destination #CpmlPair
 194  * @pos:  the position value
 195  *
 196  * Given an @arc, finds the coordinates at position @pos (where 0 is
 197  * the start and 1 is the end) and stores the result in @pair.
 198  *
 199  * @pos can also be outside the 0..1 limit, as interpolating on an
 200  * arc is quite trivial.
 201  **/
 202 void
 203 cpml_arc_pair_at(const CpmlPrimitive *arc, CpmlPair *pair, double pos)
 204 {
 205     if (pos == 0.) {
 206         cpml_pair_from_cairo(pair, arc->org);
 207     } else if (pos == 1.) {
 208         cpml_pair_from_cairo(pair, &arc->data[2]);
 209     } else {
 210         CpmlPair center;
 211         double r, start, end, angle;
 212
 213         if (!cpml_arc_info(arc, &center, &r, &start, &end))
 214             return;
 215
 216         angle = (end-start)*pos + start;
 217         cpml_vector_from_angle(pair, angle);
 218         cpml_vector_set_length(pair, r);
 219         cpml_pair_add(pair, &center);
 220     }
 221 }
 222
 223 /**
 224  * cpml_arc_vector_at:
 225  * @arc:    the #CpmlPrimitive arc data
 226  * @vector: the destination vector
 227  * @pos:    the position value
 228  *
 229  * Given an @arc, finds the slope at position @pos (where 0 is
 230  * the start and 1 is the end) and stores the result in @vector.
 231  *
 232  * @pos can also be outside the 0..1 limit, as interpolating on an
 233  * arc is quite trivial.
 234  **/
 235 void
 236 cpml_arc_vector_at(const CpmlPrimitive *arc, CpmlVector *vector, double pos)
 237 {
 238     double start, end, angle;
 239
 240     if (!cpml_arc_info(arc, NULL, NULL, &start, &end))
 241         return;
 242
 243     angle = (end-start)*pos + start;
 244     cpml_vector_from_angle(vector, angle);
 245     cpml_vector_normal(vector);
 246
 247     if (start > end)
 248         cpml_pair_negate(vector);
 249 }
 250
 251 /**
 252  * cpml_arc_near_pos:
 253  * @arc: the #CpmlPrimitive arc data
 254  * @pair: the coordinates of the subject point
 255  *
 256  * Returns the pos value of the point on @arc nearest to @pair.
 257  * The returned value is always between 0 and 1.
 258  *
 259  * <important>
 260  * <title>TODO</title>
 261  * <itemizedlist>
 262  * <listitem>To be implemented...</listitem>
 263  * </itemizedlist>
 264  * </important>
 265  *
 266  * Return value: the pos value, always between 0 and 1
 267  **/
 268 double
 269 cpml_arc_near_pos(const CpmlPrimitive *arc, const CpmlPair *pair)
 270 {
 271     /* TODO */
 272
 273     return 0;
 274 }
 275
 276 /**
 277  * cpml_arc_intersection:
 278  * @arc:  the first arc
 279  * @arc2: the second arc
 280  * @dest: a vector of #CpmlPair
 281  * @max:  maximum number of intersections to return
 282  *        (that is, the size of @dest)
 283  *
 284  * Given two arcs (@arc and @arc2), gets their intersection points
 285  * and store the result in @dest. Keep in mind two arcs can have
 286  * up to 2 intersections.
 287  *
 288  * If @max is 0, the function returns 0 immediately without any
 289  * further processing. If @arc and @arc2 are cohincident (same
 290  * center and same radius), their intersections are not considered.
 291  *
 292  * <important>
 293  * <title>TODO</title>
 294  * <itemizedlist>
 295  * <listitem>To be implemented...</listitem>
 296  * </itemizedlist>
 297  * </important>
 298  *
 299  * Return value: the number of intersections found (max 2)
 300  *               or 0 if the primitives do not intersect
 301  **/
 302 int
 303 cpml_arc_intersection(const CpmlPrimitive *arc, const CpmlPrimitive *arc2,
 304                       CpmlPair *dest, int max)
 305 {
 306     return 0;
 307 }
 308
 309 /**
 310  * cpml_arc_intersection_with_line:
 311  * @arc:  an arc
 312  * @line: a line
 313  * @dest: a vector of #CpmlPair
 314  * @max:  maximum number of intersections to return
 315  *        (that is, the size of @dest)
 316  *
 317  * Given an @arc and a @line, gets their intersection points
 318  * and store the result in @dest. Keep in mind an arc and a
 319  * line can have up to 2 intersections.
 320  *
 321  * If @max is 0, the function returns 0 immediately without any
 322  * further processing.
 323  *
 324  * <important>
 325  * <title>TODO</title>
 326  * <itemizedlist>
 327  * <listitem>To be implemented...</listitem>
 328  * </itemizedlist>
 329  * </important>
 330  *
 331  * Return value: the number of intersections found (max 2)
 332  *               or 0 if the primitives do not intersect
 333  **/
 334 int
 335 cpml_arc_intersection_with_line(const CpmlPrimitive *arc,
 336                                 const CpmlPrimitive *line,
 337                                 CpmlPair *dest, int max)
 338 {
 339     return 0;
 340 }
 341
 342 /**
 343  * cpml_arc_offset:
 344  * @arc:    the #CpmlPrimitive arc data
 345  * @offset: distance for the computed parallel arc
 346  *
 347  * Given an @arc, this function computes the parallel arc at
 348  * distance @offset. The three points needed to build the
 349  * new arc are returned in the @arc data (substituting the
 350  * previous ones.
 351  **/
 352 void
 353 cpml_arc_offset(CpmlPrimitive *arc, double offset)
 354 {
 355     CpmlPair p[3], center;
 356     double r;
 357
 358     cpml_pair_from_cairo(&p[0], arc->org);
 359     cpml_pair_from_cairo(&p[1], &arc->data[1]);
 360     cpml_pair_from_cairo(&p[2], &arc->data[2]);
 361
 362     if (!get_center(p, &center))
 363         return;
 364
 365     r = cpml_pair_distance(&p[0], &center) + offset;
 366
 367     /* Offset the three points by calculating their vector from the center,
 368      * setting the new radius as length and readding the center */
 369     cpml_pair_sub(&p[0], &center);
 370     cpml_pair_sub(&p[1], &center);
 371     cpml_pair_sub(&p[2], &center);
 372
 373     cpml_vector_set_length(&p[0], r);
 374     cpml_vector_set_length(&p[1], r);
 375     cpml_vector_set_length(&p[2], r);
 376
 377     cpml_pair_add(&p[0], &center);
 378     cpml_pair_add(&p[1], &center);
 379     cpml_pair_add(&p[2], &center);
 380
 381     cpml_pair_to_cairo(&p[0], arc->org);
 382     cpml_pair_to_cairo(&p[1], &arc->data[1]);
 383     cpml_pair_to_cairo(&p[2], &arc->data[2]);
 384 }
 385
 386 /**
 387  * cpml_arc_to_cairo:
 388  * @arc: the #CpmlPrimitive arc data
 389  * @cr:  the destination cairo context
 390  *
 391  * Renders @arc to the @cr cairo context. As cairo does not support
 392  * arcs natively, it is approximated using one or more Bézier curves.
 393  *
 394  * The number of curves used is dependent from the angle of the arc.
 395  * Anyway, this function uses internally the hardcoded %M_PI_2 value
 396  * as threshold value. This means the maximum arc approximated by a
 397  * single curve will be a quarter of a circle and, consequently, a
 398  * whole circle will be approximated by 4 Bézier curves.
 399  **/
 400 void
 401 cpml_arc_to_cairo(const CpmlPrimitive *arc, cairo_t *cr)
 402 {
 403     CpmlPair center;
 404     double r, start, end;
 405     int n_curves;
 406     double step, angle;
 407     CpmlPrimitive curve;
 408     cairo_path_data_t data[4];
 409
 410     if (!cpml_arc_info(arc, &center, &r, &start, &end))
 411         return;
 412
 413     n_curves = ceil(fabs(end-start) / ARC_MAX_ANGLE);
 414     step = (end-start) / (double) n_curves;
 415     curve.data = data;
 416
 417     for (angle = start; n_curves--; angle += step) {
 418         arc_to_curve(&curve, &center, r, angle, angle+step);
 419         cairo_curve_to(cr,
 420                        curve.data[1].point.x, curve.data[1].point.y,
 421                        curve.data[2].point.x, curve.data[2].point.y,
 422                        curve.data[3].point.x, curve.data[3].point.y);
 423     }
 424 }
 425
 426 /**
 427  * cpml_arc_to_curves:
 428  * @arc:      the #CpmlPrimitive arc data
 429  * @segment:  the destination #CpmlSegment
 430  * @n_curves: number of Bézier to use
 431  *
 432  * Converts @arc to a serie of @n_curves Bézier curves and puts them
 433  * inside @segment. Obviously, @segment must have enough space to
 434  * contain at least @n_curves curves.
 435  *
 436  * This function works in a similar way as cpml_arc_to_cairo() but
 437  * has two important differences: it does not need a cairo context
 438  * and the number of curves to be generated is explicitely defined.
 439  * The latter difference allows a more specific error control from
 440  * the application: in the file src/cairo-arc.c, found in the cairo
 441  * tarball (at least in cairo-1.9.1), there is a table showing the
 442  * magnitude of error of this curve approximation algorithm.
 443  **/
 444 void
 445 cpml_arc_to_curves(const CpmlPrimitive *arc, CpmlSegment *segment,
 446                    int n_curves)
 447 {
 448     CpmlPair center;
 449     double r, start, end;
 450     double step, angle;
 451     CpmlPrimitive curve;
 452
 453     if (!cpml_arc_info(arc, &center, &r, &start, &end))
 454         return;
 455
 456     step = (end-start) / (double) n_curves;
 457     segment->num_data = n_curves*4;
 458     curve.segment = segment;
 459     curve.data = segment->data;
 460
 461     for (angle = start; n_curves--; angle += step) {
 462         arc_to_curve(&curve, &center, r, angle, angle+step);
 463         curve.data += 4;
 464     }
 465 }
 466
 467
 468 static cairo_bool_t
 469 get_center(const CpmlPair *p, CpmlPair *dest)
 470 {
 471     CpmlPair b, c;
 472     double d, b2, c2;
 473
 474     /* When p[0] == p[2], p[0]..p[1] is considered the diameter of a circle */
 475     if (p[0].x == p[2].x && p[0].y == p[2].y) {
 476         dest->x = (p[0].x + p[1].x) / 2;
 477         dest->y = (p[0].y + p[1].y) / 2;
 478         return 1;
 479     }
 480
 481     /* Translate the 3 points of -p0, to simplify the formula */
 482     cpml_pair_sub(cpml_pair_copy(&b, &p[1]), &p[0]);
 483     cpml_pair_sub(cpml_pair_copy(&c, &p[2]), &p[0]);
 484
 485     /* Check for division by 0, that is the case where the 3 given points
 486      * are laying on a straight line and there is no fitting circle */
 487     d = (b.x*c.y - b.y*c.x) * 2;
 488     if (d == 0.)
 489         return 0;
 490
 491     b2 = b.x*b.x + b.y*b.y;
 492     c2 = c.x*c.x + c.y*c.y;
 493
 494     dest->x = (c.y*b2 - b.y*c2) / d + p[0].x;
 495     dest->y = (b.x*c2 - c.x*b2) / d + p[0].y;
 496
 497     return 1;
 498 }
 499
 500 static void
 501 get_angles(const CpmlPair *p, const CpmlPair *center,
 502            double *start, double *end)
 503 {
 504     CpmlVector vector;
 505     double mid;
 506
 507     /* Calculate the starting angle */
 508     cpml_pair_sub(cpml_pair_copy(&vector, &p[0]), center);
 509     *start = cpml_vector_angle(&vector);
 510
 511     if (p[0].x == p[2].x && p[0].y == p[2].y) {
 512         /* When p[0] and p[2] are cohincidents, p[0]..p[1] is the diameter
 513          * of a circle: return by convention start=start end=start+2PI */
 514         *end = *start + M_PI*2;
 515     } else {
 516         /* Calculate the mid and end angle */
 517         cpml_pair_sub(cpml_pair_copy(&vector, &p[1]), center);
 518         mid = cpml_vector_angle(&vector);
 519         cpml_pair_sub(cpml_pair_copy(&vector, &p[2]), center);
 520         *end = cpml_vector_angle(&vector);
 521
 522         if (*end > *start) {
 523             if (mid > *end || mid < *start)
 524                 *start += M_PI*2;
 525         } else {
 526             if (mid < *end || mid > *start)
 527                 *end += M_PI*2;
 528         }
 529     }
 530 }
 531
 532 static void
 533 arc_to_curve(CpmlPrimitive *curve, const CpmlPair *center,
 534              double r, double start, double end)
 535 {
 536     double r_sin1, r_cos1;
 537     double r_sin2, r_cos2;
 538     double h;
 539
 540     r_sin1 = r*sin(start);
 541     r_cos1 = r*cos(start);
 542     r_sin2 = r*sin(end);
 543     r_cos2 = r*cos(end);
 544
 545     h = 4./3. * tan((end-start) / 4.);
 546
 547     curve->data[0].header.type = CAIRO_PATH_CURVE_TO;
 548     curve->data[0].header.length = 4;
 549     curve->data[1].point.x = center->x + r_cos1 - h*r_sin1;
 550     curve->data[1].point.y = center->y + r_sin1 + h*r_cos1;
 551     curve->data[2].point.x = center->x + r_cos2 + h*r_sin2;
 552     curve->data[2].point.y = center->y + r_sin2 - h*r_cos2;
 553     curve->data[3].point.x = center->x + r_cos2;
 554     curve->data[3].point.y = center->y + r_sin2;
 555 }