1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
#ifndef TCURVE_H
#define TCURVE_H
#include <vector>
#include <cmath>
namespace anl
{
template<class T> class TCurve
{
public:
TCurve() {}
~TCurve() {}
void pushPoint(double t, T point)
{
tIterType iter=findControlPoint(t);
m_points.insert(iter,SControlPoint(t,point));
return;
}
void clear()
{
m_points.clear();
};
T noInterp(double t)
{
if(m_points.size() < 2) return T(0);
if( t <= m_points[0].m_t) return m_points[0].m_value;
if( t >= m_points[m_points.size()-1].m_t) return m_points[m_points.size()-1].m_value;
tIterType iter=findControlPoint(t);
if(iter==m_points.end())
{
// Something weird happened
return T(0);
}
tIterType prev_iter = iter-1;
if(prev_iter==m_points.end())
{
// Again, something weird happened
return T(0);
}
return prev_iter->m_value;
}
T linearInterp(double t)
{
if(m_points.size() < 2) return T(0);
if( t <= m_points[0].m_t) return m_points[0].m_value;
if( t >= m_points[m_points.size()-1].m_t) return m_points[m_points.size()-1].m_value;
tIterType iter=findControlPoint(t);
if(iter==m_points.end())
{
// Something weird happened
return T(0);
}
tIterType prev_iter = iter-1;
if(prev_iter==m_points.end())
{
// Again, something weird happened
return T(0);
}
double t0=(*prev_iter).m_t;
double t1=(*iter).m_t;
double interp=(t-t0)/(t1-t0);
T v0=(*prev_iter).m_value;
T v1=(*iter).m_value;
return v0 + T((v1-v0)*interp);
}
T cubicInterp(double t)
{
if(m_points.size() < 2) return T(0);
if( t <= m_points[0].m_t) return m_points[0].m_value;
if( t >= m_points[m_points.size()-1].m_t) return m_points[m_points.size()-1].m_value;
tIterType iter=findControlPoint(t);
if(iter==m_points.end())
{
// Something weird happened
return T(0);
}
tIterType prev_iter = iter-1;
if(prev_iter==m_points.end())
{
// Again, something weird happened
return T(0);
}
double t0=(*prev_iter).m_t;
double t1=(*iter).m_t;
double interp=(t-t0)/(t1-t0);
interp=(interp*interp*(3-2*interp));
T v0=(*prev_iter).m_value;
T v1=(*iter).m_value;
return v0 + T((v1-v0)*interp);
}
T quinticInterp(double t)
{
if(m_points.size() < 2) return T(0);
if( t <= m_points[0].m_t) return m_points[0].m_value;
if( t >= m_points[m_points.size()-1].m_t) return m_points[m_points.size()-1].m_value;
tIterType iter=findControlPoint(t);
if(iter==m_points.end())
{
// Something weird happened
return T(0);
}
tIterType prev_iter = iter-1;
if(prev_iter==m_points.end())
{
// Again, something weird happened
return T(0);
}
double t0=(*prev_iter).m_t;
double t1=(*iter).m_t;
double interp=(t-t0)/(t1-t0);
interp=interp*interp*interp*(interp*(interp*6-15)+10);
T v0=(*prev_iter).m_value;
T v1=(*iter).m_value;
return v0 + T((v1-v0)*interp);
}
protected:
struct SControlPoint
{
SControlPoint(double t, T v)
{
m_t=t;
m_value=v;
};
double m_t;
T m_value;
};
typedef typename std::vector<SControlPoint>::iterator tIterType;
std::vector<SControlPoint> m_points;
tIterType findControlPoint(double t)
{
// Find the first control point where p.t > t
tIterType iter=m_points.begin();
while(iter != m_points.end())
{
if(t<=(*iter).m_t)
{
return iter;
}
++iter;
}
return m_points.end();
}
};
};
#endif
|
