1 |
– |
/* Copyright (c) 1986 Regents of the University of California */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* mat4.c - routines dealing with 4 X 4 homogeneous transformation matrices. |
9 |
– |
* |
10 |
– |
* 10/19/85 |
6 |
|
*/ |
7 |
|
|
8 |
+ |
#include "copyright.h" |
9 |
|
|
10 |
< |
static double m4tmp[4][4]; /* for efficiency */ |
10 |
> |
#include "mat4.h" |
11 |
|
|
12 |
< |
#define copymat4(m4a,m4b) bcopy((char *)m4b,(char *)m4a,sizeof(m4tmp)) |
12 |
> |
MAT4 m4ident = MAT4IDENT; |
13 |
|
|
14 |
+ |
static MAT4 m4tmp; /* for efficiency */ |
15 |
|
|
19 |
– |
setident4(m4) |
20 |
– |
double m4[4][4]; |
21 |
– |
{ |
22 |
– |
static double ident[4][4] = { |
23 |
– |
1.,0.,0.,0., |
24 |
– |
0.,1.,0.,0., |
25 |
– |
0.,0.,1.,0., |
26 |
– |
0.,0.,0.,1., |
27 |
– |
}; |
28 |
– |
copymat4(m4, ident); |
29 |
– |
} |
16 |
|
|
17 |
< |
|
17 |
> |
void |
18 |
|
multmat4(m4a, m4b, m4c) /* multiply m4b X m4c and put into m4a */ |
19 |
< |
double m4a[4][4]; |
20 |
< |
register double m4b[4][4], m4c[4][4]; |
19 |
> |
MAT4 m4a; |
20 |
> |
register MAT4 m4b, m4c; |
21 |
|
{ |
22 |
|
register int i, j; |
23 |
|
|
32 |
|
} |
33 |
|
|
34 |
|
|
35 |
+ |
void |
36 |
|
multv3(v3a, v3b, m4) /* transform vector v3b by m4 and put into v3a */ |
37 |
< |
double v3a[3]; |
38 |
< |
register double v3b[3]; |
39 |
< |
register double m4[4][4]; |
37 |
> |
FVECT v3a; |
38 |
> |
register FVECT v3b; |
39 |
> |
register MAT4 m4; |
40 |
|
{ |
41 |
|
m4tmp[0][0] = v3b[0]*m4[0][0] + v3b[1]*m4[1][0] + v3b[2]*m4[2][0]; |
42 |
|
m4tmp[0][1] = v3b[0]*m4[0][1] + v3b[1]*m4[1][1] + v3b[2]*m4[2][1]; |
48 |
|
} |
49 |
|
|
50 |
|
|
51 |
+ |
void |
52 |
|
multp3(p3a, p3b, m4) /* transform p3b by m4 and put into p3a */ |
53 |
< |
register double p3a[3]; |
54 |
< |
double p3b[3]; |
55 |
< |
register double m4[4][4]; |
53 |
> |
register FVECT p3a; |
54 |
> |
FVECT p3b; |
55 |
> |
register MAT4 m4; |
56 |
|
{ |
57 |
|
multv3(p3a, p3b, m4); /* transform as vector */ |
58 |
|
p3a[0] += m4[3][0]; /* translate */ |
59 |
|
p3a[1] += m4[3][1]; |
60 |
|
p3a[2] += m4[3][2]; |
61 |
|
} |
74 |
– |
|
75 |
– |
|
76 |
– |
#ifdef INVMAT |
77 |
– |
/* |
78 |
– |
* invmat - computes the inverse of mat into inverse. Returns 1 |
79 |
– |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
80 |
– |
* method with partial pivoting. |
81 |
– |
*/ |
82 |
– |
|
83 |
– |
invmat(inverse,mat) |
84 |
– |
double mat[4][4],inverse[4][4]; |
85 |
– |
{ |
86 |
– |
#define SWAP(a,b,t) (t=a,a=b,b=t) |
87 |
– |
#define ABS(x) (x>=0?x:-(x)) |
88 |
– |
|
89 |
– |
register int i,j,k; |
90 |
– |
register double temp; |
91 |
– |
|
92 |
– |
copymat4(m4tmp, mat); |
93 |
– |
setident(inverse); |
94 |
– |
|
95 |
– |
for(i = 0; i < 4; i++) { |
96 |
– |
/* Look for row with largest pivot and swap rows */ |
97 |
– |
temp = 0; j = -1; |
98 |
– |
for(k = i; k < 4; k++) |
99 |
– |
if(ABS(m4tmp[k][i]) > temp) { |
100 |
– |
temp = ABS(m4tmp[k][i]); |
101 |
– |
j = k; |
102 |
– |
} |
103 |
– |
if(j == -1) /* No replacing row -> no inverse */ |
104 |
– |
return(0); |
105 |
– |
if (j != i) |
106 |
– |
for(k = 0; k < 4; k++) { |
107 |
– |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
108 |
– |
SWAP(inverse[i][k],inverse[j][k],temp); |
109 |
– |
} |
110 |
– |
|
111 |
– |
temp = m4tmp[i][i]; |
112 |
– |
for(k = 0; k < 4; k++) { |
113 |
– |
m4tmp[i][k] /= temp; |
114 |
– |
inverse[i][k] /= temp; |
115 |
– |
} |
116 |
– |
for(j = 0; j < 4; j++) { |
117 |
– |
if(j != i) { |
118 |
– |
temp = m4tmp[j][i]; |
119 |
– |
for(k = 0; k < 4; k++) { |
120 |
– |
m4tmp[j][k] -= m4tmp[i][k]*temp; |
121 |
– |
inverse[j][k] -= inverse[i][k]*temp; |
122 |
– |
} |
123 |
– |
} |
124 |
– |
} |
125 |
– |
} |
126 |
– |
return(1); |
127 |
– |
|
128 |
– |
#undef ABS |
129 |
– |
#undef SWAP |
130 |
– |
} |
131 |
– |
#endif |