X-Git-Url: https://main.carlh.net/gitweb/?a=blobdiff_plain;f=libs%2Fcanvas%2Fpolygon.cc;h=2e818236160d77335aec155aae1245d3de4a2a6c;hb=c29d392b0ca534b29f3436dc10004cc807bd0eee;hp=43d7c60cf4c2013bdede7e376f8cf340eaf00cac;hpb=e2f0c5f91e2579c41d8efc9495b6ebac31a61ba3;p=ardour.git diff --git a/libs/canvas/polygon.cc b/libs/canvas/polygon.cc index 43d7c60cf4..2e81823616 100644 --- a/libs/canvas/polygon.cc +++ b/libs/canvas/polygon.cc @@ -25,10 +25,19 @@ Polygon::Polygon (Group* parent) : Item (parent) , PolyItem (parent) , Fill (parent) + , multiple (0) + , constant (0) + , cached_size (0) { } +Polygon::~Polygon () +{ + delete [] multiple; + delete [] constant; +} + void Polygon::render (Rect const & area, Cairo::RefPtr context) const { @@ -37,7 +46,9 @@ Polygon::render (Rect const & area, Cairo::RefPtr context) const render_path (area, context); if (!_points.empty ()) { - context->move_to (_points.front().x, _points.front().y); + /* close path */ + Duple p = item_to_window (Duple (_points.front().x, _points.front().y)); + context->move_to (p.x, p.y); } context->stroke_preserve (); @@ -49,3 +60,72 @@ Polygon::render (Rect const & area, Cairo::RefPtr context) const } } +void +Polygon::cache_shape_computation () const +{ + Points::size_type npoints = _points.size(); + + if (npoints == 0) { + return; + } + + Points::size_type i; + Points::size_type j = npoints -1; + + if (cached_size < npoints) { + cached_size = npoints; + delete [] multiple; + multiple = new float[cached_size]; + delete [] constant; + constant = new float[cached_size]; + } + + for (i = 0; i < npoints; i++) { + if (_points[j].y == _points[i].y) { + constant[i] = _points[i].x; + multiple[i] = 0; + } else { + 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); + multiple[i] = (_points[j].x-_points[i].x)/(_points[j].y-_points[i].y); + } + + j = i; + } +} + +bool +Polygon::covers (Duple const & point) const +{ + Duple p = canvas_to_item (point); + + Points::size_type npoints = _points.size(); + + if (npoints == 0) { + return false; + } + + Points::size_type i; + Points::size_type j = npoints -1; + bool oddNodes = false; + + if (_bounding_box_dirty) { + compute_bounding_box (); + } + + for (i = 0; i < npoints; i++) { + if (((_points[i].y < p.y && _points[j].y >= p.y) || (_points[j].y < p.y && _points[i].y >= p.y))) { + oddNodes ^= (p.y * multiple[i] + constant[i] < p.x); + } + j = i; + } + + return oddNodes; +} + +void +Polygon::compute_bounding_box () const +{ + PolyItem::compute_bounding_box (); + cache_shape_computation (); +} +