-/*! ========================================================================
-** Synfig
-** Template File
-** $Id: curvegradient.cpp,v 1.2 2005/01/13 06:48:39 darco Exp $
+/* === S Y N F I G ========================================================= */
+/*! \file curvegradient.cpp
+** \brief Template Header
**
+** $Id$
+**
+** \legal
** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
**
** This package is free software; you can redistribute it and/or
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
** General Public License for more details.
+** \endlegal
**
** === N O T E S ===========================================================
**
SYNFIG_LAYER_SET_LOCAL_NAME(CurveGradient,_("Curve Gradient"));
SYNFIG_LAYER_SET_CATEGORY(CurveGradient,_("Gradients"));
SYNFIG_LAYER_SET_VERSION(CurveGradient,"0.0");
-SYNFIG_LAYER_SET_CVS_ID(CurveGradient,"$Id: curvegradient.cpp,v 1.2 2005/01/13 06:48:39 darco Exp $");
+SYNFIG_LAYER_SET_CVS_ID(CurveGradient,"$Id$");
/* === P R O C E D U R E S ================================================= */
float dist(0);
+ if (bline.empty()) return dist;
+
next=bline.begin();
//if(loop)
// iter=--bline.end();
//else
- iter=next++;
+ iter=next++;
for(;next!=end;iter=next++)
{
iter->get_vertex(),
next->get_vertex(),
iter->get_tangent2(),
- next->get_tangent1()
- );
+ next->get_tangent1());
// dist+=calculate_distance(*iter,*next);
dist+=curve.length();
iter->get_vertex(),
next->get_vertex(),
iter->get_tangent2(),
- next->get_tangent1()
- );
+ next->get_tangent1());
/*
const float t(curve.find_closest(p,6,0.01,0.99));
inline void
CurveGradient::sync()
{
- diff=(p2-p1);
- const Real mag(diff.inv_mag());
- diff*=mag*mag;
-
curve_length_=calculate_distance(bline);
}
CurveGradient::CurveGradient():
- p1(1,1),
- p2(-1,-1),
offset(0,0),
width(0.25),
gradient(Color::black(), Color::white()),
{
next=find_closest(bline,point,bline_loop);
}
- iter=next++;
- if(next==bline.end()) next=bline.begin();
-
- // Setup the curve
- etl::hermite<Vector> curve(
- iter->get_vertex(),
- next->get_vertex(),
- iter->get_tangent2(),
- next->get_tangent1()
+
+ iter=next++;
+ if(next==bline.end()) next=bline.begin();
+
+ // Setup the curve
+ etl::hermite<Vector> curve(
+ iter->get_vertex(),
+ next->get_vertex(),
+ iter->get_tangent2(),
+ next->get_tangent1()
);
- // Setup the derivative function
- etl::derivative<etl::hermite<Vector> > deriv(curve);
-
- int search_iterations(7);
-
- /*if(quality==0)search_iterations=8;
- else if(quality<=2)search_iterations=10;
- else if(quality<=4)search_iterations=8;
- */
- if(!perpendicular)
- {
- if(quality<=6)search_iterations=7;
- else if(quality<=7)search_iterations=6;
- else if(quality<=8)search_iterations=5;
- else search_iterations=4;
- }
- else
- {
- if(quality>7)
- search_iterations=4;
- }
-
- // Figure out the closest point on the curve
- const float t(curve.find_closest(point,search_iterations));
-
-
- // Calculate our values
- p1=curve(t);
- tangent=deriv(t).norm();
-
- if(perpendicular)
- {
- tangent*=curve_length_;
- p1-=tangent*perp_dist;
- tangent=-tangent.perp();
- }
- else
- {
- thickness=(next->get_width()-iter->get_width())*t+iter->get_width();
- }
+ // Setup the derivative function
+ etl::derivative<etl::hermite<Vector> > deriv(curve);
+
+ int search_iterations(7);
+
+ /*if(quality==0)search_iterations=8;
+ else if(quality<=2)search_iterations=10;
+ else if(quality<=4)search_iterations=8;
+ */
+ if(!perpendicular)
+ {
+ if(quality<=6)search_iterations=7;
+ else if(quality<=7)search_iterations=6;
+ else if(quality<=8)search_iterations=5;
+ else search_iterations=4;
+ }
+ else
+ {
+ if(quality>7)
+ search_iterations=4;
+ }
+
+ // Figure out the closest point on the curve
+ const float t(curve.find_closest(point,search_iterations));
+
+
+ // Calculate our values
+ p1=curve(t);
+ tangent=deriv(t).norm();
+
+ if(perpendicular)
+ {
+ tangent*=curve_length_;
+ p1-=tangent*perp_dist;
+ tangent=-tangent.perp();
+ }
+ else
+ {
+ thickness=(next->get_width()-iter->get_width())*t+iter->get_width();
+ }
//}
}
-
if(!perpendicular)
{
- diff=tangent.perp()*thickness*width;
- p1-=diff*0.5;
- const Real mag(diff.inv_mag());
- supersample=supersample*mag;
- diff*=mag*mag;
- dist=((point_-offset)*diff-p1*diff);
+ diff=tangent.perp()*thickness*width;
+ p1-=diff*0.5;
+ const Real mag(diff.inv_mag());
+ supersample=supersample*mag;
+ diff*=mag*mag;
+ dist=((point_-offset)*diff-p1*diff);
}
else
{
}
else
{
- diff=tangent.perp();
- //p1-=diff*0.5;
- const Real mag(diff.inv_mag());
- supersample=supersample*mag;
- diff*=mag*mag;
- dist=((point_-offset)*diff-p1*diff);
+ diff=tangent.perp();
+ //p1-=diff*0.5;
+ const Real mag(diff.inv_mag());
+ supersample=supersample*mag;
+ diff*=mag*mag;
+ dist=((point_-offset)*diff-p1*diff);
}
}
{
if(dist+supersample*0.5>1.0)
{
- Color pool(gradient(dist,supersample*0.5).premult_alpha()*(1.0-(dist-supersample*0.5)));
- pool+=gradient((dist+supersample*0.5)-1.0,supersample*0.5).premult_alpha()*((dist+supersample*0.5)-1.0);
+ float left(supersample*0.5-(dist-1.0));
+ float right(supersample*0.5+(dist-1.0));
+ Color pool(gradient(1.0-(left*0.5),left).premult_alpha()*left/supersample);
+ if (zigzag) pool+=gradient(1.0-right*0.5,right).premult_alpha()*right/supersample;
+ else pool+=gradient(right*0.5,right).premult_alpha()*right/supersample;
return pool.demult_alpha();
}
if(dist-supersample*0.5<0.0)
{
- Color pool(gradient(dist,supersample*0.5).premult_alpha()*(dist+supersample*0.5));
- pool+=gradient(1.0-(dist-supersample*0.5),supersample*0.5).premult_alpha()*(-(dist-supersample*0.5));
+ float left(supersample*0.5-dist);
+ float right(supersample*0.5+dist);
+ Color pool(gradient(right*0.5,right).premult_alpha()*right/supersample);
+ if (zigzag) pool+=gradient(left*0.5,left).premult_alpha()*left/supersample;
+ else pool+=gradient(1.0-left*0.5,left).premult_alpha()*left/supersample;
return pool.demult_alpha();
}
}
float
CurveGradient::calc_supersample(const synfig::Point &x, float pw,float ph)const
{
-// return pw/(p2-p1).mag();
return pw;
}
bool
CurveGradient::set_param(const String & param, const ValueBase &value)
{
- if(param=="p1" && value.same_as(p1))
- {
- p1=value.get(p1);
- sync();
- return true;
- }
- if(param=="p2" && value.same_as(p2))
- {
- p2=value.get(p2);
- sync();
- return true;
- }
- //IMPORT(p1);
- //IMPORT(p2);
IMPORT(offset);
{
EXPORT(offset);
EXPORT(bline);
- EXPORT(p1);
- EXPORT(p2);
EXPORT(gradient);
EXPORT(loop);
EXPORT(zigzag);
{
Layer::Vocab ret(Layer_Composite::get_param_vocab());
- ret.push_back(ParamDesc("offset")
- .set_local_name(_("Offset"))
- );
+ ret.push_back(ParamDesc("offset")
+ .set_local_name(_("Offset")));
ret.push_back(ParamDesc("width")
- .set_is_distance()
- .set_local_name(_("Width"))
- );
+ .set_is_distance()
+ .set_local_name(_("Width")));
ret.push_back(ParamDesc("bline")
- .set_local_name(_("Vertices"))
- .set_origin("offset")
- .set_scalar("width")
- .set_description(_("A list of BLine Points"))
- );
-
+ .set_local_name(_("Vertices"))
+ .set_origin("offset")
+ .set_scalar("width")
+ .set_description(_("A list of BLine Points")));
ret.push_back(ParamDesc("gradient")
- .set_local_name(_("Gradient"))
- );
+ .set_local_name(_("Gradient")));
ret.push_back(ParamDesc("loop")
- .set_local_name(_("Loop"))
- );
+ .set_local_name(_("Loop")));
ret.push_back(ParamDesc("zigzag")
- .set_local_name(_("ZigZag"))
- );
+ .set_local_name(_("ZigZag")));
ret.push_back(ParamDesc("perpendicular")
- .set_local_name(_("Perpendicular"))
- );
+ .set_local_name(_("Perpendicular")));
return ret;
}
projects / synfig.git / blobdiff