ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/ot/oconv.c
Revision: 1.11
Committed: Wed Aug 29 21:56:17 1990 UTC (33 years, 7 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 1.10: +69 -52 lines
Log Message:
the final solution (hopefully) to volumes

File Contents

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