forked from UberGames/MD3View
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdrag.cpp
More file actions
executable file
·341 lines (286 loc) · 9.14 KB
/
drag.cpp
File metadata and controls
executable file
·341 lines (286 loc) · 9.14 KB
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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
/*
Copyright (C) 2010 Matthew Baranowski, Sander van Rossen & Raven software.
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 3 of the License, or
(at your option) any later version.
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, see <http://www.gnu.org/licenses/>.
*/
#include "system.h"
#include "ndictionary.h"
#include "md3gl.h"
#include "md3view.h"
int m_x, m_y;
/*! commands to handle mouse dragging, uses key_flags defines above */
void start_drag( mkey_enum keyFlags, int x, int y )
{
m_x = x;
m_y = y;
}
bool drag( mkey_enum keyFlags, int x, int y )
{
bool bRepaintAndSetCursor = false;
if ( keyFlags != 0 )
{
if ( keyFlags & KEY_LBUTTON )
{
if ((x != m_x) || (y != m_y))
{
short s = GetAsyncKeyState(VK_MENU);
if (s & 0x8000)
{
mdview.xPos += ((float)(x - m_x)/10.f) * MOUSE_XPOS_SCALE;
mdview.yPos -= ((float)(y - m_y)/10.f) * MOUSE_YPOS_SCALE;
}
else
{
s = GetAsyncKeyState(0x5A); // Z key
if ( s&0x8000)
{
mdview.rotAngleZ += (float)(x - m_x) * MOUSE_ROT_SCALE;
// mdview.rotAngleZ += (float)(y - m_y) * MOUSE_ROT_SCALE;
if (mdview.rotAngleZ> 360.0f) mdview.rotAngleZ=mdview.rotAngleZ-360.0f;
if (mdview.rotAngleZ<-360.0f) mdview.rotAngleZ=mdview.rotAngleZ+360.0f;
}
else
{
mdview.rotAngleY += (float)(x - m_x) * MOUSE_ROT_SCALE;
mdview.rotAngleX += (float)(y - m_y) * MOUSE_ROT_SCALE;
if (mdview.rotAngleY> 360.0f) mdview.rotAngleY=mdview.rotAngleY-360.0f;
if (mdview.rotAngleY<-360.0f) mdview.rotAngleY=mdview.rotAngleY+360.0f;
if (mdview.rotAngleX> 360.0f) mdview.rotAngleX=mdview.rotAngleX-360.0f;
if (mdview.rotAngleX<-360.0f) mdview.rotAngleX=mdview.rotAngleX+360.0f;
}
}
repaint_main();
set_cursor( m_x, m_y );
bRepaintAndSetCursor = true;
}
} else
if ( keyFlags & KEY_RBUTTON )
{
if ( y != m_y )
{
mdview.zPos += ((float)(y - m_y)/10.f) * MOUSE_ZPOS_SCALE;
if (mdview.zPos<-1000.f) mdview.zPos=-1000.f;
if (mdview.zPos> 1000.f) mdview.zPos= 1000.f;
InvalidateRect( mdview.hwnd, NULL, FALSE );
set_cursor( m_x , m_y );
bRepaintAndSetCursor = true;
}
}
}
return bRepaintAndSetCursor;
}
void end_drag( mkey_enum keyFlags, int x, int y )
{
}
/*
=======
rotates an object by placing a trackball sphere around it
=======
*/
/*
int ModelControl::TrackballRotate(SNodePrimitive *shape, int sx, int sy, int ex, int ey)
{
if (!m_shape) return 0;
// simple quick method to avoid NAN results
if ((abs(sx - ex) < 2) && (abs(sy - ey) < 2)) {
return 0;
}
IAVector scale( TRACKBALL_SCALE, TRACKBALL_SCALE, TRACKBALL_SCALE);
IAMatrix tbMatrix = scale_mat(scale) * shape->m_inv_CTM;
IAPoint isecPnt2, isecPnt1, center, origin;
IAVector vec1, vec2, crossVec;
Idouble dotA, angle;
if (!m_tracer->ISectRayWithSphere( tbMatrix, &isecPnt1, sx, sy,
m_scene->width(), m_scene->height() )) {
return 0;
}
if (!m_tracer->ISectRayWithSphere( tbMatrix, &isecPnt2, ex, ey,
m_scene->width(), m_scene->height() )) {
return 0;
}
center = shape->m_CTM * center;
vec1 = isecPnt1 - center;
vec2 = isecPnt2 - center;
vec1.normalize();
vec2.normalize();
crossVec = cross( vec1, vec2 );
dotA = dot( vec1, vec2 );
angle = -atan2( 1, dotA );
shape->m_CTM_rotate = rot_mat(origin, crossVec, angle) * shape->m_CTM_rotate;
shape->updateCTM();
return 1;
}
SNodePrimitive *ISectTracer::ShootRay( int x, int y, int width, int height,
Intersection *isec, Ray *ray )
{
NodePosition pos;
Ray filmRay, worldRay, objectRay;
IAMatrix filmToWorld = m_scene->camera()->filmToWorld();
Intersection iStack[MAX_INTERSECT_PER_RAY], *iStackP, *iStackP2, *bestISec;
int numIntersect, isectTotal;
NodeSequenceInfo *gData = m_scene->m_geometryList;
Idouble tbest;
SNodePrimitive *primData;
Shape *rayShape;
filmRay.d[X] = ((double)(2*x)/(double)width) - 1;
filmRay.d[Y] = 1-((double)(2*y)/(double)height);
filmRay.d[Z] = -1; filmRay.d[W] = 1;
filmRay.P = IAPoint();
worldRay.d = filmToWorld * filmRay.d;
worldRay.P = filmToWorld * filmRay.P;
normalize( worldRay.d );
iStackP = iStack;
isectTotal = 0;
bestISec = NULL;
// calculate intersections for all shapes
for (pos = gData->first(); pos != NULL; pos = gData->after(pos) ) {
primData = (SNodePrimitive *)pos->element(); // get entry from geometry list
rayShape = primData->m_shape;
objectRay.d = primData->m_inv_CTM * worldRay.d; // transform ray to object space
objectRay.P = primData->m_inv_CTM * worldRay.P;
if (!rayShape->IntersectTest( &objectRay )) {
if (filmRay.d[X] != 0) continue;
}
numIntersect = rayShape->Intersect( &objectRay, iStackP, primData ); // calculate intersection
iStackP += numIntersect;
isectTotal += numIntersect;
}
// find best t for the pixel
if (iStackP > iStack) {
tbest = MAX_FLOAT;
for (int i = 0; i < isectTotal; i++) {
if (iStack[i].m_t < tbest) {
tbest = iStack[i].m_t;
bestISec = &iStack[i];
}
}
}
if (bestISec) {
// copy the relevant data
if (ray) {
ray->P = worldRay.P;
ray->d = worldRay.d;
}
if (isec) bestISec->copy( isec );
return bestISec->m_shape;
}
else {
return NULL;
}
}
int ISectTracer::ISectRayWithSphere( IAMatrix &object, IAPoint *isec,
int x, int y, int width, int height)
{
Ray filmRay, worldRay, objectRay;
IAMatrix filmToWorld = m_scene->camera()->filmToWorld();
filmRay.d[X] = ((double)(2*x)/(double)width) - 1;
filmRay.d[Y] = 1-((double)(2*y)/(double)height);
filmRay.d[Z] = -1; filmRay.d[W] = 1;
filmRay.P = IAPoint();
worldRay.d = filmToWorld * filmRay.d;
worldRay.P = filmToWorld * filmRay.P;
normalize( worldRay.d );
objectRay.d = object * worldRay.d;
objectRay.P = object * worldRay.P;
IAVector d = objectRay.d;
IAPoint P = objectRay.P;
double a = d[Z]*d[Z] + d[X]*d[X] + d[Y]*d[Y];
double b = 2*(P[X]*d[X] + P[Z]*d[Z] + P[Y]*d[Y]);
double c = P[X]*P[X] + P[Y]*P[Y] + P[Z]*P[Z] - 0.25;
double t, det = b*b-4*a*c;
if (det > 0) {
t = (-b+det)/a;
*isec = worldRay.P + worldRay.d * t;
return 1;
}
else return 0;
}
int CubeShape::Intersect( Ray *ray, Intersection *iStack, SNodePrimitive *data )
{
double t, det, u, v;
IAVector d = ray->d;
IAPoint P = ray->P;
Intersection *iStackP = iStack;
// test intersection with z up face
if (d[Z] != 0) {
t = -((P[Z]+0.5) / d[Z]);
u = P[X] + d[X]*t;
v = P[Y] + d[Y]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
iStackP->m_t = t;
iStackP->m_shape = data;
iStackP->m_faceID = FACE_ZPOS;
iStackP++;
}
}
// test intersection with z down face
if (d[Z] != 0) {
t = -((-P[Z]+0.5) / -d[Z]);
u = P[X] + d[X]*t;
v = P[Y] + d[Y]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
iStackP->m_t = t;
iStackP->m_shape = data;
iStackP->m_faceID = FACE_ZNEG;
iStackP++;
}
}
// test intersection with y up face
if (d[Y] != 0) {
t = -((P[Y]+0.5) / d[Y]);
u = P[X] + d[X]*t;
v = P[Z] + d[Z]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
iStackP->m_t = t;
iStackP->m_shape = data;
iStackP->m_faceID = FACE_YPOS;
iStackP++;
}
}
// test intersection with y down face
if (d[Y] != 0) {
t = -((-P[Y]+0.5) / -d[Y]);
u = P[X] + d[X]*t;
v = P[Z] + d[Z]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
iStackP->m_t = t;
iStackP->m_faceID = FACE_YNEG;
iStackP->m_shape = data;
iStackP++;
}
}
// test intersection with x up face
if (d[X] != 0) {
t = -((P[X]+0.5) / d[X]);
u = P[Z] + d[Z]*t;
v = P[Y] + d[Y]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
43D5
iStackP->m_t = t;
iStackP->m_faceID = FACE_XPOS;
iStackP->m_shape = data;
iStackP++;
}
}
// test intersection with x down face
if (d[X] != 0) {
t = -((-P[X]+0.5) / -d[X]);
u = P[Z] + d[Z]*t;
v = P[Y] + d[Y]*t;
if ((u > -0.5) && (u < 0.5) && (v > -0.5) && (v < 0.5)) {
iStackP->m_t = t;
iStackP->m_shape = data;
iStackP->m_faceID = FACE_XNEG;
iStackP++;
}
}
return (int)(iStackP-iStack);
}
*/