-/*! ========================================================================
-** 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
**
-** Copyright (c) 2002 Robert B. Quattlebaum Jr.
+** \legal
+** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
**
-** This software and associated documentation
-** are CONFIDENTIAL and PROPRIETARY property of
-** the above-mentioned copyright holder.
+** This package is free software; you can redistribute it and/or
+** modify it under the terms of the GNU General Public License as
+** published by the Free Software Foundation; either version 2 of
+** the License, or (at your option) any later version.
**
-** You may not copy, print, publish, or in any
-** other way distribute this software without
-** a prior written agreement with
-** the copyright holder.
+** This package is distributed in the hope that it will be useful,
+** 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 ===========================================================
**
{
std::vector<synfig::BLinePoint>::const_iterator iter,next,ret;
std::vector<synfig::BLinePoint>::const_iterator end(bline.end());
-
+
float dist(0);
-
+
next=bline.begin();
-
+
//if(loop)
// iter=--bline.end();
//else
iter=next++;
-
+
for(;next!=end;iter=next++)
{
// Setup the curve
{
std::vector<synfig::BLinePoint>::const_iterator iter,next,ret;
std::vector<synfig::BLinePoint>::const_iterator end(bline.end());
-
+
ret=bline.end();
float dist(100000000000.0);
-
+
next=bline.begin();
float best_bline_dist(0);
float best_bline_len(0);
float total_bline_dist(0);
etl::hermite<Vector> best_curve;
-
+
if(loop)
iter=--bline.end();
else
iter=next++;
Point bp;
-
+
for(;next!=end;iter=next++)
{
// Setup the curve
/*
const float t(curve.find_closest(p,6,0.01,0.99));
- bp=curve(t);if((bp-p).mag_squared()<dist) { ret=iter; dist=(bp-p).mag_squared(); ret_t=t; }
+ bp=curve(t);if((bp-p).mag_squared()<dist) { ret=iter; dist=(bp-p).mag_squared(); ret_t=t; }
*/
float thisdist(0);
//len=calculate_distance(*iter,*next);
len=curve.length();
}
-
+
#define POINT_CHECK(x) bp=curve(x); thisdist=(bp-p).mag_squared(); if(thisdist<dist) { ret=iter; dist=thisdist; best_bline_dist=total_bline_dist; best_bline_len=len; best_curve=curve; }
POINT_CHECK(0.0001);
*bline_dist_ret=best_bline_dist+best_curve.find_distance(0,best_curve.find_closest(p));
// *bline_dist_ret=best_bline_dist+best_curve.find_closest(p)*best_bline_len;
}
-
+
return ret;
}
bline.push_back(BLinePoint());
bline.push_back(BLinePoint());
bline.push_back(BLinePoint());
- bline[0].set_vertex(Point(0,1));
- bline[1].set_vertex(Point(0,-1));
+ bline[0].set_vertex(Point(0,1));
+ bline[1].set_vertex(Point(0,-1));
bline[2].set_vertex(Point(1,0));
- bline[0].set_tangent(bline[1].get_vertex()-bline[2].get_vertex()*0.5f);
- bline[1].set_tangent(bline[2].get_vertex()-bline[0].get_vertex()*0.5f);
- bline[2].set_tangent(bline[0].get_vertex()-bline[1].get_vertex()*0.5f);
- bline[0].set_width(1.0f);
- bline[1].set_width(1.0f);
- bline[2].set_width(1.0f);
+ bline[0].set_tangent(bline[1].get_vertex()-bline[2].get_vertex()*0.5f);
+ bline[1].set_tangent(bline[2].get_vertex()-bline[0].get_vertex()*0.5f);
+ bline[2].set_tangent(bline[0].get_vertex()-bline[1].get_vertex()*0.5f);
+ bline[0].set_width(1.0f);
+ bline[1].set_width(1.0f);
+ bline[2].set_width(1.0f);
bline_loop=true;
-
+
sync();
}
Real dist;
float perp_dist;
-
+
if(bline.size()==0)
return Color::alpha();
else if(bline.size()==1)
else
{
Point point(point_-offset);
-
+
std::vector<synfig::BLinePoint>::const_iterator iter,next;
-
+
// Figure out the BLinePoints we will be using,
// Taking into account looping.
if(perpendicular)
}
iter=next++;
if(next==bline.end()) next=bline.begin();
-
+
// Setup the curve
etl::hermite<Vector> curve(
iter->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(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_;
{
thickness=(next->get_width()-iter->get_width())*t+iter->get_width();
}
- //}
+ //}
}
-
+
if(!perpendicular)
{
dist=((point_-offset)*diff-p1*diff);
}
}
-
+
if(loop)
dist-=floor(dist);
-
+
if(zigzag)
{
dist*=2.0;
}
//IMPORT(p1);
//IMPORT(p2);
-
-
+
+
IMPORT(offset);
IMPORT(perpendicular);
IMPORT(gradient);
IMPORT(loop);
IMPORT(zigzag);
- return Layer_Composite::set_param(param,value);
+ return Layer_Composite::set_param(param,value);
}
ValueBase
EXPORT(zigzag);
EXPORT(width);
EXPORT(perpendicular);
-
+
EXPORT_NAME();
EXPORT_VERSION();
-
- return Layer_Composite::get_param(param);
+
+ return Layer_Composite::get_param(param);
}
Layer::Vocab
ret.push_back(ParamDesc("perpendicular")
.set_local_name(_("Perpendicular"))
);
-
+
return ret;
}
return true;
}
-
+
int x,y;
Surface::pen pen(surface->begin());
Point tl(renddesc.get_tl());
const int w(surface->get_w());
const int h(surface->get_h());
-
+
if(get_amount()==1.0 && get_blend_method()==Color::BLEND_STRAIGHT)
{
for(y=0,pos[1]=tl[1];y<h;y++,pen.inc_y(),pen.dec_x(x),pos[1]+=ph)