#include <cmath>
#include <cctype>
+using namespace std;
#include "line-interface.hh"
#include "warn.hh"
#include "main.hh"
#include "lily-guile.hh"
-using std::vector;
-
Stencil
Lookup::beam (Real slope, Real width, Real thick, Real blot)
{
scm_cons (scm_from_double (p[Y_AXIS]),
points));
- SCM expr = scm_list_n (ly_symbol2scm ("polygon"),
+ SCM expr = scm_list_4 (ly_symbol2scm ("polygon"),
ly_quote_scm (points),
scm_from_double (blot),
- SCM_BOOL_T,
- SCM_UNDEFINED);
+ SCM_BOOL_T);
return Stencil (b, expr);
}
Lookup::round_filled_box (Box b, Real blotdiameter)
{
Real width = b.x ().delta ();
- blotdiameter = std::min (blotdiameter, width);
+ blotdiameter = min (blotdiameter, width);
Real height = b.y ().delta ();
- blotdiameter = std::min (blotdiameter, height);
+ blotdiameter = min (blotdiameter, height);
if (blotdiameter < 0.0)
{
* blotdiameter along all edges of the polygon (which is what the
* postscript routine in the backend effectively does, but on the
* shrinked polygon). --jr
+ *
+ * An extra parameter "extroversion" has been added since staying just
+ * inside of a polygon will reduce its visual size when tracing a
+ * rounded path. If extroversion is zero, the polygon is just traced
+ * as-is. If it is -1 (the default) the drawing will stay just within
+ * the given polygon. If it is 1, the traced line will stay just
+ * outside of the given polygon.
*/
Stencil
Lookup::round_filled_polygon (vector<Offset> const &points,
- Real blotdiameter)
+ Real blotdiameter,
+ Real extroversion)
{
/* TODO: Maybe print a warning if one of the above limitations
applies to the given polygon. However, this is quite complicated
to check. */
+#ifdef DEBUG
const Real epsilon = 0.01;
-#ifdef DEBUG
/* remove consecutive duplicate points */
for (vsize i = 0; i < points.size (); i++)
{
return Stencil ();
if (points.size () == 1)
{
- Stencil circ = circle (0.5 * blotdiameter, 0, true);
+ Stencil circ = circle (0.5 * (1.0 + extroversion) * blotdiameter, 0, true);
circ.translate (points[0]);
return circ;
}
if (points.size () == 2)
- return Line_interface::make_line (blotdiameter, points[0], points[1]);
-
- /* shrink polygon in size by 0.5 * blotdiameter */
-
- // first we need to determine the orientation of the polygon in
- // order to decide whether shrinking means moving the polygon to the
- // left or to the right of the outline. We do that by calculating
- // (double) the oriented area of the polygon. We first determine the
- // center and do the area calculations relative to it.
- // Mathematically, the result is not affected by this shift, but
- // numerically a lot of cancellation is going on and this keeps its
- // effects in check.
+ return Line_interface::make_line ((1.0 + extroversion) * blotdiameter, points[0], points[1]);
- Offset center;
- for (vsize i = 0; i < points.size (); i++)
- center += points[i];
- center /= points.size ();
-
- Real area = 0.0;
- Offset last = points.back () - center;
+ vector<Offset> shrunk_points;
- for (vsize i = 0; i < points.size (); i++)
+ if (extroversion == 0.0)
{
- Offset here = points[i] - center;
- area += cross_product (last, here);
- last = here;
+ shrunk_points = points;
}
-
- bool ccw = area >= 0.0; // true if whole shape is counterclockwise oriented
-
- vector<Offset> shrunk_points;
- shrunk_points.resize (points.size ());
-
- for (vsize i = 0; i < points.size (); i++)
+ else
{
- int i0 = i;
- int i1 = (i + 1) % points.size ();
- int i2 = (i + 2) % points.size ();
- Offset p0 = points[i0];
- Offset p1 = points[i1];
- Offset p2 = points[i2];
- Offset p01 = p1 - p0;
- Offset p12 = p2 - p1;
- Offset inward0 = Offset(-p01[Y_AXIS], p01[X_AXIS]).direction ();
- Offset inward2 = Offset(-p12[Y_AXIS], p12[X_AXIS]).direction ();
-
- if (!ccw)
+ /* shrink polygon in size by 0.5 * blotdiameter */
+
+ // first we need to determine the orientation of the polygon in
+ // order to decide whether shrinking means moving the polygon to the
+ // left or to the right of the outline. We do that by calculating
+ // (double) the oriented area of the polygon. We first determine the
+ // center and do the area calculations relative to it.
+ // Mathematically, the result is not affected by this shift, but
+ // numerically a lot of cancellation is going on and this keeps its
+ // effects in check.
+
+ Offset center;
+ for (vsize i = 0; i < points.size (); i++)
+ center += points[i];
+ center /= points.size ();
+
+ Real area = 0.0;
+ Offset last = points.back () - center;
+
+ for (vsize i = 0; i < points.size (); i++)
{
- inward0 = -inward0;
- inward2 = -inward2;
+ Offset here = points[i] - center;
+ area += cross_product (last, here);
+ last = here;
}
- Offset middle = 0.5*(inward0 + inward2);
-
- // "middle" now is a vector in the right direction for the
- // shrinkage. Its size needs to be large enough that the
- // projection on either of the inward vectors has a size of 1.
+ bool ccw = area >= 0.0; // true if whole shape is counterclockwise oriented
- Real proj = dot_product (middle, inward0);
+ shrunk_points.resize (points.size ());
- // What's the size of proj? Assuming that we have a corner
- // angle of phi where 0 corresponds to a continuing line, the
- // length of middle is 0.5 |(1+cos phi, sin phi)| = cos (phi/2),
- // so its projection has length
- // cos^2 (phi/2) = 0.5 + 0.5 cos (phi).
- // We don't really want to move inwards more than 3 blob
- // diameters corresponding to 6 blob radii. So
- // cos (phi/2) = 1/6 gives phi ~ 161, meaning that a 20 degree
- // corner necessitates moving 3 blob diameters from the corner
- // in order to stay inside the lines. Ruler and circle agree.
- // 0.03 is close enough to 1/36. Basically we want to keep the
- // shape from inverting from pulling too far inward.
- // 3 diameters is pretty much a handwaving guess.
-
- if (abs (proj) < 0.03)
- proj = proj < 0 ? -0.03 : 0.03;
+ for (vsize i = 0; i < points.size (); i++)
+ {
+ int i0 = i;
+ int i1 = (i + 1) % points.size ();
+ int i2 = (i + 2) % points.size ();
+ Offset p0 = points[i0];
+ Offset p1 = points[i1];
+ Offset p2 = points[i2];
+ Offset p01 = p1 - p0;
+ Offset p12 = p2 - p1;
+ Offset inward0 = Offset(-p01[Y_AXIS], p01[X_AXIS]).direction ();
+ Offset inward2 = Offset(-p12[Y_AXIS], p12[X_AXIS]).direction ();
+
+ if (!ccw)
+ {
+ inward0 = -inward0;
+ inward2 = -inward2;
+ }
- shrunk_points[i1] = p1 + (0.5 * blotdiameter / proj) * middle;
+ Offset middle = 0.5*(inward0 + inward2);
+
+ // "middle" now is a vector in the right direction for the
+ // shrinkage. Its size needs to be large enough that the
+ // projection on either of the inward vectors has a size of 1.
+
+ Real proj = dot_product (middle, inward0);
+
+ // What's the size of proj? Assuming that we have a corner
+ // angle of phi where 0 corresponds to a continuing line, the
+ // length of middle is 0.5 |(1+cos phi, sin phi)| = cos (phi/2),
+ // so its projection has length
+ // cos^2 (phi/2) = 0.5 + 0.5 cos (phi).
+ // We don't really want to move inwards more than 3 blob
+ // diameters corresponding to 6 blob radii. So
+ // cos (phi/2) = 1/6 gives phi ~ 161, meaning that a 20 degree
+ // corner necessitates moving 3 blob diameters from the corner
+ // in order to stay inside the lines. Ruler and circle agree.
+ // 0.03 is close enough to 1/36. Basically we want to keep the
+ // shape from inverting from pulling too far inward.
+ // 3 diameters is pretty much a handwaving guess.
+
+ if (abs (proj) < 0.03)
+ proj = proj < 0 ? -0.03 : 0.03;
+
+ shrunk_points[i1] = p1 - (0.5 * blotdiameter / proj) * middle
+ * extroversion;
+ }
}
/* build scm expression and bounding box */
SCM shrunk_points_scm = SCM_EOL;
Box box;
+ Box shrunk_box;
for (vsize i = 0; i < shrunk_points.size (); i++)
{
SCM x = scm_from_double (shrunk_points[i][X_AXIS]);
SCM y = scm_from_double (shrunk_points[i][Y_AXIS]);
shrunk_points_scm = scm_cons (x, scm_cons (y, shrunk_points_scm));
box.add_point (points[i]);
+ shrunk_box.add_point (shrunk_points[i]);
}
- SCM polygon_scm = scm_list_n (ly_symbol2scm ("polygon"),
+ shrunk_box.widen (0.5*blotdiameter, 0.5*blotdiameter);
+ box.unite (shrunk_box);
+ SCM polygon_scm = scm_list_4 (ly_symbol2scm ("polygon"),
ly_quote_scm (shrunk_points_scm),
scm_from_double (blotdiameter),
- SCM_BOOL_T,
- SCM_UNDEFINED);
+ SCM_BOOL_T);
Stencil polygon = Stencil (box, polygon_scm);
- shrunk_points.clear ();
return polygon;
}
calculate the offset for the two beziers that make the sandwich
for the slur
*/
- Real alpha = (curve.control_[3] - curve.control_[0]).arg ();
+ Offset dir = (curve.control_[3] - curve.control_[0]).direction ();
Bezier back = curve;
- Offset perp = curvethick * complex_exp (Offset (0, alpha + M_PI / 2)) * 0.5;
+ Offset perp = 0.5 * curvethick * Offset (-dir[Y_AXIS], dir[X_AXIS]);
back.control_[1] += perp;
back.control_[2] += perp;
Lookup::repeat_slash (Real w, Real s, Real t)
{
- Real x_width = sqrt ((t * t) + ((t / s) * (t / s)));
+ Real x_width = hypot (t, t/s);
Real height = w * s;
SCM controls = scm_list_n (ly_symbol2scm ("moveto"),
SCM_BOOL_T,
SCM_UNDEFINED);
- Box b (Interval (0, w + sqrt (sqr (t / s) + sqr (t))),
- Interval (0, w * s));
+ Box b (Interval (0, w + x_width),
+ Interval (0, height));
return Stencil (b, slashnodot); // http://slashnodot.org
}
Lookup::bracket (Axis a, Interval iv, Real thick, Real protrude, Real blot)
{
Box b;
- Axis other = Axis ((a + 1) % 2);
+ Axis other = other_axis (a);
b[a] = iv;
b[other] = Interval (-1, 1) * thick * 0.5;
{
Box b;
b[X_AXIS] = Interval (0, iv.length ());
- b[Y_AXIS] = Interval (std::min (0., protrude), std::max (0.0, protrude));
+ b[Y_AXIS] = Interval (min (0., protrude), max (0.0, protrude));
vector<Offset> points;
points.push_back (Offset (iv[LEFT], 0));