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 |
|
* oconv.c - main program for object to octree conversion. |
6 |
|
* |
8 |
|
*/ |
9 |
|
|
10 |
|
#include "standard.h" |
11 |
< |
|
11 |
> |
#include "platform.h" |
12 |
|
#include "octree.h" |
16 |
– |
|
13 |
|
#include "object.h" |
18 |
– |
|
14 |
|
#include "otypes.h" |
15 |
+ |
#include "paths.h" |
16 |
|
|
17 |
< |
#define OMARGIN (10*FTINY) /* margin around global cube */ |
17 |
> |
#define OMARGIN (10*FTINY) /* margin around global cube */ |
18 |
|
|
19 |
< |
#define MAXOBJFIL 63 /* maximum number of scene files */ |
19 |
> |
#define MAXOBJFIL 127 /* maximum number of scene files */ |
20 |
|
|
21 |
|
char *progname; /* argv[0] */ |
22 |
|
|
27 |
– |
char *libpath; /* library search path */ |
28 |
– |
|
23 |
|
int nowarn = 0; /* supress warnings? */ |
24 |
|
|
25 |
< |
int objlim = 5; /* # of objects before split */ |
25 |
> |
int objlim = 6; /* # of objects before split */ |
26 |
|
|
27 |
< |
int resolu = 1024; /* octree resolution limit */ |
27 |
> |
int resolu = 16384; /* octree resolution limit */ |
28 |
|
|
29 |
|
CUBE thescene = {EMPTY, {0.0, 0.0, 0.0}, 0.0}; /* our scene */ |
30 |
|
|
31 |
|
char *ofname[MAXOBJFIL+1]; /* object file names */ |
32 |
|
int nfiles = 0; /* number of object files */ |
33 |
|
|
34 |
< |
double mincusize; /* minimum cube size from resolu */ |
34 |
> |
double mincusize; /* minimum cube size from resolu */ |
35 |
|
|
36 |
+ |
void (*addobjnotify[])() = {NULL}; /* new object notifier functions */ |
37 |
|
|
38 |
+ |
|
39 |
|
main(argc, argv) /* convert object files to an octree */ |
40 |
|
int argc; |
41 |
< |
char **argv; |
41 |
> |
char *argv[]; |
42 |
|
{ |
47 |
– |
char *getenv(); |
48 |
– |
double atof(); |
43 |
|
FVECT bbmin, bbmax; |
44 |
|
char *infile = NULL; |
45 |
+ |
int inpfrozen = 0; |
46 |
|
int outflags = IO_ALL; |
47 |
< |
OBJECT startobj; |
47 |
> |
OBJECT startobj; |
48 |
|
int i; |
49 |
|
|
50 |
< |
progname = argv[0]; |
50 |
> |
progname = argv[0] = fixargv0(argv[0]); |
51 |
|
|
52 |
< |
if ((libpath = getenv("RAYPATH")) == NULL) |
58 |
< |
libpath = ":/usr/local/lib/ray"; |
52 |
> |
initotypes(); |
53 |
|
|
54 |
|
for (i = 1; i < argc && argv[i][0] == '-'; i++) |
55 |
|
switch (argv[i][1]) { |
56 |
+ |
case '\0': /* scene from stdin */ |
57 |
+ |
goto breakopt; |
58 |
|
case 'i': /* input octree */ |
59 |
|
infile = argv[++i]; |
60 |
|
break; |
81 |
|
error(USER, errmsg); |
82 |
|
break; |
83 |
|
} |
84 |
< |
|
84 |
> |
breakopt: |
85 |
> |
SET_FILE_BINARY(stdout); |
86 |
|
if (infile != NULL) { /* get old octree & objects */ |
87 |
|
if (thescene.cusize > FTINY) |
88 |
|
error(USER, "only one of '-b' or '-i'"); |
89 |
|
nfiles = readoct(infile, IO_ALL, &thescene, ofname); |
90 |
< |
if (nfiles == 0 && outflags & IO_FILES) { |
91 |
< |
error(WARNING, "frozen octree"); |
90 |
> |
if (nfiles == 0) |
91 |
> |
inpfrozen++; |
92 |
> |
} else |
93 |
> |
newheader("RADIANCE", stdout); /* new binary file header */ |
94 |
> |
printargs(argc, argv, stdout); |
95 |
> |
fputformat(OCTFMT, stdout); |
96 |
> |
printf("\n"); |
97 |
> |
|
98 |
> |
startobj = nobjects; /* previous objects already converted */ |
99 |
> |
|
100 |
> |
for ( ; i < argc; i++) /* read new scene descriptions */ |
101 |
> |
if (!strcmp(argv[i], "-")) { /* from stdin */ |
102 |
> |
readobj(NULL); |
103 |
|
outflags &= ~IO_FILES; |
104 |
+ |
} else { /* from file */ |
105 |
+ |
if (nfiles >= MAXOBJFIL) |
106 |
+ |
error(INTERNAL, "too many scene files"); |
107 |
+ |
readobj(ofname[nfiles++] = argv[i]); |
108 |
|
} |
97 |
– |
} |
109 |
|
|
110 |
< |
printargs(argc, argv, stdout); /* info. header */ |
100 |
< |
printf("\n"); |
110 |
> |
ofname[nfiles] = NULL; |
111 |
|
|
112 |
< |
startobj = nobjects; /* previous objects already converted */ |
113 |
< |
|
114 |
< |
for ( ; i < argc; i++) { /* read new files */ |
105 |
< |
if (nfiles >= MAXOBJFIL) |
106 |
< |
error(INTERNAL, "too many scene files"); |
107 |
< |
readobj(ofname[nfiles++] = argv[i]); |
112 |
> |
if (inpfrozen && outflags & IO_FILES) { |
113 |
> |
error(WARNING, "frozen octree"); |
114 |
> |
outflags &= ~IO_FILES; |
115 |
|
} |
109 |
– |
ofname[nfiles] = NULL; |
116 |
|
/* find bounding box */ |
117 |
|
bbmin[0] = bbmin[1] = bbmin[2] = FHUGE; |
118 |
|
bbmax[0] = bbmax[1] = bbmax[2] = -FHUGE; |
140 |
|
} |
141 |
|
|
142 |
|
mincusize = thescene.cusize / resolu - FTINY; |
143 |
< |
|
143 |
> |
|
144 |
|
for (i = startobj; i < nobjects; i++) /* add new objects */ |
145 |
|
addobject(&thescene, i); |
146 |
< |
|
146 |
> |
|
147 |
|
thescene.cutree = combine(thescene.cutree); /* optimize */ |
148 |
|
|
149 |
|
writeoct(outflags, &thescene, ofname); /* write structures to stdout */ |
152 |
|
} |
153 |
|
|
154 |
|
|
155 |
+ |
void |
156 |
|
quit(code) /* exit program */ |
157 |
|
int code; |
158 |
|
{ |
160 |
|
} |
161 |
|
|
162 |
|
|
163 |
+ |
void |
164 |
|
cputs() /* interactive error */ |
165 |
|
{ |
166 |
|
/* referenced, but not used */ |
167 |
|
} |
168 |
|
|
169 |
|
|
170 |
+ |
void |
171 |
|
wputs(s) /* warning message */ |
172 |
|
char *s; |
173 |
|
{ |
176 |
|
} |
177 |
|
|
178 |
|
|
179 |
+ |
void |
180 |
|
eputs(s) /* put string to stderr */ |
181 |
|
register char *s; |
182 |
|
{ |
183 |
< |
static int inline = 0; |
183 |
> |
static int inln = 0; |
184 |
|
|
185 |
< |
if (!inline++) { |
185 |
> |
if (!inln++) { |
186 |
|
fputs(progname, stderr); |
187 |
|
fputs(": ", stderr); |
188 |
|
} |
189 |
|
fputs(s, stderr); |
190 |
|
if (*s && s[strlen(s)-1] == '\n') |
191 |
< |
inline = 0; |
191 |
> |
inln = 0; |
192 |
|
} |
193 |
|
|
194 |
+ |
/* conflicting def's in param.h */ |
195 |
+ |
#undef tstbit |
196 |
+ |
#undef setbit |
197 |
+ |
#undef clrbit |
198 |
+ |
#undef tglbit |
199 |
|
|
200 |
+ |
#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 |
+ |
|
206 |
+ |
|
207 |
|
addobject(cu, obj) /* add an object to a cube */ |
208 |
|
register CUBE *cu; |
209 |
< |
OBJECT obj; |
209 |
> |
OBJECT obj; |
210 |
|
{ |
211 |
< |
CUBE cukid; |
190 |
< |
OCTREE ot; |
191 |
< |
OBJECT oset[MAXSET+1]; |
192 |
< |
int in; |
193 |
< |
register int i, j; |
211 |
> |
int inc; |
212 |
|
|
213 |
< |
in = (*ofun[objptr(obj)->otype].funp)(objptr(obj), cu); |
213 |
> |
inc = (*ofun[objptr(obj)->otype].funp)(objptr(obj), cu); |
214 |
|
|
215 |
< |
if (!in) |
215 |
> |
if (inc == O_MISS) |
216 |
|
return; /* no intersection */ |
217 |
< |
|
217 |
> |
|
218 |
|
if (istree(cu->cutree)) { |
219 |
< |
/* do children */ |
219 |
> |
CUBE cukid; /* do children */ |
220 |
> |
int i, j; |
221 |
|
cukid.cusize = cu->cusize * 0.5; |
222 |
|
for (i = 0; i < 8; i++) { |
223 |
|
cukid.cutree = octkid(cu->cutree, i); |
229 |
|
addobject(&cukid, obj); |
230 |
|
octkid(cu->cutree, i) = cukid.cutree; |
231 |
|
} |
232 |
< |
|
233 |
< |
} else if (isempty(cu->cutree)) { |
234 |
< |
/* singular set */ |
232 |
> |
return; |
233 |
> |
} |
234 |
> |
if (isempty(cu->cutree)) { |
235 |
> |
OBJECT oset[2]; /* singular set */ |
236 |
|
oset[0] = 1; oset[1] = obj; |
237 |
|
cu->cutree = fullnode(oset); |
238 |
< |
|
239 |
< |
} else { |
240 |
< |
/* add to full node */ |
241 |
< |
objset(oset, cu->cutree); |
242 |
< |
cukid.cusize = cu->cusize * 0.5; |
223 |
< |
|
224 |
< |
if (in == 2 || oset[0] < objlim || cukid.cusize < mincusize) { |
225 |
< |
/* add to set */ |
226 |
< |
if (oset[0] >= MAXSET) { |
227 |
< |
sprintf(errmsg, |
228 |
< |
"set overflow in addobject (%s)", |
229 |
< |
objptr(obj)->oname); |
230 |
< |
error(INTERNAL, errmsg); |
231 |
< |
} |
232 |
< |
insertelem(oset, obj); |
233 |
< |
cu->cutree = fullnode(oset); |
238 |
> |
return; |
239 |
> |
} |
240 |
> |
/* add to full node */ |
241 |
> |
add2full(cu, obj, inc); |
242 |
> |
} |
243 |
|
|
244 |
< |
} else { |
245 |
< |
/* subdivide cube */ |
246 |
< |
if ((ot = octalloc()) == EMPTY) |
247 |
< |
error(SYSTEM, "out of octree space"); |
248 |
< |
for (i = 0; i < 8; i++) { |
249 |
< |
cukid.cutree = EMPTY; |
250 |
< |
for (j = 0; j < 3; j++) { |
251 |
< |
cukid.cuorg[j] = cu->cuorg[j]; |
252 |
< |
if ((1<<j) & i) |
253 |
< |
cukid.cuorg[j] += cukid.cusize; |
254 |
< |
} |
255 |
< |
for (j = 1; j <= oset[0]; j++) |
256 |
< |
addobject(&cukid, oset[j]); |
257 |
< |
addobject(&cukid, obj); |
258 |
< |
octkid(ot, i) = cukid.cutree; |
259 |
< |
} |
260 |
< |
cu->cutree = ot; |
244 |
> |
|
245 |
> |
add2full(cu, obj, inc) /* add object to full node */ |
246 |
> |
register CUBE *cu; |
247 |
> |
OBJECT obj; |
248 |
> |
int inc; |
249 |
> |
{ |
250 |
> |
OCTREE ot; |
251 |
> |
OBJECT oset[MAXSET+1]; |
252 |
> |
CUBE cukid; |
253 |
> |
unsigned char inflg[(MAXSET+7)/8], volflg[(MAXSET+7)/8]; |
254 |
> |
register int i, j; |
255 |
> |
|
256 |
> |
objset(oset, cu->cutree); |
257 |
> |
cukid.cusize = cu->cusize * 0.5; |
258 |
> |
|
259 |
> |
if (inc==O_IN || oset[0] < objlim || cukid.cusize < mincusize) { |
260 |
> |
/* add to set */ |
261 |
> |
if (oset[0] >= MAXSET) { |
262 |
> |
sprintf(errmsg, "set overflow in addobject (%s)", |
263 |
> |
objptr(obj)->oname); |
264 |
> |
error(INTERNAL, errmsg); |
265 |
|
} |
266 |
+ |
insertelem(oset, obj); |
267 |
+ |
cu->cutree = fullnode(oset); |
268 |
+ |
return; |
269 |
|
} |
270 |
+ |
/* subdivide cube */ |
271 |
+ |
if ((ot = octalloc()) == EMPTY) |
272 |
+ |
error(SYSTEM, "out of octree space"); |
273 |
+ |
/* mark volumes */ |
274 |
+ |
j = (oset[0]+7)>>3; |
275 |
+ |
while (j--) |
276 |
+ |
volflg[j] = inflg[j] = 0; |
277 |
+ |
for (j = 1; j <= oset[0]; j++) |
278 |
+ |
if (isvolume(objptr(oset[j])->otype)) { |
279 |
+ |
setbit(volflg,j-1); |
280 |
+ |
if ((*ofun[objptr(oset[j])->otype].funp) |
281 |
+ |
(objptr(oset[j]), cu) == O_IN) |
282 |
+ |
setbit(inflg,j-1); |
283 |
+ |
} |
284 |
+ |
/* assign subcubes */ |
285 |
+ |
for (i = 0; i < 8; i++) { |
286 |
+ |
cukid.cutree = EMPTY; |
287 |
+ |
for (j = 0; j < 3; j++) { |
288 |
+ |
cukid.cuorg[j] = cu->cuorg[j]; |
289 |
+ |
if ((1<<j) & i) |
290 |
+ |
cukid.cuorg[j] += cukid.cusize; |
291 |
+ |
} |
292 |
+ |
/* surfaces first */ |
293 |
+ |
for (j = 1; j <= oset[0]; j++) |
294 |
+ |
if (!tstbit(volflg,j-1)) |
295 |
+ |
addobject(&cukid, oset[j]); |
296 |
+ |
/* then this object */ |
297 |
+ |
addobject(&cukid, obj); |
298 |
+ |
/* then partial volumes */ |
299 |
+ |
for (j = 1; j <= oset[0]; j++) |
300 |
+ |
if (tstbit(volflg,j-1) && |
301 |
+ |
!tstbit(inflg,j-1)) |
302 |
+ |
addobject(&cukid, oset[j]); |
303 |
+ |
/* full volumes last */ |
304 |
+ |
for (j = 1; j <= oset[0]; j++) |
305 |
+ |
if (tstbit(inflg,j-1)) |
306 |
+ |
addobject(&cukid, oset[j]); |
307 |
+ |
/* returned node */ |
308 |
+ |
octkid(ot, i) = cukid.cutree; |
309 |
+ |
} |
310 |
+ |
cu->cutree = ot; |
311 |
|
} |