ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/Development/ray/src/rt/virtuals.c

Comparing ray/src/rt/virtuals.c (file contents):
Revision 1.17 by greg, Tue Jul 16 15:56:51 1991 UTC vs.
Revision 2.7 by greg, Sat Feb 22 02:07:29 2003 UTC

#	Line 1 | Line 1
1	–	/* Copyright (c) 1991 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		* Routines for simulating virtual light sources
6		*      Thus far, we only support planar mirrors.
7	+	*
8	+	*  External symbols declared in source.h
9		*/
10
11	+	/* ====================================================================
12	+	* The Radiance Software License, Version 1.0
13	+	*
14	+	* Copyright (c) 1990 - 2002 The Regents of the University of California,
15	+	* through Lawrence Berkeley National Laboratory.   All rights reserved.
16	+	*
17	+	* Redistribution and use in source and binary forms, with or without
18	+	* modification, are permitted provided that the following conditions
19	+	* are met:
20	+	*
21	+	* 1. Redistributions of source code must retain the above copyright
22	+	*         notice, this list of conditions and the following disclaimer.
23	+	*
24	+	* 2. Redistributions in binary form must reproduce the above copyright
25	+	*       notice, this list of conditions and the following disclaimer in
26	+	*       the documentation and/or other materials provided with the
27	+	*       distribution.
28	+	*
29	+	* 3. The end-user documentation included with the redistribution,
30	+	*           if any, must include the following acknowledgment:
31	+	*             "This product includes Radiance software
32	+	*                 (http://radsite.lbl.gov/)
33	+	*                 developed by the Lawrence Berkeley National Laboratory
34	+	*               (http://www.lbl.gov/)."
35	+	*       Alternately, this acknowledgment may appear in the software itself,
36	+	*       if and wherever such third-party acknowledgments normally appear.
37	+	*
38	+	* 4. The names "Radiance," "Lawrence Berkeley National Laboratory"
39	+	*       and "The Regents of the University of California" must
40	+	*       not be used to endorse or promote products derived from this
41	+	*       software without prior written permission. For written
42	+	*       permission, please contact [email protected].
43	+	*
44	+	* 5. Products derived from this software may not be called "Radiance",
45	+	*       nor may "Radiance" appear in their name, without prior written
46	+	*       permission of Lawrence Berkeley National Laboratory.
47	+	*
48	+	* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
49	+	* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
50	+	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
51	+	* DISCLAIMED.   IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR
52	+	* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
53	+	* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
54	+	* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
55	+	* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
56	+	* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
57	+	* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
58	+	* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59	+	* SUCH DAMAGE.
60	+	* ====================================================================
61	+	*
62	+	* This software consists of voluntary contributions made by many
63	+	* individuals on behalf of Lawrence Berkeley National Laboratory.   For more
64	+	* information on Lawrence Berkeley National Laboratory, please see
65	+	* <http://www.lbl.gov/>.
66	+	*/
67	+
68		#include  "ray.h"
69
14	–	#include  "octree.h"
15	–
70		#include  "otypes.h"
71
72		#include  "source.h"
73
74		#include  "random.h"
75
76	<	#define  MINSAMPLES     5               /* minimum number of pretest samples */
77	<	#define  STESTMAX       30              /* maximum seeks per sample */
76	>	#define  MINSAMPLES     16              /* minimum number of pretest samples */
77	>	#define  STESTMAX       32              /* maximum seeks per sample */
78
79
26	–	double  getdisk();
27	–
80		static OBJECT  *vobject;                /* virtual source objects */
81		static int  nvobjects = 0;              /* number of virtual source objects */
82
83
84	+	void
85		markvirtuals()                  /* find and mark virtual sources */
86		{
87		register OBJREC  *o;
#	Line 41 | Line 94 | markvirtuals()                 /* find and mark virtual sources */
94		o = objptr(i);
95		if (!issurface(o->otype) || o->omod == OVOID)
96		continue;
97	<	if (!isvlight(objptr(o->omod)->otype))
97	>	if (!isvlight(vsmaterial(o)->otype))
98		continue;
99		if (sfun[o->otype].of == NULL ||
100	<	sfun[o->otype].of->getpleq == NULL)
101	<	objerror(o, USER, "illegal material");
100	>	sfun[o->otype].of->getpleq == NULL) {
101	>	objerror(o,WARNING,"secondary sources not supported");
102	>	continue;
103	>	}
104		if (nvobjects == 0)
105		vobject = (OBJECT *)malloc(sizeof(OBJECT));
106		else
#	Line 64 | Line 119 | markvirtuals()                 /* find and mark virtual sources */
119		for (i = nsources; i-- > 0; )
120		addvirtuals(i, directrelay);
121		/* done with our object list */
122	<	free((char *)vobject);
122	>	free((void *)vobject);
123		nvobjects = 0;
124		}
125
126
127	+	void
128		addvirtuals(sn, nr)             /* add virtuals associated with source */
129		int  sn;
130		int  nr;
#	Line 86 | Line 142 | int  nr;
142		}
143
144
145	+	void
146		vproject(o, sn, n)              /* create projected source(s) if they exist */
147		OBJREC  *o;
148		int  sn;
#	Line 99 | Line 156 | int  n;
156		if (o == source[sn].so) /* objects cannot project themselves */
157		return;
158		/* get virtual source material */
159	<	vsmat = sfun[objptr(o->omod)->otype].mf;
159	>	vsmat = sfun[vsmaterial(o)->otype].mf;
160		/* project virtual sources */
161		for (i = 0; i < vsmat->nproj; i++)
162		if ((*vsmat->vproj)(proj, o, &source[sn], i))
#	Line 113 | Line 170 | int  n;
170		}
171
172
173	+	OBJREC *
174	+	vsmaterial(o)                   /* get virtual source material pointer */
175	+	OBJREC  *o;
176	+	{
177	+	register int  i;
178	+	register OBJREC  *m;
179	+
180	+	i = o->omod;
181	+	m = objptr(i);
182	+	if (m->otype != MAT_ILLUM || m->oargs.nsargs < 1 ||
183	+	!strcmp(m->oargs.sarg[0], VOIDID) ||
184	+	(i = lastmod(objndx(m), m->oargs.sarg[0])) == OVOID)
185	+	return(m);              /* direct modifier */
186	+	return(objptr(i));              /* illum alternate */
187	+	}
188	+
189	+
190		int
191		makevsrc(op, sn, pm)            /* make virtual source if reasonable */
192		OBJREC  *op;
#	Line 138 | Line 212 | MAT4  pm;
212		normalize(nsloc);
213		VCOPY(ourspot.aim, ocent);
214		ourspot.siz = PI*maxrad2;
215	<	ourspot.flen = 0.;
215	>	ourspot.flen = -1.;
216		if (source[sn].sflags & SSPOT) {
143	–	copystruct(&theirspot, source[sn].sl.s);
217		multp3(theirspot.aim, source[sn].sl.s->aim, pm);
218	+	/* adjust for source size */
219	+	d = sqrt(dist2(ourspot.aim, theirspot.aim));
220	+	d = sqrt(source[sn].sl.s->siz/PI) + d*source[sn].srad;
221	+	theirspot.siz = PI*d*d;
222	+	ourspot.flen = theirspot.flen = source[sn].sl.s->flen;
223		d = ourspot.siz;
224		if (!commonbeam(&ourspot, &theirspot, nsloc))
225		return(-1);     /* no overlap */
#	Line 164 | Line 242 | MAT4  pm;
242		if (source[sn].sflags & SPROX && d > source[sn].sl.prox)
243		return(-1);             /* too far away */
244		ourspot.flen = 0.;
245	<	if (d*d > maxrad2)
246	<	ourspot.siz = 2.*PI*(1. - sqrt(1.-maxrad2/(d*d)));
245	>	/* adjust for source size */
246	>	d = (sqrt(maxrad2) + source[sn].srad) / d;
247	>	if (d < 1.-FTINY)
248	>	ourspot.siz = 2.*PI*(1. - sqrt(1.-d*d));
249		else
250		nsflags &= ~SSPOT;
251		if (source[sn].sflags & SSPOT) {
#	Line 195 | Line 275 | MAT4  pm;
275		if (source[sn].sflags & SFLAT) {        /* behind source? */
276		multv3(nsnorm, source[sn].snorm, pm);
277		normalize(nsnorm);
278	<	if (!checkspot(&ourspot, nsnorm))
278	>	if (nsflags & SSPOT && !checkspot(&ourspot, nsnorm))
279		return(-1);
280		}
281		}
#	Line 208 | Line 288 | MAT4  pm;
288		goto memerr;
289		source[i].sflags = nsflags;
290		VCOPY(source[i].sloc, nsloc);
291	+	multv3(source[i].ss[SU], source[sn].ss[SU], pm);
292	+	multv3(source[i].ss[SV], source[sn].ss[SV], pm);
293		if (nsflags & SFLAT)
294		VCOPY(source[i].snorm, nsnorm);
295	<	source[i].ss = source[sn].ss; source[i].ss2 = source[sn].ss2;
295	>	else
296	>	multv3(source[i].ss[SW], source[sn].ss[SW], pm);
297	>	source[i].srad = source[sn].srad;
298	>	source[i].ss2 = source[sn].ss2;
299		if (nsflags & SSPOT) {
300		if ((source[i].sl.s = (SPOT *)malloc(sizeof(SPOT))) == NULL)
301		goto memerr;
#	Line 269 | Line 354 | register int  sn;      /* target source number */
354		RAY  sr;
355		FVECT  onorm;
356		FVECT  offsdir;
357	+	SRCINDEX  si;
358		double  or, d;
273	–	int  infront;
359		int  stestlim, ssn;
360		int  nhit, nok;
361		register int  i, n;
#	Line 281 | Line 366 | register int  sn;      /* target source number */
366		getplaneq(onorm, o);
367		/* set number of rays to sample */
368		if (source[sn].sflags & SDISTANT) {
369	<	n = (2./3.*PI*PI)*or2/(thescene.cusize*thescene.cusize)*
370	<	vspretest + .5;
286	<	infront = DOT(onorm, source[sn].sloc) > 0.;
369	>	/* 32. == heuristic constant */
370	>	n = 32.*or2/(thescene.cusize*thescene.cusize)*vspretest + .5;
371		} else {
372		for (i = 0; i < 3; i++)
373		offsdir[i] = source[sn].sloc[i] - oc[i];
374	<	n = or2/DOT(offsdir,offsdir)*vspretest + .5;
375	<	infront = DOT(onorm, offsdir) > 0.;
374	>	d = DOT(offsdir,offsdir);
375	>	if (d <= FTINY)
376	>	n = 2.*PI * vspretest + .5;
377	>	else
378	>	n = 2.*PI * (1.-sqrt(1./(1.+or2/d)))*vspretest + .5;
379		}
380		if (n < MINSAMPLES) n = MINSAMPLES;
381		#ifdef DEBUG
#	Line 300 | Line 387 | register int  sn;      /* target source number */
387		stestlim = n*STESTMAX;
388		ssn = 0;
389		nhit = nok = 0;
390	+	initsrcindex(&si);
391		while (n-- > 0) {
392		/* get sample point */
393		do {
#	Line 309 | Line 397 | register int  sn;      /* target source number */
397		#endif
398		return(f);      /* too small a target! */
399		}
400	+	multisamp(offsdir, 3, urand(sn*931+5827+ssn));
401		for (i = 0; i < 3; i++)
402	<	offsdir[i] = or*(1. -
314	<	2.*urand(urind(931*i+5827,ssn)));
402	>	offsdir[i] = or*(1. - 2.*offsdir[i]);
403		ssn++;
404	<	for (i = 0; i < 3; i++)
405	<	sr.rorg[i] = oc[i] + offsdir[i];
406	<	d = DOT(offsdir,onorm);
407	<	if (infront)
408	<	for (i = 0; i < 3; i++) {
409	<	sr.rorg[i] -= (d-.0001)*onorm[i];
322	<	sr.rdir[i] = -onorm[i];
323	<	}
324	<	else
325	<	for (i = 0; i < 3; i++) {
326	<	sr.rorg[i] -= (d+.0001)*onorm[i];
327	<	sr.rdir[i] = onorm[i];
328	<	}
404	>	d = 1. - DOT(offsdir, onorm);
405	>	for (i = 0; i < 3; i++) {
406	>	sr.rorg[i] = oc[i] + offsdir[i] + d*onorm[i];
407	>	sr.rdir[i] = -onorm[i];
408	>	}
409	>	sr.rmax = 0.0;
410		rayorigin(&sr, NULL, PRIMARY, 1.0);
411		} while (!(*ofun[o->otype].funp)(o, &sr));
412		/* check against source */
413	+	VCOPY(sr.rorg, sr.rop); /* starting from intersection */
414		samplendx++;
415	<	if (srcray(&sr, NULL, sn) == 0.)
416	<	continue;
415	>	if (si.sp >= si.np-1 ||
416	>	!srcray(&sr, NULL, &si) || sr.rsrc != sn) {
417	>	si.sn = sn-1;           /* reset index to our source */
418	>	si.np = 0;
419	>	if (!srcray(&sr, NULL, &si) || sr.rsrc != sn)
420	>	continue;       /* can't get there from here */
421	>	}
422		sr.revf = srcvalue;
423	<	rayvalue(&sr);
423	>	rayvalue(&sr);                  /* check sample validity */
424		if (bright(sr.rcol) <= FTINY)
425		continue;
426	<	nok++;
427	<	/* check against obstructions */
428	<	srcray(&sr, NULL, sn);
426	>	nok++;                  /* got sample; check obstructions */
427	>	rayclear(&sr);
428	>	sr.revf = raytrace;
429		rayvalue(&sr);
430		if (bright(sr.rcol) > FTINY)
431		nhit++;
#	Line 363 | Line 450 | register int  sn;      /* target source number */
450
451
452		#ifdef DEBUG
453	+	void
454		virtverb(sn, fp)        /* print verbose description of virtual source */
455		register int  sn;
456		FILE  *fp;

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines (old)
>	Changed lines (new)