2 Copyright (C) 2013 Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program 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
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 #include "canvas/framed_curve.h"
26 using namespace ArdourCanvas;
30 FramedCurve::FramedCurve (Canvas* c)
33 , points_per_segment (16)
38 FramedCurve::FramedCurve (Item* parent)
41 , points_per_segment (16)
46 /** When rendering the curve, we will always draw a fixed number of straight
47 * line segments to span the x-axis extent of the curve. More segments:
48 * smoother visual rendering. Less rendering: closer to a visibily poly-line
52 FramedCurve::set_points_per_segment (uint32_t n)
54 /* this only changes our appearance rather than the bounding box, so we
55 just need to schedule a redraw rather than notify the parent of any
58 points_per_segment = n;
64 FramedCurve::compute_bounding_box () const
66 PolyItem::compute_bounding_box ();
68 /* possibly add extents of any point indicators here if we ever do that */
72 FramedCurve::set (Points const& p)
79 FramedCurve::interpolate ()
81 Points curve_points = _points;
83 if (curve_points.size()) {
84 curve_points.erase (curve_points.begin());
88 InterpolatedCurve::interpolate (curve_points, points_per_segment, CatmullRomCentripetal, false, samples);
89 n_samples = samples.size();
93 FramedCurve::render (Rect const & area, Cairo::RefPtr<Cairo::Context> context) const
95 if (!_outline || _points.size() < 3 || !_bounding_box) {
99 Rect self = item_to_window (_bounding_box.get());
100 boost::optional<Rect> d = self.intersection (area);
102 Rect draw = d.get ();
104 /* Our approach is to always draw n_segments across our total size.
106 * This is very inefficient if we are asked to only draw a small
107 * section of the curve. For now we rely on cairo clipping to help
112 setup_outline_context (context);
114 if (_points.size() == 3) {
119 Points::const_iterator it = _points.begin();
120 window_space = item_to_window (*it);
121 context->move_to (window_space.x, window_space.y);
123 window_space = item_to_window (*it);
124 context->line_to (window_space.x, window_space.y);
125 window_space = item_to_window (_points.back());
126 context->line_to (window_space.x, window_space.y);
128 switch (curve_fill) {
133 context->stroke_preserve ();
134 window_space = item_to_window (Duple(_points.back().x, draw.height()));
135 context->line_to (window_space.x, window_space.y);
136 window_space = item_to_window (Duple(_points.back().x, draw.height()));
137 context->line_to (window_space.x, window_space.y);
138 context->close_path();
139 setup_fill_context(context);
143 context->stroke_preserve ();
144 window_space = item_to_window (Duple(_points.back().x, 0.0));
145 context->line_to (window_space.x, window_space.y);
146 window_space = item_to_window (Duple(_points.front().x, 0.0));
147 context->line_to (window_space.x, window_space.y);
148 context->close_path();
149 setup_fill_context(context);
156 /* curve of at least 3 points */
158 /* x-axis limits of the curve, in window space coordinates */
160 Duple w1 = item_to_window (Duple (_points.front().x, 0.0));
161 Duple w2 = item_to_window (Duple (_points.back().x, 0.0));
163 /* clamp actual draw to area bound by points, rather than our bounding box which is slightly different */
166 context->rectangle (draw.x0, draw.y0, draw.width(), draw.height());
169 /* expand drawing area by several pixels on each side to avoid cairo stroking effects at the boundary.
170 they will still occur, but cairo's clipping will hide them.
173 draw = draw.expand (4.0);
175 /* now clip it to the actual points in the curve */
177 if (draw.x0 < w1.x) {
181 if (draw.x1 >= w2.x) {
185 /* find left and right-most sample */
187 Points::size_type left = 0;
188 Points::size_type right = n_samples;
190 for (Points::size_type idx = 0; idx < n_samples; ++idx) {
191 window_space = item_to_window (Duple (samples[idx].x, 0.0));
192 if (window_space.x >= draw.x0) break;
196 for (Points::size_type idx = n_samples; idx > left + 2; --idx) {
197 window_space = item_to_window (Duple (samples[idx].x, 0.0));
198 if (window_space.x <= draw.x1) break;
202 window_space = item_to_window (*_points.begin());
203 context->move_to (window_space.x, window_space.y);
204 /* draw line between samples */
205 window_space = item_to_window (Duple (samples[left].x, samples[left].y));
206 context->line_to (window_space.x, window_space.y);
208 for (uint32_t idx = left; idx < right; ++idx) {
209 window_space = item_to_window (Duple (samples[idx].x, samples[idx].y), false);
210 context->line_to (window_space.x, window_space.y);
213 switch (curve_fill) {
218 context->stroke_preserve ();
219 window_space = item_to_window (Duple (samples[right-1].x, draw.height()));
220 context->line_to (window_space.x, window_space.y);
221 window_space = item_to_window (Duple (samples[left].x, draw.height()));
222 context->line_to (window_space.x, window_space.y);
223 context->close_path();
224 setup_fill_context(context);
228 context->stroke_preserve ();
229 window_space = item_to_window (Duple (samples[right-1].x, 0.0));
230 context->line_to (window_space.x, window_space.y);
231 window_space = item_to_window (Duple (samples[left].x, 0.0));
232 context->line_to (window_space.x, window_space.y);
233 context->close_path();
234 setup_fill_context(context);
243 setup_outline_context (context);
244 for (Points::const_iterator p = _points.begin(); p != _points.end(); ++p) {
245 Duple window_space (item_to_window (*p));
246 context->arc (window_space.x, window_space.y, 5.0, 0.0, 2 * M_PI);
253 FramedCurve::covers (Duple const & pc) const
255 Duple point = window_to_item (pc);
257 /* O(N) N = number of points, and not accurate */
259 for (Points::const_iterator p = _points.begin(); p != _points.end(); ++p) {
261 const Coord dx = point.x - (*p).x;
262 const Coord dy = point.y - (*p).y;
263 const Coord dx2 = dx * dx;
264 const Coord dy2 = dy * dy;
266 if ((dx2 < 2.0 && dy2 < 2.0) || (dx2 + dy2 < 4.0)) {