2 Copyright (C) 2011-2013 Paul Davis
3 Author: Carl Hetherington <cth@carlh.net>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 #include "canvas/polygon.h"
22 using namespace ArdourCanvas;
24 Polygon::Polygon (Canvas* c)
32 Polygon::Polygon (Item* parent)
47 Polygon::render (Rect const & area, Cairo::RefPtr<Cairo::Context> context) const
49 if (_outline || _fill) {
50 render_path (area, context);
52 if (!_points.empty ()) {
54 Duple p = item_to_window (Duple (_points.front().x, _points.front().y));
55 context->line_to (p.x, p.y);
61 setup_outline_context (context);
63 context->stroke_preserve ();
70 setup_fill_context (context);
76 Polygon::cache_shape_computation () const
78 Points::size_type npoints = _points.size();
85 Points::size_type j = npoints -1;
87 if (cached_size < npoints) {
88 cached_size = npoints;
90 multiple = new float[cached_size];
92 constant = new float[cached_size];
95 for (i = 0; i < npoints; i++) {
96 if (_points[j].y == _points[i].y) {
97 constant[i] = _points[i].x;
100 constant[i] = _points[i].x-(_points[i].y*_points[j].x)/(_points[j].y-_points[i].y)+(_points[i].y*_points[i].x)/(_points[j].y-_points[i].y);
101 multiple[i] = (_points[j].x-_points[i].x)/(_points[j].y-_points[i].y);
109 Polygon::covers (Duple const & point) const
111 Duple p = window_to_item (point);
113 Points::size_type npoints = _points.size();
120 Points::size_type j = npoints -1;
121 bool oddNodes = false;
123 if (_bounding_box_dirty) {
124 compute_bounding_box ();
127 for (i = 0; i < npoints; i++) {
128 if (((_points[i].y < p.y && _points[j].y >= p.y) || (_points[j].y < p.y && _points[i].y >= p.y))) {
129 oddNodes ^= (p.y * multiple[i] + constant[i] < p.x);
138 Polygon::compute_bounding_box () const
140 PolyItem::compute_bounding_box ();
141 cache_shape_computation ();