Algorithms

x = pi * x'/T

dx = pi * dx'/T

<br />
f(t) = t/(T/2)<br />

MarkBrock wrote:

I hate Fourier's

Greetings.
--------
M.D.V.

If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
“The First Rule of Program Optimization: Don't do it. The Second Rule of Program Optimization (for experts only!): Don't do it yet.” - Michael A. Jackson
Rating helpfull answers is nice, but saying thanks can be even nicer.

Nelek wrote:

I had to write a dossier

<br />
<br />
Ao = 1/4<br />
An = (1/(n^2*PI^2))*(cos(n*PI)-1)<br />
Bn = (-1/(PI*n))*cos(n*PI)<br />
<br />
f(t) = Ao + SUM(An*cos(n*w*t)) + SUM(Bn*sin(n*w*t))<br />
<br />
Where SUM is from n=1 -> n =infinity, and w = (2*PI)/T<br />
<br />

             (y2 - y1)
0 = y - y1 - --------- (x - x1)
             (x2 - x1)

2, 0, 0
0, 3, 0
10,9, 1

2, 0, 0
0, 3, 0
5, 3, 1

SK Genius wrote:

Infact, how are you getting the other values?

//class has a 
double matrix_[3][3];
//defined


double Matrix2D::getRotation() const
{
	//based on Maxim Shemanarev AGG matrix code ! Thanks !
	double x1 = 0.0;
	double y1 = 0.0;
	double x2 = 1.0;
	double y2 = 0.0;
	
	apply(x1, y1);
	apply(x2, y2);

	return atan2(y2-y1, x2-x1);
}


void Matrix2D::getScale( double& x, double& y ) const
{
	//based on Maxim Shemanarev AGG matrix code ! Thanks !
	double x1 = 0.0;
	double y1 = 0.0;
	double x2 = 1.0;
	double y2 = 1.0;
	Matrix2D rot;
	rot.rotate( -getRotation() );

	rot.multiply( *this );

	rot.apply(x1, y1);
	rot.apply(x2, y2);
	
	x = x2 - x1;
	y = y2 - y1;
}