1 |
greg |
1.1 |
#ifndef lint |
2 |
greg |
2.12 |
static const char RCSid[] = "$Id$"; |
3 |
greg |
1.1 |
#endif |
4 |
|
|
/* |
5 |
|
|
* oconv.c - main program for object to octree conversion. |
6 |
|
|
* |
7 |
|
|
* 7/29/85 |
8 |
|
|
*/ |
9 |
|
|
|
10 |
|
|
#include "standard.h" |
11 |
|
|
|
12 |
|
|
#include "octree.h" |
13 |
|
|
|
14 |
|
|
#include "object.h" |
15 |
|
|
|
16 |
|
|
#include "otypes.h" |
17 |
|
|
|
18 |
greg |
2.4 |
#include "paths.h" |
19 |
greg |
1.14 |
|
20 |
greg |
2.4 |
#define OMARGIN (10*FTINY) /* margin around global cube */ |
21 |
greg |
1.2 |
|
22 |
greg |
2.11 |
#define MAXOBJFIL 127 /* maximum number of scene files */ |
23 |
greg |
1.1 |
|
24 |
|
|
char *progname; /* argv[0] */ |
25 |
|
|
|
26 |
|
|
int nowarn = 0; /* supress warnings? */ |
27 |
|
|
|
28 |
|
|
int objlim = 5; /* # of objects before split */ |
29 |
|
|
|
30 |
greg |
2.12 |
int resolu = 8192; /* octree resolution limit */ |
31 |
greg |
1.1 |
|
32 |
|
|
CUBE thescene = {EMPTY, {0.0, 0.0, 0.0}, 0.0}; /* our scene */ |
33 |
|
|
|
34 |
|
|
char *ofname[MAXOBJFIL+1]; /* object file names */ |
35 |
|
|
int nfiles = 0; /* number of object files */ |
36 |
|
|
|
37 |
greg |
2.4 |
double mincusize; /* minimum cube size from resolu */ |
38 |
greg |
1.1 |
|
39 |
greg |
2.12 |
void (*addobjnotify[])() = {NULL}; /* new object notifier functions */ |
40 |
greg |
1.7 |
|
41 |
greg |
1.1 |
|
42 |
|
|
main(argc, argv) /* convert object files to an octree */ |
43 |
|
|
int argc; |
44 |
greg |
2.10 |
char *argv[]; |
45 |
greg |
1.1 |
{ |
46 |
|
|
FVECT bbmin, bbmax; |
47 |
|
|
char *infile = NULL; |
48 |
greg |
2.6 |
int inpfrozen = 0; |
49 |
greg |
1.1 |
int outflags = IO_ALL; |
50 |
greg |
2.4 |
OBJECT startobj; |
51 |
greg |
1.1 |
int i; |
52 |
|
|
|
53 |
greg |
2.5 |
progname = argv[0] = fixargv0(argv[0]); |
54 |
greg |
1.1 |
|
55 |
greg |
1.12 |
initotypes(); |
56 |
|
|
|
57 |
greg |
1.5 |
for (i = 1; i < argc && argv[i][0] == '-'; i++) |
58 |
greg |
1.1 |
switch (argv[i][1]) { |
59 |
greg |
1.5 |
case '\0': /* scene from stdin */ |
60 |
|
|
goto breakopt; |
61 |
greg |
1.1 |
case 'i': /* input octree */ |
62 |
|
|
infile = argv[++i]; |
63 |
|
|
break; |
64 |
|
|
case 'b': /* bounding cube */ |
65 |
greg |
1.2 |
thescene.cuorg[0] = atof(argv[++i]) - OMARGIN; |
66 |
|
|
thescene.cuorg[1] = atof(argv[++i]) - OMARGIN; |
67 |
|
|
thescene.cuorg[2] = atof(argv[++i]) - OMARGIN; |
68 |
|
|
thescene.cusize = atof(argv[++i]) + 2*OMARGIN; |
69 |
greg |
1.1 |
break; |
70 |
|
|
case 'n': /* set limit */ |
71 |
|
|
objlim = atoi(argv[++i]); |
72 |
|
|
break; |
73 |
|
|
case 'r': /* resolution limit */ |
74 |
|
|
resolu = atoi(argv[++i]); |
75 |
|
|
break; |
76 |
|
|
case 'f': /* freeze octree */ |
77 |
|
|
outflags &= ~IO_FILES; |
78 |
|
|
break; |
79 |
|
|
case 'w': /* supress warnings */ |
80 |
|
|
nowarn = 1; |
81 |
|
|
break; |
82 |
|
|
default: |
83 |
|
|
sprintf(errmsg, "unknown option: '%s'", argv[i]); |
84 |
|
|
error(USER, errmsg); |
85 |
|
|
break; |
86 |
|
|
} |
87 |
greg |
1.5 |
breakopt: |
88 |
greg |
2.4 |
#ifdef MSDOS |
89 |
|
|
setmode(fileno(stdout), O_BINARY); |
90 |
|
|
#endif |
91 |
greg |
1.1 |
if (infile != NULL) { /* get old octree & objects */ |
92 |
|
|
if (thescene.cusize > FTINY) |
93 |
|
|
error(USER, "only one of '-b' or '-i'"); |
94 |
|
|
nfiles = readoct(infile, IO_ALL, &thescene, ofname); |
95 |
greg |
2.6 |
if (nfiles == 0) |
96 |
|
|
inpfrozen++; |
97 |
greg |
2.8 |
} else |
98 |
|
|
newheader("RADIANCE", stdout); /* new binary file header */ |
99 |
greg |
2.7 |
printargs(argc, argv, stdout); |
100 |
greg |
1.13 |
fputformat(OCTFMT, stdout); |
101 |
greg |
1.1 |
printf("\n"); |
102 |
|
|
|
103 |
|
|
startobj = nobjects; /* previous objects already converted */ |
104 |
greg |
2.5 |
|
105 |
greg |
1.4 |
for ( ; i < argc; i++) /* read new scene descriptions */ |
106 |
|
|
if (!strcmp(argv[i], "-")) { /* from stdin */ |
107 |
|
|
readobj(NULL); |
108 |
|
|
outflags &= ~IO_FILES; |
109 |
|
|
} else { /* from file */ |
110 |
|
|
if (nfiles >= MAXOBJFIL) |
111 |
|
|
error(INTERNAL, "too many scene files"); |
112 |
|
|
readobj(ofname[nfiles++] = argv[i]); |
113 |
|
|
} |
114 |
|
|
|
115 |
greg |
1.1 |
ofname[nfiles] = NULL; |
116 |
greg |
2.6 |
|
117 |
|
|
if (inpfrozen && outflags & IO_FILES) { |
118 |
|
|
error(WARNING, "frozen octree"); |
119 |
|
|
outflags &= ~IO_FILES; |
120 |
|
|
} |
121 |
greg |
1.1 |
/* find bounding box */ |
122 |
|
|
bbmin[0] = bbmin[1] = bbmin[2] = FHUGE; |
123 |
|
|
bbmax[0] = bbmax[1] = bbmax[2] = -FHUGE; |
124 |
|
|
for (i = startobj; i < nobjects; i++) |
125 |
|
|
add2bbox(objptr(i), bbmin, bbmax); |
126 |
|
|
/* set/check cube */ |
127 |
|
|
if (thescene.cusize == 0.0) { |
128 |
|
|
if (bbmin[0] <= bbmax[0]) { |
129 |
|
|
for (i = 0; i < 3; i++) { |
130 |
greg |
1.2 |
bbmin[i] -= OMARGIN; |
131 |
|
|
bbmax[i] += OMARGIN; |
132 |
greg |
1.1 |
} |
133 |
|
|
for (i = 0; i < 3; i++) |
134 |
|
|
if (bbmax[i] - bbmin[i] > thescene.cusize) |
135 |
|
|
thescene.cusize = bbmax[i] - bbmin[i]; |
136 |
greg |
1.3 |
for (i = 0; i < 3; i++) |
137 |
|
|
thescene.cuorg[i] = |
138 |
|
|
(bbmax[i]+bbmin[i]-thescene.cusize)*.5; |
139 |
greg |
1.1 |
} |
140 |
|
|
} else { |
141 |
|
|
for (i = 0; i < 3; i++) |
142 |
|
|
if (bbmin[i] < thescene.cuorg[i] || |
143 |
|
|
bbmax[i] > thescene.cuorg[i] + thescene.cusize) |
144 |
|
|
error(USER, "boundary does not encompass scene"); |
145 |
|
|
} |
146 |
|
|
|
147 |
|
|
mincusize = thescene.cusize / resolu - FTINY; |
148 |
greg |
2.5 |
|
149 |
greg |
1.1 |
for (i = startobj; i < nobjects; i++) /* add new objects */ |
150 |
|
|
addobject(&thescene, i); |
151 |
greg |
2.5 |
|
152 |
greg |
1.1 |
thescene.cutree = combine(thescene.cutree); /* optimize */ |
153 |
|
|
|
154 |
|
|
writeoct(outflags, &thescene, ofname); /* write structures to stdout */ |
155 |
|
|
|
156 |
|
|
quit(0); |
157 |
|
|
} |
158 |
|
|
|
159 |
|
|
|
160 |
greg |
2.12 |
void |
161 |
greg |
1.1 |
quit(code) /* exit program */ |
162 |
|
|
int code; |
163 |
|
|
{ |
164 |
|
|
exit(code); |
165 |
|
|
} |
166 |
|
|
|
167 |
|
|
|
168 |
greg |
2.12 |
void |
169 |
greg |
1.1 |
cputs() /* interactive error */ |
170 |
|
|
{ |
171 |
|
|
/* referenced, but not used */ |
172 |
|
|
} |
173 |
|
|
|
174 |
|
|
|
175 |
greg |
2.12 |
void |
176 |
greg |
1.1 |
wputs(s) /* warning message */ |
177 |
|
|
char *s; |
178 |
|
|
{ |
179 |
|
|
if (!nowarn) |
180 |
|
|
eputs(s); |
181 |
|
|
} |
182 |
|
|
|
183 |
|
|
|
184 |
greg |
2.12 |
void |
185 |
greg |
1.1 |
eputs(s) /* put string to stderr */ |
186 |
|
|
register char *s; |
187 |
|
|
{ |
188 |
greg |
1.9 |
static int inln = 0; |
189 |
greg |
1.1 |
|
190 |
greg |
1.9 |
if (!inln++) { |
191 |
greg |
1.1 |
fputs(progname, stderr); |
192 |
|
|
fputs(": ", stderr); |
193 |
|
|
} |
194 |
|
|
fputs(s, stderr); |
195 |
|
|
if (*s && s[strlen(s)-1] == '\n') |
196 |
greg |
1.9 |
inln = 0; |
197 |
greg |
1.1 |
} |
198 |
|
|
|
199 |
|
|
|
200 |
greg |
2.4 |
#define bitop(f,i,op) (f[((i)>>3)] op (1<<((i)&7))) |
201 |
|
|
#define tstbit(f,i) bitop(f,i,&) |
202 |
|
|
#define setbit(f,i) bitop(f,i,|=) |
203 |
|
|
#define clrbit(f,i) bitop(f,i,&=~) |
204 |
|
|
#define tglbit(f,i) bitop(f,i,^=) |
205 |
greg |
1.11 |
|
206 |
|
|
|
207 |
greg |
1.1 |
addobject(cu, obj) /* add an object to a cube */ |
208 |
|
|
register CUBE *cu; |
209 |
greg |
2.4 |
OBJECT obj; |
210 |
greg |
1.1 |
{ |
211 |
|
|
CUBE cukid; |
212 |
greg |
2.4 |
OCTREE ot; |
213 |
|
|
OBJECT oset[MAXSET+1]; |
214 |
greg |
2.3 |
unsigned char inflg[(MAXSET+7)/8], volflg[(MAXSET+7)/8]; |
215 |
greg |
1.11 |
int in; |
216 |
greg |
1.1 |
register int i, j; |
217 |
|
|
|
218 |
|
|
in = (*ofun[objptr(obj)->otype].funp)(objptr(obj), cu); |
219 |
|
|
|
220 |
greg |
1.6 |
if (in == O_MISS) |
221 |
greg |
1.1 |
return; /* no intersection */ |
222 |
greg |
2.5 |
|
223 |
greg |
1.1 |
if (istree(cu->cutree)) { |
224 |
|
|
/* do children */ |
225 |
|
|
cukid.cusize = cu->cusize * 0.5; |
226 |
|
|
for (i = 0; i < 8; i++) { |
227 |
|
|
cukid.cutree = octkid(cu->cutree, i); |
228 |
|
|
for (j = 0; j < 3; j++) { |
229 |
|
|
cukid.cuorg[j] = cu->cuorg[j]; |
230 |
|
|
if ((1<<j) & i) |
231 |
|
|
cukid.cuorg[j] += cukid.cusize; |
232 |
|
|
} |
233 |
|
|
addobject(&cukid, obj); |
234 |
|
|
octkid(cu->cutree, i) = cukid.cutree; |
235 |
|
|
} |
236 |
greg |
1.11 |
return; |
237 |
|
|
} |
238 |
|
|
if (isempty(cu->cutree)) { |
239 |
greg |
1.1 |
/* singular set */ |
240 |
|
|
oset[0] = 1; oset[1] = obj; |
241 |
|
|
cu->cutree = fullnode(oset); |
242 |
greg |
1.11 |
return; |
243 |
|
|
} |
244 |
|
|
/* add to full node */ |
245 |
|
|
objset(oset, cu->cutree); |
246 |
|
|
cukid.cusize = cu->cusize * 0.5; |
247 |
greg |
2.5 |
|
248 |
greg |
1.11 |
if (in==O_IN || oset[0] < objlim || cukid.cusize < mincusize) { |
249 |
|
|
/* add to set */ |
250 |
|
|
if (oset[0] >= MAXSET) { |
251 |
greg |
2.3 |
sprintf(errmsg, "set overflow in addobject (%s)", |
252 |
greg |
1.11 |
objptr(obj)->oname); |
253 |
|
|
error(INTERNAL, errmsg); |
254 |
greg |
1.1 |
} |
255 |
greg |
1.11 |
insertelem(oset, obj); |
256 |
|
|
cu->cutree = fullnode(oset); |
257 |
|
|
return; |
258 |
greg |
1.1 |
} |
259 |
greg |
1.11 |
/* subdivide cube */ |
260 |
|
|
if ((ot = octalloc()) == EMPTY) |
261 |
|
|
error(SYSTEM, "out of octree space"); |
262 |
|
|
/* mark volumes */ |
263 |
|
|
j = (oset[0]+7)>>3; |
264 |
|
|
while (j--) |
265 |
|
|
volflg[j] = inflg[j] = 0; |
266 |
|
|
for (j = 1; j <= oset[0]; j++) |
267 |
|
|
if (isvolume(objptr(oset[j])->otype)) { |
268 |
|
|
setbit(volflg,j-1); |
269 |
|
|
if ((*ofun[objptr(oset[j])->otype].funp) |
270 |
greg |
2.3 |
(objptr(oset[j]), cu) == O_IN) |
271 |
greg |
1.11 |
setbit(inflg,j-1); |
272 |
|
|
} |
273 |
|
|
/* assign subcubes */ |
274 |
|
|
for (i = 0; i < 8; i++) { |
275 |
|
|
cukid.cutree = EMPTY; |
276 |
|
|
for (j = 0; j < 3; j++) { |
277 |
|
|
cukid.cuorg[j] = cu->cuorg[j]; |
278 |
|
|
if ((1<<j) & i) |
279 |
|
|
cukid.cuorg[j] += cukid.cusize; |
280 |
|
|
} |
281 |
|
|
/* surfaces first */ |
282 |
|
|
for (j = 1; j <= oset[0]; j++) |
283 |
|
|
if (!tstbit(volflg,j-1)) |
284 |
|
|
addobject(&cukid, oset[j]); |
285 |
|
|
/* then this object */ |
286 |
|
|
addobject(&cukid, obj); |
287 |
greg |
2.3 |
/* then partial volumes */ |
288 |
greg |
1.11 |
for (j = 1; j <= oset[0]; j++) |
289 |
|
|
if (tstbit(volflg,j-1) && |
290 |
|
|
!tstbit(inflg,j-1)) |
291 |
|
|
addobject(&cukid, oset[j]); |
292 |
greg |
2.3 |
/* full volumes last */ |
293 |
greg |
1.11 |
for (j = 1; j <= oset[0]; j++) |
294 |
|
|
if (tstbit(inflg,j-1)) |
295 |
|
|
addobject(&cukid, oset[j]); |
296 |
|
|
/* returned node */ |
297 |
|
|
octkid(ot, i) = cukid.cutree; |
298 |
|
|
} |
299 |
|
|
cu->cutree = ot; |
300 |
greg |
1.1 |
} |