ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/ot/oconv.c
Revision: 2.17
Committed: Sat Jun 21 15:05:01 2003 UTC (20 years, 10 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 2.16: +6 -1 lines
Log Message:
Fixed some conflicting definitions

File Contents

# User Rev Content
1 greg 1.1 #ifndef lint
2 greg 2.17 static const char RCSid[] = "$Id: oconv.c,v 2.16 2003/06/08 12:03:10 schorsch Exp $";
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 schorsch 2.16 #include "platform.h"
12 greg 1.1 #include "octree.h"
13     #include "object.h"
14     #include "otypes.h"
15 greg 2.4 #include "paths.h"
16 greg 1.14
17 greg 2.4 #define OMARGIN (10*FTINY) /* margin around global cube */
18 greg 1.2
19 greg 2.11 #define MAXOBJFIL 127 /* maximum number of scene files */
20 greg 1.1
21     char *progname; /* argv[0] */
22    
23     int nowarn = 0; /* supress warnings? */
24    
25 greg 2.14 int objlim = 6; /* # of objects before split */
26 greg 1.1
27 greg 2.14 int resolu = 16384; /* octree resolution limit */
28 greg 1.1
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 greg 2.4 double mincusize; /* minimum cube size from resolu */
35 greg 1.1
36 greg 2.12 void (*addobjnotify[])() = {NULL}; /* new object notifier functions */
37 greg 1.7
38 greg 1.1
39     main(argc, argv) /* convert object files to an octree */
40     int argc;
41 greg 2.10 char *argv[];
42 greg 1.1 {
43     FVECT bbmin, bbmax;
44     char *infile = NULL;
45 greg 2.6 int inpfrozen = 0;
46 greg 1.1 int outflags = IO_ALL;
47 greg 2.4 OBJECT startobj;
48 greg 1.1 int i;
49    
50 greg 2.5 progname = argv[0] = fixargv0(argv[0]);
51 greg 1.1
52 greg 1.12 initotypes();
53    
54 greg 1.5 for (i = 1; i < argc && argv[i][0] == '-'; i++)
55 greg 1.1 switch (argv[i][1]) {
56 greg 1.5 case '\0': /* scene from stdin */
57     goto breakopt;
58 greg 1.1 case 'i': /* input octree */
59     infile = argv[++i];
60     break;
61     case 'b': /* bounding cube */
62 greg 1.2 thescene.cuorg[0] = atof(argv[++i]) - OMARGIN;
63     thescene.cuorg[1] = atof(argv[++i]) - OMARGIN;
64     thescene.cuorg[2] = atof(argv[++i]) - OMARGIN;
65     thescene.cusize = atof(argv[++i]) + 2*OMARGIN;
66 greg 1.1 break;
67     case 'n': /* set limit */
68     objlim = atoi(argv[++i]);
69     break;
70     case 'r': /* resolution limit */
71     resolu = atoi(argv[++i]);
72     break;
73     case 'f': /* freeze octree */
74     outflags &= ~IO_FILES;
75     break;
76     case 'w': /* supress warnings */
77     nowarn = 1;
78     break;
79     default:
80     sprintf(errmsg, "unknown option: '%s'", argv[i]);
81     error(USER, errmsg);
82     break;
83     }
84 greg 1.5 breakopt:
85 schorsch 2.15 SET_FILE_BINARY(stdout);
86 greg 1.1 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 greg 2.6 if (nfiles == 0)
91     inpfrozen++;
92 greg 2.8 } else
93     newheader("RADIANCE", stdout); /* new binary file header */
94 greg 2.7 printargs(argc, argv, stdout);
95 greg 1.13 fputformat(OCTFMT, stdout);
96 greg 1.1 printf("\n");
97    
98     startobj = nobjects; /* previous objects already converted */
99 greg 2.5
100 greg 1.4 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     }
109    
110 greg 1.1 ofname[nfiles] = NULL;
111 greg 2.6
112     if (inpfrozen && outflags & IO_FILES) {
113     error(WARNING, "frozen octree");
114     outflags &= ~IO_FILES;
115     }
116 greg 1.1 /* find bounding box */
117     bbmin[0] = bbmin[1] = bbmin[2] = FHUGE;
118     bbmax[0] = bbmax[1] = bbmax[2] = -FHUGE;
119     for (i = startobj; i < nobjects; i++)
120     add2bbox(objptr(i), bbmin, bbmax);
121     /* set/check cube */
122     if (thescene.cusize == 0.0) {
123     if (bbmin[0] <= bbmax[0]) {
124     for (i = 0; i < 3; i++) {
125 greg 1.2 bbmin[i] -= OMARGIN;
126     bbmax[i] += OMARGIN;
127 greg 1.1 }
128     for (i = 0; i < 3; i++)
129     if (bbmax[i] - bbmin[i] > thescene.cusize)
130     thescene.cusize = bbmax[i] - bbmin[i];
131 greg 1.3 for (i = 0; i < 3; i++)
132     thescene.cuorg[i] =
133     (bbmax[i]+bbmin[i]-thescene.cusize)*.5;
134 greg 1.1 }
135     } else {
136     for (i = 0; i < 3; i++)
137     if (bbmin[i] < thescene.cuorg[i] ||
138     bbmax[i] > thescene.cuorg[i] + thescene.cusize)
139     error(USER, "boundary does not encompass scene");
140     }
141    
142     mincusize = thescene.cusize / resolu - FTINY;
143 greg 2.5
144 greg 1.1 for (i = startobj; i < nobjects; i++) /* add new objects */
145     addobject(&thescene, i);
146 greg 2.5
147 greg 1.1 thescene.cutree = combine(thescene.cutree); /* optimize */
148    
149     writeoct(outflags, &thescene, ofname); /* write structures to stdout */
150    
151     quit(0);
152     }
153    
154    
155 greg 2.12 void
156 greg 1.1 quit(code) /* exit program */
157     int code;
158     {
159     exit(code);
160     }
161    
162    
163 greg 2.12 void
164 greg 1.1 cputs() /* interactive error */
165     {
166     /* referenced, but not used */
167     }
168    
169    
170 greg 2.12 void
171 greg 1.1 wputs(s) /* warning message */
172     char *s;
173     {
174     if (!nowarn)
175     eputs(s);
176     }
177    
178    
179 greg 2.12 void
180 greg 1.1 eputs(s) /* put string to stderr */
181     register char *s;
182     {
183 greg 1.9 static int inln = 0;
184 greg 1.1
185 greg 1.9 if (!inln++) {
186 greg 1.1 fputs(progname, stderr);
187     fputs(": ", stderr);
188     }
189     fputs(s, stderr);
190     if (*s && s[strlen(s)-1] == '\n')
191 greg 1.9 inln = 0;
192 greg 1.1 }
193    
194 greg 2.17 /* conflicting def's in param.h */
195     #undef tstbit
196     #undef setbit
197     #undef clrbit
198     #undef tglbit
199 greg 1.1
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 greg 2.13 int inc;
212 greg 1.1
213 greg 2.13 inc = (*ofun[objptr(obj)->otype].funp)(objptr(obj), cu);
214 greg 1.1
215 greg 2.13 if (inc == O_MISS)
216 greg 1.1 return; /* no intersection */
217 greg 2.5
218 greg 1.1 if (istree(cu->cutree)) {
219 greg 2.13 CUBE cukid; /* do children */
220     int i, j;
221 greg 1.1 cukid.cusize = cu->cusize * 0.5;
222     for (i = 0; i < 8; i++) {
223     cukid.cutree = octkid(cu->cutree, i);
224     for (j = 0; j < 3; j++) {
225     cukid.cuorg[j] = cu->cuorg[j];
226     if ((1<<j) & i)
227     cukid.cuorg[j] += cukid.cusize;
228     }
229     addobject(&cukid, obj);
230     octkid(cu->cutree, i) = cukid.cutree;
231     }
232 greg 1.11 return;
233     }
234     if (isempty(cu->cutree)) {
235 greg 2.13 OBJECT oset[2]; /* singular set */
236 greg 1.1 oset[0] = 1; oset[1] = obj;
237     cu->cutree = fullnode(oset);
238 greg 1.11 return;
239     }
240     /* add to full node */
241 greg 2.13 add2full(cu, obj, inc);
242     }
243    
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 greg 1.11 objset(oset, cu->cutree);
257     cukid.cusize = cu->cusize * 0.5;
258 greg 2.5
259 greg 2.13 if (inc==O_IN || oset[0] < objlim || cukid.cusize < mincusize) {
260 greg 1.11 /* add to set */
261     if (oset[0] >= MAXSET) {
262 greg 2.3 sprintf(errmsg, "set overflow in addobject (%s)",
263 greg 1.11 objptr(obj)->oname);
264     error(INTERNAL, errmsg);
265 greg 1.1 }
266 greg 1.11 insertelem(oset, obj);
267     cu->cutree = fullnode(oset);
268     return;
269 greg 1.1 }
270 greg 1.11 /* 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 greg 2.3 (objptr(oset[j]), cu) == O_IN)
282 greg 1.11 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 greg 2.3 /* then partial volumes */
299 greg 1.11 for (j = 1; j <= oset[0]; j++)
300     if (tstbit(volflg,j-1) &&
301     !tstbit(inflg,j-1))
302     addobject(&cukid, oset[j]);
303 greg 2.3 /* full volumes last */
304 greg 1.11 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 greg 1.1 }