| 1 |
#ifndef lint
|
| 2 |
static const char RCSid[] = "$Id$";
|
| 3 |
#endif
|
| 4 |
/*
|
| 5 |
* Binary space partitioning curve for multidimensional sampling.
|
| 6 |
*
|
| 7 |
* Written by Christophe Schlick
|
| 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 |
*/
|
| 66 |
|
| 67 |
#include "random.h"
|
| 68 |
|
| 69 |
void
|
| 70 |
multisamp(t, n, r) /* convert 1-dimensional sample to N dimensions */
|
| 71 |
double t[]; /* returned N-dimensional vector */
|
| 72 |
register int n; /* number of dimensions */
|
| 73 |
double r; /* 1-dimensional sample [0,1) */
|
| 74 |
{
|
| 75 |
int j;
|
| 76 |
register int i, k;
|
| 77 |
int ti[8];
|
| 78 |
double s;
|
| 79 |
|
| 80 |
i = n;
|
| 81 |
while (i-- > 0)
|
| 82 |
ti[i] = 0;
|
| 83 |
j = 8;
|
| 84 |
while (j--) {
|
| 85 |
k = s = r*(1<<n);
|
| 86 |
r = s - k;
|
| 87 |
i = n;
|
| 88 |
while (i-- > 0)
|
| 89 |
ti[i] += ti[i] + ((k>>i) & 1);
|
| 90 |
}
|
| 91 |
i = n;
|
| 92 |
while (i-- > 0)
|
| 93 |
t[i] = 1./256. * (ti[i] + frandom());
|
| 94 |
}
|