7 |
|
* Declarations of external symbols in ambient.h |
8 |
|
*/ |
9 |
|
|
10 |
< |
/* ==================================================================== |
11 |
< |
* The Radiance Software License, Version 1.0 |
12 |
< |
* |
13 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
14 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
15 |
< |
* |
16 |
< |
* Redistribution and use in source and binary forms, with or without |
17 |
< |
* modification, are permitted provided that the following conditions |
18 |
< |
* are met: |
19 |
< |
* |
20 |
< |
* 1. Redistributions of source code must retain the above copyright |
21 |
< |
* notice, this list of conditions and the following disclaimer. |
22 |
< |
* |
23 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
24 |
< |
* notice, this list of conditions and the following disclaimer in |
25 |
< |
* the documentation and/or other materials provided with the |
26 |
< |
* distribution. |
27 |
< |
* |
28 |
< |
* 3. The end-user documentation included with the redistribution, |
29 |
< |
* if any, must include the following acknowledgment: |
30 |
< |
* "This product includes Radiance software |
31 |
< |
* (http://radsite.lbl.gov/) |
32 |
< |
* developed by the Lawrence Berkeley National Laboratory |
33 |
< |
* (http://www.lbl.gov/)." |
34 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
35 |
< |
* if and wherever such third-party acknowledgments normally appear. |
36 |
< |
* |
37 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
38 |
< |
* and "The Regents of the University of California" must |
39 |
< |
* not be used to endorse or promote products derived from this |
40 |
< |
* software without prior written permission. For written |
41 |
< |
* permission, please contact [email protected]. |
42 |
< |
* |
43 |
< |
* 5. Products derived from this software may not be called "Radiance", |
44 |
< |
* nor may "Radiance" appear in their name, without prior written |
45 |
< |
* permission of Lawrence Berkeley National Laboratory. |
46 |
< |
* |
47 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
48 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
49 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
50 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
51 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
52 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
53 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
54 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
55 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
56 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
57 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
58 |
< |
* SUCH DAMAGE. |
59 |
< |
* ==================================================================== |
60 |
< |
* |
61 |
< |
* This software consists of voluntary contributions made by many |
62 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
63 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
64 |
< |
* <http://www.lbl.gov/>. |
65 |
< |
*/ |
10 |
> |
#include "copyright.h" |
11 |
|
|
12 |
|
#include "ray.h" |
13 |
|
|
34 |
|
{ |
35 |
|
register int c; |
36 |
|
|
37 |
< |
if (c = d1->t - d2->t) |
37 |
> |
if ( (c = d1->t - d2->t) ) |
38 |
|
return(c); |
39 |
|
return(d1->p - d2->p); |
40 |
|
} |
142 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
143 |
|
/* super-sample */ |
144 |
|
for (i = ns; i > 0; i--) { |
145 |
< |
copystruct(&dnew, div); |
145 |
> |
dnew = *div; |
146 |
|
if (divsample(&dnew, &hemi, r) < 0) |
147 |
|
goto oopsy; |
148 |
|
/* reinsert */ |
149 |
|
dp = div; |
150 |
|
j = ndivs < i ? ndivs : i; |
151 |
|
while (--j > 0 && dnew.k < dp[1].k) { |
152 |
< |
copystruct(dp, dp+1); |
152 |
> |
*dp = *(dp+1); |
153 |
|
dp++; |
154 |
|
} |
155 |
< |
copystruct(dp, &dnew); |
155 |
> |
*dp = dnew; |
156 |
|
} |
157 |
|
if (pg != NULL || dg != NULL) /* restore order */ |
158 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambnorm); |
230 |
|
{ |
231 |
|
register int i; |
232 |
|
/* set number of divisions */ |
288 |
– |
if (wt < (.25*PI)/ambdiv+FTINY) { |
289 |
– |
hp->nt = hp->np = 0; |
290 |
– |
return; /* zero samples */ |
291 |
– |
} |
233 |
|
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
234 |
+ |
i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */ |
235 |
+ |
if (hp->nt < i) |
236 |
+ |
hp->nt = i; |
237 |
|
hp->np = PI * hp->nt + 0.5; |
238 |
|
/* make axes */ |
239 |
|
VCOPY(hp->uz, r->ron); |