1 /*
2 Copyright (c) 2005-2021 Intel Corporation
3
4 Licensed under the Apache License, Version 2.0 (the "License");
5 you may not use this file except in compliance with the License.
6 You may obtain a copy of the License at
7
8 http://www.apache.org/licenses/LICENSE-2.0
9
10 Unless required by applicable law or agreed to in writing, software
11 distributed under the License is distributed on an "AS IS" BASIS,
12 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 See the License for the specific language governing permissions and
14 limitations under the License.
15 */
16
17 /*
18 The original source for this example is
19 Copyright (c) 1994-2008 John E. Stone
20 All rights reserved.
21
22 Redistribution and use in source and binary forms, with or without
23 modification, are permitted provided that the following conditions
24 are met:
25 1. Redistributions of source code must retain the above copyright
26 notice, this list of conditions and the following disclaimer.
27 2. Redistributions in binary form must reproduce the above copyright
28 notice, this list of conditions and the following disclaimer in the
29 documentation and/or other materials provided with the distribution.
30 3. The name of the author may not be used to endorse or promote products
31 derived from this software without specific prior written permission.
32
33 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
34 OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
35 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
37 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39 OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42 OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 SUCH DAMAGE.
44 */
45
46 /*
47 * ring.cpp - This file contains the functions for dealing with rings.
48 */
49
50 #include "machine.hpp"
51 #include "types.hpp"
52 #include "macros.hpp"
53 #include "vector.hpp"
54 #include "intersect.hpp"
55 #include "util.hpp"
56
57 #define RING_PRIVATE
58 #include "ring.hpp"
59
60 static object_methods ring_methods = { (void (*)(void *, void *))(ring_intersect),
61 (void (*)(void *, void *, void *, void *))(ring_normal),
62 ring_bbox,
63 free };
64
newring(void * tex,vector ctr,vector norm,flt inrad,flt outrad)65 object *newring(void *tex, vector ctr, vector norm, flt inrad, flt outrad) {
66 ring *r;
67
68 r = (ring *)rt_getmem(sizeof(ring));
69 memset(r, 0, sizeof(ring));
70 r->methods = &ring_methods;
71
72 r->tex = (texture *)tex;
73 r->ctr = ctr;
74 r->norm = norm;
75 r->inrad = inrad;
76 r->outrad = outrad;
77
78 return (object *)r;
79 }
80
ring_bbox(void * obj,vector * min,vector * max)81 static int ring_bbox(void *obj, vector *min, vector *max) {
82 ring *r = (ring *)obj;
83
84 min->x = r->ctr.x - r->outrad;
85 min->y = r->ctr.y - r->outrad;
86 min->z = r->ctr.z - r->outrad;
87 max->x = r->ctr.x + r->outrad;
88 max->y = r->ctr.y + r->outrad;
89 max->z = r->ctr.z + r->outrad;
90
91 return 1;
92 }
93
ring_intersect(ring * rng,ray * ry)94 static void ring_intersect(ring *rng, ray *ry) {
95 flt d;
96 flt t, td;
97 vector hit, pnt;
98
99 d = -VDot(&(rng->ctr), &(rng->norm));
100
101 t = -(d + VDot(&(rng->norm), &(ry->o)));
102 td = VDot(&(rng->norm), &(ry->d));
103 if (td != 0.0) {
104 t = t / td;
105 if (t >= 0.0) {
106 hit = Raypnt(ry, t);
107 VSUB(hit, rng->ctr, pnt);
108 VDOT(td, pnt, pnt);
109 td = sqrt(td);
110 if ((td > rng->inrad) && (td < rng->outrad))
111 add_intersection(t, (object *)rng, ry);
112 }
113 }
114 }
115
ring_normal(ring * rng,vector * pnt,ray * incident,vector * N)116 static void ring_normal(ring *rng, vector *pnt, ray *incident, vector *N) {
117 *N = rng->norm;
118 VNorm(N);
119 if (VDot(N, &(incident->d)) > 0.0) {
120 N->x = -N->x;
121 N->y = -N->y;
122 N->z = -N->z;
123 }
124 }
125