1d86ed7fbStbbdev /*
2*b15aabb3Stbbdev Copyright (c) 2005-2021 Intel Corporation
3d86ed7fbStbbdev
4d86ed7fbStbbdev Licensed under the Apache License, Version 2.0 (the "License");
5d86ed7fbStbbdev you may not use this file except in compliance with the License.
6d86ed7fbStbbdev You may obtain a copy of the License at
7d86ed7fbStbbdev
8d86ed7fbStbbdev http://www.apache.org/licenses/LICENSE-2.0
9d86ed7fbStbbdev
10d86ed7fbStbbdev Unless required by applicable law or agreed to in writing, software
11d86ed7fbStbbdev distributed under the License is distributed on an "AS IS" BASIS,
12d86ed7fbStbbdev WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13d86ed7fbStbbdev See the License for the specific language governing permissions and
14d86ed7fbStbbdev limitations under the License.
15d86ed7fbStbbdev */
16d86ed7fbStbbdev
17d86ed7fbStbbdev /*
18d86ed7fbStbbdev The original source for this example is
19d86ed7fbStbbdev Copyright (c) 1994-2008 John E. Stone
20d86ed7fbStbbdev All rights reserved.
21d86ed7fbStbbdev
22d86ed7fbStbbdev Redistribution and use in source and binary forms, with or without
23d86ed7fbStbbdev modification, are permitted provided that the following conditions
24d86ed7fbStbbdev are met:
25d86ed7fbStbbdev 1. Redistributions of source code must retain the above copyright
26d86ed7fbStbbdev notice, this list of conditions and the following disclaimer.
27d86ed7fbStbbdev 2. Redistributions in binary form must reproduce the above copyright
28d86ed7fbStbbdev notice, this list of conditions and the following disclaimer in the
29d86ed7fbStbbdev documentation and/or other materials provided with the distribution.
30d86ed7fbStbbdev 3. The name of the author may not be used to endorse or promote products
31d86ed7fbStbbdev derived from this software without specific prior written permission.
32d86ed7fbStbbdev
33d86ed7fbStbbdev THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
34d86ed7fbStbbdev OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
35d86ed7fbStbbdev WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36d86ed7fbStbbdev ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
37d86ed7fbStbbdev DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38d86ed7fbStbbdev DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39d86ed7fbStbbdev OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40d86ed7fbStbbdev HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41d86ed7fbStbbdev LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42d86ed7fbStbbdev OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43d86ed7fbStbbdev SUCH DAMAGE.
44d86ed7fbStbbdev */
45d86ed7fbStbbdev
46d86ed7fbStbbdev /*
47d86ed7fbStbbdev * box.cpp - This file contains the functions for dealing with boxes.
48d86ed7fbStbbdev */
49d86ed7fbStbbdev
50d86ed7fbStbbdev #include "machine.hpp"
51d86ed7fbStbbdev #include "types.hpp"
52d86ed7fbStbbdev #include "macros.hpp"
53d86ed7fbStbbdev #include "box.hpp"
54d86ed7fbStbbdev #include "vector.hpp"
55d86ed7fbStbbdev #include "intersect.hpp"
56d86ed7fbStbbdev #include "util.hpp"
57d86ed7fbStbbdev
box_bbox(void * obj,vector * min,vector * max)58d86ed7fbStbbdev int box_bbox(void *obj, vector *min, vector *max) {
59d86ed7fbStbbdev box *b = (box *)obj;
60d86ed7fbStbbdev
61d86ed7fbStbbdev *min = b->min;
62d86ed7fbStbbdev *max = b->max;
63d86ed7fbStbbdev
64d86ed7fbStbbdev return 1;
65d86ed7fbStbbdev }
66d86ed7fbStbbdev
67d86ed7fbStbbdev static object_methods box_methods = { (void (*)(void *, void *))(box_intersect),
68d86ed7fbStbbdev (void (*)(void *, void *, void *, void *))(box_normal),
69d86ed7fbStbbdev box_bbox,
70d86ed7fbStbbdev free };
71d86ed7fbStbbdev
newbox(void * tex,vector min,vector max)72d86ed7fbStbbdev box *newbox(void *tex, vector min, vector max) {
73d86ed7fbStbbdev box *b;
74d86ed7fbStbbdev
75d86ed7fbStbbdev b = (box *)rt_getmem(sizeof(box));
76d86ed7fbStbbdev memset(b, 0, sizeof(box));
77d86ed7fbStbbdev b->methods = &box_methods;
78d86ed7fbStbbdev b->tex = (texture *)tex;
79d86ed7fbStbbdev b->min = min;
80d86ed7fbStbbdev b->max = max;
81d86ed7fbStbbdev
82d86ed7fbStbbdev return b;
83d86ed7fbStbbdev }
84d86ed7fbStbbdev
box_intersect(box * bx,ray * ry)85d86ed7fbStbbdev void box_intersect(box *bx, ray *ry) {
86d86ed7fbStbbdev flt a, tx1, tx2, ty1, ty2, tz1, tz2;
87d86ed7fbStbbdev flt tnear, tfar;
88d86ed7fbStbbdev
89d86ed7fbStbbdev tnear = -FHUGE;
90d86ed7fbStbbdev tfar = FHUGE;
91d86ed7fbStbbdev
92d86ed7fbStbbdev if (ry->d.x == 0.0) {
93d86ed7fbStbbdev if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x))
94d86ed7fbStbbdev return;
95d86ed7fbStbbdev }
96d86ed7fbStbbdev else {
97d86ed7fbStbbdev tx1 = (bx->min.x - ry->o.x) / ry->d.x;
98d86ed7fbStbbdev tx2 = (bx->max.x - ry->o.x) / ry->d.x;
99d86ed7fbStbbdev if (tx1 > tx2) {
100d86ed7fbStbbdev a = tx1;
101d86ed7fbStbbdev tx1 = tx2;
102d86ed7fbStbbdev tx2 = a;
103d86ed7fbStbbdev }
104d86ed7fbStbbdev if (tx1 > tnear)
105d86ed7fbStbbdev tnear = tx1;
106d86ed7fbStbbdev if (tx2 < tfar)
107d86ed7fbStbbdev tfar = tx2;
108d86ed7fbStbbdev }
109d86ed7fbStbbdev if (tnear > tfar)
110d86ed7fbStbbdev return;
111d86ed7fbStbbdev if (tfar < 0.0)
112d86ed7fbStbbdev return;
113d86ed7fbStbbdev
114d86ed7fbStbbdev if (ry->d.y == 0.0) {
115d86ed7fbStbbdev if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y))
116d86ed7fbStbbdev return;
117d86ed7fbStbbdev }
118d86ed7fbStbbdev else {
119d86ed7fbStbbdev ty1 = (bx->min.y - ry->o.y) / ry->d.y;
120d86ed7fbStbbdev ty2 = (bx->max.y - ry->o.y) / ry->d.y;
121d86ed7fbStbbdev if (ty1 > ty2) {
122d86ed7fbStbbdev a = ty1;
123d86ed7fbStbbdev ty1 = ty2;
124d86ed7fbStbbdev ty2 = a;
125d86ed7fbStbbdev }
126d86ed7fbStbbdev if (ty1 > tnear)
127d86ed7fbStbbdev tnear = ty1;
128d86ed7fbStbbdev if (ty2 < tfar)
129d86ed7fbStbbdev tfar = ty2;
130d86ed7fbStbbdev }
131d86ed7fbStbbdev if (tnear > tfar)
132d86ed7fbStbbdev return;
133d86ed7fbStbbdev if (tfar < 0.0)
134d86ed7fbStbbdev return;
135d86ed7fbStbbdev
136d86ed7fbStbbdev if (ry->d.z == 0.0) {
137d86ed7fbStbbdev if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z))
138d86ed7fbStbbdev return;
139d86ed7fbStbbdev }
140d86ed7fbStbbdev else {
141d86ed7fbStbbdev tz1 = (bx->min.z - ry->o.z) / ry->d.z;
142d86ed7fbStbbdev tz2 = (bx->max.z - ry->o.z) / ry->d.z;
143d86ed7fbStbbdev if (tz1 > tz2) {
144d86ed7fbStbbdev a = tz1;
145d86ed7fbStbbdev tz1 = tz2;
146d86ed7fbStbbdev tz2 = a;
147d86ed7fbStbbdev }
148d86ed7fbStbbdev if (tz1 > tnear)
149d86ed7fbStbbdev tnear = tz1;
150d86ed7fbStbbdev if (tz2 < tfar)
151d86ed7fbStbbdev tfar = tz2;
152d86ed7fbStbbdev }
153d86ed7fbStbbdev if (tnear > tfar)
154d86ed7fbStbbdev return;
155d86ed7fbStbbdev if (tfar < 0.0)
156d86ed7fbStbbdev return;
157d86ed7fbStbbdev
158d86ed7fbStbbdev add_intersection(tnear, (object *)bx, ry);
159d86ed7fbStbbdev add_intersection(tfar, (object *)bx, ry);
160d86ed7fbStbbdev }
161d86ed7fbStbbdev
box_normal(box * bx,vector * pnt,ray * incident,vector * N)162d86ed7fbStbbdev void box_normal(box *bx, vector *pnt, ray *incident, vector *N) {
163d86ed7fbStbbdev vector a, b, c;
164d86ed7fbStbbdev flt t;
165d86ed7fbStbbdev
166d86ed7fbStbbdev c.x = (bx->max.x + bx->min.x) / 2.0;
167d86ed7fbStbbdev c.y = (bx->max.y + bx->min.y) / 2.0;
168d86ed7fbStbbdev c.z = (bx->max.z + bx->min.z) / 2.0;
169d86ed7fbStbbdev
170d86ed7fbStbbdev VSub((vector *)pnt, &c, N);
171d86ed7fbStbbdev b = (*N);
172d86ed7fbStbbdev
173d86ed7fbStbbdev a.x = fabs(N->x);
174d86ed7fbStbbdev a.y = fabs(N->y);
175d86ed7fbStbbdev a.z = fabs(N->z);
176d86ed7fbStbbdev
177d86ed7fbStbbdev N->x = 0.0;
178d86ed7fbStbbdev N->y = 0.0;
179d86ed7fbStbbdev N->z = 0.0;
180d86ed7fbStbbdev
181d86ed7fbStbbdev t = MYMAX(a.x, MYMAX(a.y, a.z));
182d86ed7fbStbbdev
183d86ed7fbStbbdev if (t == a.x)
184d86ed7fbStbbdev N->x = b.x;
185d86ed7fbStbbdev
186d86ed7fbStbbdev if (t == a.y)
187d86ed7fbStbbdev N->y = b.y;
188d86ed7fbStbbdev
189d86ed7fbStbbdev if (t == a.z)
190d86ed7fbStbbdev N->z = b.z;
191d86ed7fbStbbdev
192d86ed7fbStbbdev VNorm(N);
193d86ed7fbStbbdev }
194