X-Git-Url: https://git.pterodactylus.net/?a=blobdiff_plain;f=synfig-core%2Ftrunk%2Fsrc%2Fmodules%2Fmod_gradient%2Fcurvegradient.cpp;h=9f2c42ab67649ed2d5e458d6b513e21d8ba544ed;hb=b5318fd86e61cb9065346a5b959809636ffe5dce;hp=d76d76d19d84f67a605d63f7ec728527799ed6e1;hpb=2f2b6c3d445e2e7850334a90b2ac3d3e57bec0f0;p=synfig.git diff --git a/synfig-core/trunk/src/modules/mod_gradient/curvegradient.cpp b/synfig-core/trunk/src/modules/mod_gradient/curvegradient.cpp index d76d76d..9f2c42a 100644 --- a/synfig-core/trunk/src/modules/mod_gradient/curvegradient.cpp +++ b/synfig-core/trunk/src/modules/mod_gradient/curvegradient.cpp @@ -72,7 +72,7 @@ inline float calculate_distance(const synfig::BLinePoint& a,const synfig::BLineP #endif } -inline float calculate_distance(const std::vector& bline) +inline float calculate_distance(const std::vector& bline, bool bline_loop) { std::vector::const_iterator iter,next,ret; std::vector::const_iterator end(bline.end()); @@ -83,10 +83,10 @@ inline float calculate_distance(const std::vector& bline) next=bline.begin(); - //if(loop) - // iter=--bline.end(); - //else - iter=next++; + if(bline_loop) + iter=--bline.end(); + else + iter=next++; for(;next!=end;iter=next++) { @@ -197,7 +197,7 @@ find_closest(bool fast, const std::vector& bline,const Point inline void CurveGradient::sync() { - curve_length_=calculate_distance(bline); + curve_length_=calculate_distance(bline, bline_loop); } @@ -237,6 +237,7 @@ CurveGradient::color_func(const Point &point_, int quality, float supersample)co Real dist; float perp_dist; + bool edge_case = false; if(bline.size()==0) return Color::alpha(); @@ -306,6 +307,31 @@ CurveGradient::color_func(const Point &point_, int quality, float supersample)co p1=curve(t); // the closest point on the curve tangent=deriv(t).norm(); // the unit tangent at that point + // if the point we're nearest to is at either end of the + // bline, our distance from the curve is the distance from the + // point on the curve. we need to know which side of the + // curve we're on, so find the average of the two tangents at + // this point + if (t<0.00001 || t>0.99999) + { + if (t<0.5) + { + if (iter->get_split_tangent_flag()) + { + tangent=(iter->get_tangent1().norm()+tangent).norm(); + edge_case=true; + } + } + else + { + if (next->get_split_tangent_flag()) + { + tangent=(next->get_tangent2().norm()+tangent).norm(); + edge_case=true; + } + } + } + if(perpendicular) { tangent*=curve_length_; @@ -340,7 +366,15 @@ CurveGradient::color_func(const Point &point_, int quality, float supersample)co } else // not perpendicular { - diff=tangent.perp()*thickness*width; + if (edge_case) + { + diff=(p1-(point_-offset)); + if(diff*tangent.perp()<0) diff=-diff; + diff=diff.norm()*thickness*width; + } + else + diff=tangent.perp()*thickness*width; + p1-=diff*0.5; const Real mag(diff.inv_mag()); supersample=supersample*mag;