Welcome to mirror list, hosted at ThFree Co, Russian Federation.

IK_Segment.cpp « intern « iksolver « intern - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: f955a657dae5ccb5db804f235866efbd67fe1d95 (plain)
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
/**
 * $Id$
 * ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
 *
 * This program 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. The Blender
 * Foundation also sells licenses for use in proprietary software under
 * the Blender License.  See http://www.blender.org/BL/ for information
 * about this.
 *
 * This program 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.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software Foundation,
 * Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
 * All rights reserved.
 *
 * The Original Code is: all of this file.
 *
 * Contributor(s): none yet.
 *
 * ***** END GPL/BL DUAL LICENSE BLOCK *****
 */

#include "IK_Segment.h"


IK_Segment::
IK_Segment (
	const MT_Point3 tr1,
	const MT_Matrix3x3 A,
	const MT_Scalar length,
	const bool pitch_on,
	const bool yaw_on,
	const bool role_on
){	
	m_transform.setOrigin(tr1);
	m_transform.setBasis(A);
	m_angles[0] =MT_Scalar(0);	
	m_angles[1] =MT_Scalar(0);	
	m_angles[2] =MT_Scalar(0);	

	m_active_angles[0] = role_on;
	m_active_angles[1] = yaw_on;
	m_active_angles[2] = pitch_on;
	m_length = length;

	if (role_on) {
		m_angle_vectors.push_back(MT_Vector3(1,0,0));
	}
	if (yaw_on) {
		m_angle_vectors.push_back(MT_Vector3(0,1,0));
	}
	if (pitch_on) {
		m_angle_vectors.push_back(MT_Vector3(0,0,1));
	}
	UpdateLocalTransform();


};
	

IK_Segment::
IK_Segment (
) {
	m_transform.setIdentity();

	m_angles[0] =MT_Scalar(0);	
	m_angles[1] =MT_Scalar(0);	
	m_angles[2] =MT_Scalar(0);	

	m_active_angles[0] = false;
	m_active_angles[1] = false;
	m_active_angles[2] = false;
	m_length = MT_Scalar(1);

	UpdateLocalTransform();
}



// accessors
////////////

// The length of the segment 

const
	MT_Scalar
IK_Segment::
Length(
) const {
	return m_length;
}


// This is the transform from adjacent
// coordinate systems in the chain.

const 
	MT_Transform &
IK_Segment::
LocalTransform(
) const {
	return m_local_transform;
}

	void
IK_Segment::
UpdateGlobal(
	const MT_Transform & global
){

	// compute the global transform
	// and the start of the segment in global coordinates.
	
	m_seg_start = global * m_transform.getOrigin();
	m_global_transform = global * m_local_transform;
}

const 
	MT_Transform &
IK_Segment::
GlobalTransform(
) const {
	return m_global_transform;
}

const 	
	MT_Vector3 &
IK_Segment::
GlobalSegmentStart(
) const{
	return m_seg_start;
}


// Return the number of Degrees of Freedom 
// for this segment

	int
IK_Segment::
DoF(
) const {
	return 
		(m_active_angles[0] == true) + 
		(m_active_angles[1] == true) + 
		(m_active_angles[2] == true);
}


// suspect interface...
// Increment the active angles (at most 3) by 
// d_theta. Which angles are incremented depends 
// on which are active. It returns DoF

	int
IK_Segment::
IncrementAngles(
	MT_Scalar *d_theta
){
	int i =0;
	if (m_active_angles[0]) {
		m_angles[0] += d_theta[i];
		i++;
	}
	if (m_active_angles[1]) {
		m_angles[1] += d_theta[i];
		i++;
	}
	if (m_active_angles[2]) {
		m_angles[2] += d_theta[i];
		i++;
	}
	UpdateLocalTransform();

	return i;
}


	int
IK_Segment::
SetAngles(
	const MT_Scalar *angles
){
	int i =0;
	if (m_active_angles[0]) {
		m_angles[0] = angles[i];
		i++;
	}
	if (m_active_angles[1]) {
		m_angles[1] = angles[i];
		i++;
	}
	if (m_active_angles[2]) {
		m_angles[2] = angles[i];
		i++;
	}
	UpdateLocalTransform();

	return i;
}


	void
IK_Segment::
UpdateLocalTransform(
){
	// The local transformation is defined by
	// a user defined translation and rotation followed by
	// rotation by (roll,pitch,yaw) followed by
	// a translation in x of m_length

	MT_Quaternion rotx,roty,rotz;

	rotx.setRotation(MT_Vector3(1,0,0),m_angles[0]);
	roty.setRotation(MT_Vector3(0,1,0),m_angles[1]);
	rotz.setRotation(MT_Vector3(0,0,1),m_angles[2]);

	MT_Quaternion rot = rotx * roty *rotz;

	MT_Transform rx(MT_Point3(0,0,0),rot);

	MT_Transform translation;
	translation.setIdentity();
	translation.translate(MT_Vector3(0,m_length,0));

	m_local_transform = m_transform * rx * translation;
};


const
	std::vector<MT_Vector3> &
IK_Segment::
AngleVectors(
) const{
	return m_angle_vectors;
};
	
	MT_Scalar
IK_Segment::
ActiveAngle(
	int i
) const {
	MT_assert((i >=0) && (i < DoF()));

	// umm want to return the ith active angle
	// and not the ith angle

	int j;
	int angles = -1;
	for (j=0;j < 3;j++) {
		if (m_active_angles[j]) angles ++;
		if (i == angles) return m_angles[j];
	}
	return m_angles[0];
}

	MT_Scalar
IK_Segment::
Angle(
	int i
) const {
	MT_assert((i >=0) && (i < 3));		
	return m_angles[i];
}