1 |
– |
/* Copyright (c) 1990 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 |
|
#include "mat4.h" |
11 |
|
|
12 |
|
MAT4 m4ident = MAT4IDENT; |
14 |
|
static MAT4 m4tmp; /* for efficiency */ |
15 |
|
|
16 |
|
|
17 |
+ |
void |
18 |
|
multmat4(m4a, m4b, m4c) /* multiply m4b X m4c and put into m4a */ |
19 |
|
MAT4 m4a; |
20 |
|
register MAT4 m4b, m4c; |
32 |
|
} |
33 |
|
|
34 |
|
|
35 |
+ |
void |
36 |
|
multv3(v3a, v3b, m4) /* transform vector v3b by m4 and put into v3a */ |
37 |
|
FVECT v3a; |
38 |
|
register FVECT v3b; |
48 |
|
} |
49 |
|
|
50 |
|
|
51 |
+ |
void |
52 |
|
multp3(p3a, p3b, m4) /* transform p3b by m4 and put into p3a */ |
53 |
|
register FVECT p3a; |
54 |
|
FVECT p3b; |
59 |
|
p3a[1] += m4[3][1]; |
60 |
|
p3a[2] += m4[3][2]; |
61 |
|
} |
62 |
– |
|
63 |
– |
|
64 |
– |
#ifdef INVMAT |
65 |
– |
/* |
66 |
– |
* invmat - computes the inverse of mat into inverse. Returns 1 |
67 |
– |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
68 |
– |
* method with partial pivoting. |
69 |
– |
*/ |
70 |
– |
|
71 |
– |
invmat(inverse,mat) |
72 |
– |
MAT4 mat, inverse; |
73 |
– |
{ |
74 |
– |
#define SWAP(a,b,t) (t=a,a=b,b=t) |
75 |
– |
#define ABS(x) (x>=0?x:-(x)) |
76 |
– |
|
77 |
– |
register int i,j,k; |
78 |
– |
register double temp; |
79 |
– |
|
80 |
– |
copymat4(m4tmp, mat); |
81 |
– |
setident(inverse); |
82 |
– |
|
83 |
– |
for(i = 0; i < 4; i++) { |
84 |
– |
/* Look for row with largest pivot and swap rows */ |
85 |
– |
temp = 0; j = -1; |
86 |
– |
for(k = i; k < 4; k++) |
87 |
– |
if(ABS(m4tmp[k][i]) > temp) { |
88 |
– |
temp = ABS(m4tmp[k][i]); |
89 |
– |
j = k; |
90 |
– |
} |
91 |
– |
if(j == -1) /* No replacing row -> no inverse */ |
92 |
– |
return(0); |
93 |
– |
if (j != i) |
94 |
– |
for(k = 0; k < 4; k++) { |
95 |
– |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
96 |
– |
SWAP(inverse[i][k],inverse[j][k],temp); |
97 |
– |
} |
98 |
– |
|
99 |
– |
temp = m4tmp[i][i]; |
100 |
– |
for(k = 0; k < 4; k++) { |
101 |
– |
m4tmp[i][k] /= temp; |
102 |
– |
inverse[i][k] /= temp; |
103 |
– |
} |
104 |
– |
for(j = 0; j < 4; j++) { |
105 |
– |
if(j != i) { |
106 |
– |
temp = m4tmp[j][i]; |
107 |
– |
for(k = 0; k < 4; k++) { |
108 |
– |
m4tmp[j][k] -= m4tmp[i][k]*temp; |
109 |
– |
inverse[j][k] -= inverse[i][k]*temp; |
110 |
– |
} |
111 |
– |
} |
112 |
– |
} |
113 |
– |
} |
114 |
– |
return(1); |
115 |
– |
|
116 |
– |
#undef ABS |
117 |
– |
#undef SWAP |
118 |
– |
} |
119 |
– |
#endif |