| 1 |
greg |
1.1 |
#ifndef lint |
| 2 |
greg |
2.2 |
static const char RCSid[] = "$Id$"; |
| 3 |
greg |
1.1 |
#endif |
| 4 |
|
|
/* |
| 5 |
|
|
* bbox.c - routines for bounding box computation. |
| 6 |
greg |
2.2 |
*/ |
| 7 |
|
|
|
| 8 |
|
|
/* ==================================================================== |
| 9 |
|
|
* The Radiance Software License, Version 1.0 |
| 10 |
|
|
* |
| 11 |
|
|
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
| 12 |
|
|
* through Lawrence Berkeley National Laboratory. All rights reserved. |
| 13 |
|
|
* |
| 14 |
|
|
* Redistribution and use in source and binary forms, with or without |
| 15 |
|
|
* modification, are permitted provided that the following conditions |
| 16 |
|
|
* are met: |
| 17 |
|
|
* |
| 18 |
|
|
* 1. Redistributions of source code must retain the above copyright |
| 19 |
|
|
* notice, this list of conditions and the following disclaimer. |
| 20 |
greg |
1.1 |
* |
| 21 |
greg |
2.2 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 22 |
|
|
* notice, this list of conditions and the following disclaimer in |
| 23 |
|
|
* the documentation and/or other materials provided with the |
| 24 |
|
|
* distribution. |
| 25 |
|
|
* |
| 26 |
|
|
* 3. The end-user documentation included with the redistribution, |
| 27 |
|
|
* if any, must include the following acknowledgment: |
| 28 |
|
|
* "This product includes Radiance software |
| 29 |
|
|
* (http://radsite.lbl.gov/) |
| 30 |
|
|
* developed by the Lawrence Berkeley National Laboratory |
| 31 |
|
|
* (http://www.lbl.gov/)." |
| 32 |
|
|
* Alternately, this acknowledgment may appear in the software itself, |
| 33 |
|
|
* if and wherever such third-party acknowledgments normally appear. |
| 34 |
|
|
* |
| 35 |
|
|
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
| 36 |
|
|
* and "The Regents of the University of California" must |
| 37 |
|
|
* not be used to endorse or promote products derived from this |
| 38 |
|
|
* software without prior written permission. For written |
| 39 |
|
|
* permission, please contact [email protected]. |
| 40 |
|
|
* |
| 41 |
|
|
* 5. Products derived from this software may not be called "Radiance", |
| 42 |
|
|
* nor may "Radiance" appear in their name, without prior written |
| 43 |
|
|
* permission of Lawrence Berkeley National Laboratory. |
| 44 |
|
|
* |
| 45 |
|
|
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
| 46 |
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 47 |
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 48 |
|
|
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
| 49 |
|
|
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 50 |
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 51 |
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
| 52 |
|
|
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| 53 |
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| 54 |
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
| 55 |
|
|
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 56 |
|
|
* SUCH DAMAGE. |
| 57 |
|
|
* ==================================================================== |
| 58 |
|
|
* |
| 59 |
|
|
* This software consists of voluntary contributions made by many |
| 60 |
|
|
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
| 61 |
|
|
* information on Lawrence Berkeley National Laboratory, please see |
| 62 |
|
|
* <http://www.lbl.gov/>. |
| 63 |
greg |
1.1 |
*/ |
| 64 |
|
|
|
| 65 |
|
|
#include "standard.h" |
| 66 |
|
|
|
| 67 |
|
|
#include "object.h" |
| 68 |
greg |
2.2 |
|
| 69 |
|
|
#include "octree.h" |
| 70 |
greg |
1.1 |
|
| 71 |
|
|
#include "otypes.h" |
| 72 |
|
|
|
| 73 |
|
|
#include "face.h" |
| 74 |
|
|
|
| 75 |
|
|
#include "cone.h" |
| 76 |
|
|
|
| 77 |
|
|
#include "instance.h" |
| 78 |
|
|
|
| 79 |
|
|
|
| 80 |
|
|
add2bbox(o, bbmin, bbmax) /* expand bounding box to fit object */ |
| 81 |
|
|
register OBJREC *o; |
| 82 |
|
|
FVECT bbmin, bbmax; |
| 83 |
|
|
{ |
| 84 |
greg |
1.2 |
CONE *co; |
| 85 |
|
|
FACE *fo; |
| 86 |
|
|
INSTANCE *io; |
| 87 |
greg |
1.1 |
FVECT v; |
| 88 |
|
|
register int i, j; |
| 89 |
|
|
|
| 90 |
|
|
switch (o->otype) { |
| 91 |
|
|
case OBJ_SPHERE: |
| 92 |
|
|
case OBJ_BUBBLE: |
| 93 |
|
|
if (o->oargs.nfargs != 4) |
| 94 |
|
|
objerror(o, USER, "bad arguments"); |
| 95 |
|
|
for (i = 0; i < 3; i++) { |
| 96 |
|
|
VCOPY(v, o->oargs.farg); |
| 97 |
|
|
v[i] -= o->oargs.farg[3]; |
| 98 |
|
|
point2bbox(v, bbmin, bbmax); |
| 99 |
|
|
v[i] += 2.0 * o->oargs.farg[3]; |
| 100 |
|
|
point2bbox(v, bbmin, bbmax); |
| 101 |
|
|
} |
| 102 |
|
|
break; |
| 103 |
|
|
case OBJ_FACE: |
| 104 |
|
|
fo = getface(o); |
| 105 |
|
|
j = fo->nv; |
| 106 |
|
|
while (j--) |
| 107 |
|
|
point2bbox(VERTEX(fo,j), bbmin, bbmax); |
| 108 |
|
|
break; |
| 109 |
|
|
case OBJ_CONE: |
| 110 |
|
|
case OBJ_CUP: |
| 111 |
|
|
case OBJ_CYLINDER: |
| 112 |
|
|
case OBJ_TUBE: |
| 113 |
|
|
case OBJ_RING: |
| 114 |
|
|
co = getcone(o, 0); |
| 115 |
|
|
if (o->otype != OBJ_RING) |
| 116 |
|
|
circle2bbox(CO_P0(co), co->ad, CO_R0(co), bbmin, bbmax); |
| 117 |
|
|
circle2bbox(CO_P1(co), co->ad, CO_R1(co), bbmin, bbmax); |
| 118 |
|
|
break; |
| 119 |
|
|
case OBJ_INSTANCE: |
| 120 |
greg |
1.3 |
io = getinstance(o, IO_BOUNDS); |
| 121 |
greg |
1.1 |
for (j = 0; j < 8; j++) { |
| 122 |
|
|
for (i = 0; i < 3; i++) { |
| 123 |
|
|
v[i] = io->obj->scube.cuorg[i]; |
| 124 |
|
|
if (j & 1<<i) |
| 125 |
|
|
v[i] += io->obj->scube.cusize; |
| 126 |
|
|
} |
| 127 |
greg |
1.4 |
multp3(v, v, io->x.f.xfm); |
| 128 |
greg |
1.1 |
point2bbox(v, bbmin, bbmax); |
| 129 |
|
|
} |
| 130 |
|
|
break; |
| 131 |
|
|
} |
| 132 |
|
|
} |
| 133 |
|
|
|
| 134 |
|
|
|
| 135 |
|
|
point2bbox(p, bbmin, bbmax) /* expand bounding box to fit point */ |
| 136 |
|
|
register FVECT p, bbmin, bbmax; |
| 137 |
|
|
{ |
| 138 |
|
|
register int i; |
| 139 |
|
|
|
| 140 |
|
|
for (i = 0; i < 3; i++) { |
| 141 |
|
|
if (p[i] < bbmin[i]) |
| 142 |
|
|
bbmin[i] = p[i]; |
| 143 |
|
|
if (p[i] > bbmax[i]) |
| 144 |
|
|
bbmax[i] = p[i]; |
| 145 |
|
|
} |
| 146 |
|
|
} |
| 147 |
|
|
|
| 148 |
|
|
|
| 149 |
|
|
circle2bbox(cent, norm, rad, bbmin, bbmax) /* expand bbox to fit circle */ |
| 150 |
|
|
FVECT cent, norm; |
| 151 |
|
|
double rad; |
| 152 |
|
|
FVECT bbmin, bbmax; |
| 153 |
|
|
{ |
| 154 |
|
|
FVECT v1, v2; |
| 155 |
|
|
register int i, j; |
| 156 |
|
|
|
| 157 |
|
|
for (i = 0; i < 3; i++) { |
| 158 |
|
|
v1[0] = v1[1] = v1[2] = 0; |
| 159 |
|
|
v1[i] = 1.0; |
| 160 |
|
|
fcross(v2, norm, v1); |
| 161 |
|
|
if (normalize(v2) == 0.0) |
| 162 |
|
|
continue; |
| 163 |
|
|
for (j = 0; j < 3; j++) |
| 164 |
|
|
v1[j] = cent[j] + rad*v2[j]; |
| 165 |
|
|
point2bbox(v1, bbmin, bbmax); |
| 166 |
|
|
for (j = 0; j < 3; j++) |
| 167 |
|
|
v1[j] = cent[j] - rad*v2[j]; |
| 168 |
|
|
point2bbox(v1, bbmin, bbmax); |
| 169 |
|
|
} |
| 170 |
|
|
} |