1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1990 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
10 |
|
* 10/19/85 |
11 |
|
*/ |
12 |
|
|
13 |
+ |
#include "mat4.h" |
14 |
|
|
15 |
< |
static double m4tmp[4][4]; /* for efficiency */ |
15 |
> |
static MAT4 m4tmp; /* for efficiency */ |
16 |
|
|
16 |
– |
#define copymat4(m4a,m4b) bcopy((char *)m4b,(char *)m4a,sizeof(m4tmp)) |
17 |
|
|
18 |
– |
|
18 |
|
setident4(m4) |
19 |
< |
double m4[4][4]; |
19 |
> |
MAT4 m4; |
20 |
|
{ |
21 |
< |
static double ident[4][4] = { |
21 |
> |
static MAT4 ident = { |
22 |
|
1.,0.,0.,0., |
23 |
|
0.,1.,0.,0., |
24 |
|
0.,0.,1.,0., |
29 |
|
|
30 |
|
|
31 |
|
multmat4(m4a, m4b, m4c) /* multiply m4b X m4c and put into m4a */ |
32 |
< |
double m4a[4][4]; |
33 |
< |
register double m4b[4][4], m4c[4][4]; |
32 |
> |
MAT4 m4a; |
33 |
> |
register MAT4 m4b, m4c; |
34 |
|
{ |
35 |
|
register int i, j; |
36 |
|
|
46 |
|
|
47 |
|
|
48 |
|
multv3(v3a, v3b, m4) /* transform vector v3b by m4 and put into v3a */ |
49 |
< |
double v3a[3]; |
50 |
< |
register double v3b[3]; |
51 |
< |
register double m4[4][4]; |
49 |
> |
FVECT v3a; |
50 |
> |
register FVECT v3b; |
51 |
> |
register MAT4 m4; |
52 |
|
{ |
53 |
< |
register int i; |
53 |
> |
m4tmp[0][0] = v3b[0]*m4[0][0] + v3b[1]*m4[1][0] + v3b[2]*m4[2][0]; |
54 |
> |
m4tmp[0][1] = v3b[0]*m4[0][1] + v3b[1]*m4[1][1] + v3b[2]*m4[2][1]; |
55 |
> |
m4tmp[0][2] = v3b[0]*m4[0][2] + v3b[1]*m4[1][2] + v3b[2]*m4[2][2]; |
56 |
|
|
56 |
– |
for (i = 0; i < 3; i++) |
57 |
– |
m4tmp[0][i] = v3b[0]*m4[0][i] + |
58 |
– |
v3b[1]*m4[1][i] + |
59 |
– |
v3b[2]*m4[2][i]; |
60 |
– |
|
57 |
|
v3a[0] = m4tmp[0][0]; |
58 |
|
v3a[1] = m4tmp[0][1]; |
59 |
|
v3a[2] = m4tmp[0][2]; |
61 |
|
|
62 |
|
|
63 |
|
multp3(p3a, p3b, m4) /* transform p3b by m4 and put into p3a */ |
64 |
< |
register double p3a[3]; |
65 |
< |
double p3b[3]; |
66 |
< |
register double m4[4][4]; |
64 |
> |
register FVECT p3a; |
65 |
> |
FVECT p3b; |
66 |
> |
register MAT4 m4; |
67 |
|
{ |
68 |
|
multv3(p3a, p3b, m4); /* transform as vector */ |
69 |
|
p3a[0] += m4[3][0]; /* translate */ |
75 |
|
#ifdef INVMAT |
76 |
|
/* |
77 |
|
* invmat - computes the inverse of mat into inverse. Returns 1 |
78 |
< |
* if there exists an inverse, 0 otherwise. It uses Gause Elimination |
79 |
< |
* method. |
78 |
> |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
79 |
> |
* method with partial pivoting. |
80 |
|
*/ |
81 |
|
|
82 |
|
invmat(inverse,mat) |
83 |
< |
double mat[4][4],inverse[4][4]; |
83 |
> |
MAT4 mat, inverse; |
84 |
|
{ |
85 |
|
#define SWAP(a,b,t) (t=a,a=b,b=t) |
86 |
+ |
#define ABS(x) (x>=0?x:-(x)) |
87 |
|
|
88 |
|
register int i,j,k; |
89 |
|
register double temp; |
90 |
|
|
94 |
– |
setident4(inverse); |
91 |
|
copymat4(m4tmp, mat); |
92 |
+ |
setident(inverse); |
93 |
|
|
94 |
|
for(i = 0; i < 4; i++) { |
95 |
< |
if(m4tmp[i][i] == 0) { /* Pivot is zero */ |
96 |
< |
/* Look for a raw with pivot != 0 and swap raws */ |
97 |
< |
for(j = i + 1; j < 4; j++) |
98 |
< |
if(m4tmp[j][i] != 0) { |
99 |
< |
for( k = 0; k < 4; k++) { |
100 |
< |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
101 |
< |
SWAP(inverse[i][k],inverse[j][k],temp); |
102 |
< |
} |
103 |
< |
break; |
104 |
< |
} |
105 |
< |
if(j == 4) /* No replacing raw -> no inverse */ |
106 |
< |
return(0); |
107 |
< |
} |
95 |
> |
/* Look for row with largest pivot and swap rows */ |
96 |
> |
temp = 0; j = -1; |
97 |
> |
for(k = i; k < 4; k++) |
98 |
> |
if(ABS(m4tmp[k][i]) > temp) { |
99 |
> |
temp = ABS(m4tmp[k][i]); |
100 |
> |
j = k; |
101 |
> |
} |
102 |
> |
if(j == -1) /* No replacing row -> no inverse */ |
103 |
> |
return(0); |
104 |
> |
if (j != i) |
105 |
> |
for(k = 0; k < 4; k++) { |
106 |
> |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
107 |
> |
SWAP(inverse[i][k],inverse[j][k],temp); |
108 |
> |
} |
109 |
|
|
110 |
|
temp = m4tmp[i][i]; |
111 |
|
for(k = 0; k < 4; k++) { |
123 |
|
} |
124 |
|
} |
125 |
|
return(1); |
126 |
+ |
|
127 |
+ |
#undef ABS |
128 |
+ |
#undef SWAP |
129 |
|
} |
130 |
|
#endif |