Shadowrun: Awakened 29 September 2011 - Build 871
box.cpp
Go to the documentation of this file.
00001 /*
00002     Copyright 2005-2010 Intel Corporation.  All Rights Reserved.
00003 
00004     This file is part of Threading Building Blocks.
00005 
00006     Threading Building Blocks is free software; you can redistribute it
00007     and/or modify it under the terms of the GNU General Public License
00008     version 2 as published by the Free Software Foundation.
00009 
00010     Threading Building Blocks is distributed in the hope that it will be
00011     useful, but WITHOUT ANY WARRANTY; without even the implied warranty
00012     of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00013     GNU General Public License for more details.
00014 
00015     You should have received a copy of the GNU General Public License
00016     along with Threading Building Blocks; if not, write to the Free Software
00017     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
00018 
00019     As a special exception, you may use this file as part of a free software
00020     library without restriction.  Specifically, if other files instantiate
00021     templates or use macros or inline functions from this file, or you compile
00022     this file and link it with other files to produce an executable, this
00023     file does not by itself cause the resulting executable to be covered by
00024     the GNU General Public License.  This exception does not however
00025     invalidate any other reasons why the executable file might be covered by
00026     the GNU General Public License.
00027 */
00028 
00029 /*
00030     The original source for this example is
00031     Copyright (c) 1994-2008 John E. Stone
00032     All rights reserved.
00033 
00034     Redistribution and use in source and binary forms, with or without
00035     modification, are permitted provided that the following conditions
00036     are met:
00037     1. Redistributions of source code must retain the above copyright
00038        notice, this list of conditions and the following disclaimer.
00039     2. Redistributions in binary form must reproduce the above copyright
00040        notice, this list of conditions and the following disclaimer in the
00041        documentation and/or other materials provided with the distribution.
00042     3. The name of the author may not be used to endorse or promote products
00043        derived from this software without specific prior written permission.
00044 
00045     THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
00046     OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
00047     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00048     ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
00049     DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00050     DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
00051     OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00052     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00053     LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
00054     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
00055     SUCH DAMAGE.
00056 */
00057 
00058 /* 
00059  * box.c - This file contains the functions for dealing with boxes.
00060  *
00061  *  $Id: box.cpp,v 1.2 2007-02-22 17:54:15 dpoulsen Exp $
00062  */
00063  
00064 #include "machine.h"
00065 #include "types.h"
00066 #include "macros.h"
00067 #include "box.h"
00068 #include "vector.h"
00069 #include "intersect.h"
00070 #include "util.h"
00071 
00072 int box_bbox(void * obj, vector * min, vector * max) {
00073   box * b = (box *) obj;
00074 
00075   *min = b->min;
00076   *max = b->max;
00077 
00078   return 1;
00079 }
00080 
00081 static object_methods box_methods = {
00082   (void (*)(void *, void *))(box_intersect),
00083   (void (*)(void *, void *, void *, void *))(box_normal),
00084   box_bbox, 
00085   free 
00086 };
00087 
00088 box * newbox(void * tex, vector min, vector max) {
00089   box * b;
00090   
00091   b=(box *) rt_getmem(sizeof(box));
00092   memset(b, 0, sizeof(box));
00093   b->methods = &box_methods;
00094   b->tex = (texture *)tex;
00095   b->min = min; 
00096   b->max = max;
00097 
00098   return b;
00099 }
00100 
00101 void box_intersect(box * bx, ray * ry) {
00102   flt a, tx1, tx2, ty1, ty2, tz1, tz2;
00103   flt tnear, tfar;
00104 
00105   tnear= -FHUGE;
00106   tfar= FHUGE;
00107 
00108   if (ry->d.x == 0.0) {
00109     if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x)) return;
00110   }
00111   else {
00112     tx1 = (bx->min.x - ry->o.x) / ry->d.x;
00113     tx2 = (bx->max.x - ry->o.x) / ry->d.x;
00114     if (tx1 > tx2) { a=tx1; tx1=tx2; tx2=a; } 
00115     if (tx1 > tnear) tnear=tx1;   
00116     if (tx2 < tfar)   tfar=tx2;   
00117   } 
00118   if (tnear > tfar) return; 
00119   if (tfar < 0.0) return;
00120   
00121   if (ry->d.y == 0.0) { 
00122     if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y)) return;
00123   }
00124   else {
00125     ty1 = (bx->min.y - ry->o.y) / ry->d.y;
00126     ty2 = (bx->max.y - ry->o.y) / ry->d.y;
00127     if (ty1 > ty2) { a=ty1; ty1=ty2; ty2=a; } 
00128     if (ty1 > tnear) tnear=ty1;   
00129     if (ty2 < tfar)   tfar=ty2;   
00130   }
00131   if (tnear > tfar) return; 
00132   if (tfar < 0.0) return;
00133  
00134   if (ry->d.z == 0.0) { 
00135     if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z)) return;
00136   }
00137   else {
00138     tz1 = (bx->min.z - ry->o.z) / ry->d.z;
00139     tz2 = (bx->max.z - ry->o.z) / ry->d.z;
00140     if (tz1 > tz2) { a=tz1; tz1=tz2; tz2=a; } 
00141     if (tz1 > tnear) tnear=tz1;   
00142     if (tz2 < tfar)   tfar=tz2;   
00143   }
00144   if (tnear > tfar) return; 
00145   if (tfar < 0.0) return;
00146 
00147   add_intersection(tnear, (object *) bx, ry);
00148   add_intersection(tfar, (object *) bx, ry);
00149 }
00150 
00151 void box_normal(box * bx, vector  * pnt, ray * incident, vector * N) {
00152   vector a, b, c; 
00153   flt t;
00154  
00155   c.x=(bx->max.x + bx->min.x) / 2.0;
00156   c.y=(bx->max.y + bx->min.y) / 2.0;
00157   c.z=(bx->max.z + bx->min.z) / 2.0;
00158  
00159   VSub((vector *) pnt, &c, N);
00160   b=(*N);
00161 
00162   a.x=fabs(N->x);
00163   a.y=fabs(N->y);
00164   a.z=fabs(N->z);
00165  
00166   N->x=0.0;  N->y=0.0;  N->z=0.0;
00167 
00168   t=MYMAX(a.x, MYMAX(a.y, a.z));  
00169 
00170   if (t==a.x) N->x=b.x;  
00171 
00172   if (t==a.y) N->y=b.y; 
00173 
00174   if (t==a.z) N->z=b.z;
00175 
00176   VNorm(N);
00177 }
00178 

Copyright © 2007-2010 by The Shadowrun: Awakened Team. This work is licensed under the GNU Lesser General Public License 3.

GNU Lesser General Public License 3 Sourceforge.net