summaryrefslogtreecommitdiffstats
path: root/libdimension/bvst.c
blob: d36121522a147e53b61c3735ba7c5e7d244faa3c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
/*************************************************************************
 * Copyright (C) 2010 Tavian Barnes <tavianator@gmail.com>               *
 *                                                                       *
 * This file is part of The Dimension Library.                           *
 *                                                                       *
 * The Dimension Library is free software; you can redistribute it and/  *
 * or modify it under the terms of the GNU Lesser General Public License *
 * as published by the Free Software Foundation; either version 3 of the *
 * License, or (at your option) any later version.                       *
 *                                                                       *
 * The Dimension Library is distributed in the hope that it will be      *
 * useful, but WITHOUT ANY WARRANTY; without even the implied warranty   *
 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU  *
 * Lesser General Public License for more details.                       *
 *                                                                       *
 * You should have received a copy of the GNU Lesser General Public      *
 * License along with this program.  If not, see                         *
 * <http://www.gnu.org/licenses/>.                                       *
 *************************************************************************/

#include "dimension_impl.h"
#include <stdlib.h>

/* Return an empty tree */
dmnsn_bvst *
dmnsn_new_bvst()
{
  dmnsn_bvst *tree = malloc(sizeof(dmnsn_bvst));
  if (tree) {
    tree->root = NULL;
  } else {
    dmnsn_error(DMNSN_SEVERITY_HIGH, "BVST allocation failed.");
  }
  return tree;
}

static dmnsn_bvst_node *
dmnsn_new_bvst_node()
{
  dmnsn_bvst_node *node = malloc(sizeof(dmnsn_bvst_node));
  if (!node) {
    dmnsn_error(DMNSN_SEVERITY_HIGH, "BVST node allocation failed.");
  }
  return node;
}

/* Recursively copy the nodes of a BVST */
static dmnsn_bvst_node *
dmnsn_bvst_copy_recursive(dmnsn_bvst_node *root)
{
  dmnsn_bvst_node *node = dmnsn_new_bvst_node();
  *node = *root;
  if (node->contains) {
    node->contains = dmnsn_bvst_copy_recursive(node->contains);
    node->contains->parent = node;
  }
  if (node->container) {
    node->container = dmnsn_bvst_copy_recursive(node->container);
    node->container->parent = node;
  }
  return node;
}

/* Copy a BVST */
dmnsn_bvst *
dmnsn_copy_bvst(dmnsn_bvst *tree)
{
  dmnsn_bvst *copy = dmnsn_new_bvst();
  if (tree->root)
    copy->root = dmnsn_bvst_copy_recursive(tree->root);
  else
    copy->root = NULL;
  return copy;
}

static void
dmnsn_delete_bvst_node(dmnsn_bvst_node *node)
{
  free(node);
}

/* Recursively free a BVST */
static void
dmnsn_delete_bvst_recursive(dmnsn_bvst_node *node)
{
  if (node) {
    dmnsn_delete_bvst_recursive(node->contains);
    dmnsn_delete_bvst_recursive(node->container);
    dmnsn_delete_bvst_node(node);
  }
}

/* Free a BVST */
void
dmnsn_delete_bvst(dmnsn_bvst *tree)
{
  if (tree) {
    dmnsn_delete_bvst_recursive(tree->root);
    free(tree);
  }
}

/* Return whether node1 contains node2 */
static int dmnsn_box_contains(dmnsn_vector p,
                              dmnsn_vector min, dmnsn_vector max);
/* Expand node to contain the bounding box from min to max */
static void dmnsn_bvst_node_swallow(dmnsn_bvst_node *node,
                                    dmnsn_vector min, dmnsn_vector max);

/* Insert an object into the tree */
void
dmnsn_bvst_insert(dmnsn_bvst *tree, dmnsn_object *object)
{
  dmnsn_bvst_node *node = dmnsn_new_bvst_node(), *parent = tree->root;

  /* Store the inverse of the transformation matrix */
  object->trans_inv = dmnsn_matrix_inverse(object->trans);

  node->contains = NULL;
  node->container = NULL;
  node->parent = NULL;
  node->object = object;

  /* Calculate the new bounding box by finding the minimum coordinate of the
     transformed corners of the object's original bounding box */

  node->min = dmnsn_matrix_vector_mul(object->trans, object->min);
  node->max = node->min;

  dmnsn_vector corner;
  corner = dmnsn_new_vector(object->min.x, object->min.y, object->max.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->min.x, object->max.y, object->min.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->min.x, object->max.y, object->max.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->max.x, object->min.y, object->min.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->max.x, object->min.y, object->max.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->max.x, object->max.y, object->min.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  corner = dmnsn_new_vector(object->max.x, object->max.y, object->max.z);
  corner = dmnsn_matrix_vector_mul(object->trans, corner);
  dmnsn_bvst_node_swallow(node, corner, corner);

  /* Now insert the node */

  while (parent) {
    if (dmnsn_box_contains(node->min, parent->min, parent->max)
        && dmnsn_box_contains(node->max, parent->min, parent->max)) {
      /* parent fully contains node */
      if (parent->contains)
        parent = parent->contains;
      else {
        /* We found our parent; insert node into the tree */
        parent->contains = node;
        node->parent = parent;
        break;
      }
    } else {
      /* Expand node's bounding box to fully contain parent's if it doesn't
         already */
      dmnsn_bvst_node_swallow(node, parent->min, parent->max);
      /* node now fully contains parent */
      if (parent->container)
        parent = parent->container;
      else {
        /* We found our parent; insert node into the tree */
        parent->container = node;
        node->parent = parent;
        break;
      }
    }
  }

  dmnsn_bvst_splay(tree, node);
}

/* Return whether p is within the axis-aligned box with corners min and max */
static int
dmnsn_box_contains(dmnsn_vector p, dmnsn_vector min, dmnsn_vector max)
{
  return (p.x >= min.x && p.y >= min.y && p.z >= min.z)
    && (p.x <= max.x && p.y <= max.y && p.z <= max.z);
}

/* Expand node to contain the bounding box from min to max */
static void
dmnsn_bvst_node_swallow(dmnsn_bvst_node *node,
                        dmnsn_vector min, dmnsn_vector max)
{
  node->min = dmnsn_vector_min(node->min, min);
  node->max = dmnsn_vector_max(node->max, max);
}

/* Tree rotations */
static void dmnsn_bvst_rotate(dmnsn_bvst_node *node);

/* Splay a node: move it to the root via tree rotations */
void
dmnsn_bvst_splay(dmnsn_bvst *tree, dmnsn_bvst_node *node)
{
  while (node->parent) {
    if (!node->parent->parent) {
      /* Zig step - we are a child of the root node */
      dmnsn_bvst_rotate(node);
      break;
    } else if ((node == node->parent->contains
                && node->parent == node->parent->parent->contains)
               || (node == node->parent->container
                   && node->parent == node->parent->parent->container)) {
      /* Zig-zig step - we are a child on the same side as our parent */
      dmnsn_bvst_rotate(node->parent);
      dmnsn_bvst_rotate(node);
    } else {
      /* Zig-zag step - we are a child on a different side than our parent is */
      dmnsn_bvst_rotate(node);
      dmnsn_bvst_rotate(node);
    }
  }
  tree->root = node;
}

/* Rotate a tree on the edge connecting node and node->parent */
static void
dmnsn_bvst_rotate(dmnsn_bvst_node *node)
{
  dmnsn_bvst_node *P, *Q, *B;
  if (node == node->parent->contains) {
    /* We are a left child; perform a right rotation:
     *
     *     Q            P
     *    / \          / \
     *   P   C  --->  A   Q
     *  / \              / \
     * A   B            B   C
     */
    Q = node->parent;
    P = node;
    /* A = node->contains; */
    B = node->container;
    /* C = node->parent->container; */

    /* First fix up the parents */
    if (Q->parent) {
      if (Q->parent->contains == Q)
        Q->parent->contains = P;
      else
        Q->parent->container = P;
    }
    P->parent = Q->parent;
    Q->parent = P;
    if (B) B->parent = Q;

    /* Then the children */
    P->container = Q;
    Q->contains  = B;
  } else {
    /* We are a right child; perform a left rotation:
     *
     *    P                Q
     *   / \              / \
     *  A   Q    --->    P   C
     *     / \          / \
     *    B   C        A   B
     */
    P = node->parent;
    Q = node;
    /* A = node->parent->contains; */
    B = node->contains;
    /* C = node->container; */

    /* First fix up the parents */
    if (P->parent) {
      if (P->parent->contains == P)
        P->parent->contains = Q;
      else
        P->parent->container = Q;
    }
    Q->parent = P->parent;
    P->parent = Q;
    if (B) B->parent = P;

    /* Then the children */
    Q->contains  = P;
    P->container = B;
  }
}

typedef struct {
  dmnsn_bvst_node *node;
  dmnsn_intersection  *intersection;
} dmnsn_bvst_search_result;

static dmnsn_bvst_search_result
dmnsn_bvst_search_recursive(dmnsn_bvst_node *node, dmnsn_line ray, double t);

dmnsn_intersection *
dmnsn_bvst_search(dmnsn_bvst *tree, dmnsn_line ray)
{
  dmnsn_bvst_search_result result
    = dmnsn_bvst_search_recursive(tree->root, ray, -1.0);

  if (result.node)
    dmnsn_bvst_splay(tree, result.node);

  return result.intersection;
}

static int dmnsn_ray_box_intersection(dmnsn_line ray, dmnsn_vector min,
                                      dmnsn_vector max, double t);

static dmnsn_bvst_search_result
dmnsn_bvst_search_recursive(dmnsn_bvst_node *node, dmnsn_line ray, double t)
{
  dmnsn_line ray_trans;
  dmnsn_bvst_search_result result = { NULL, NULL }, result_temp;

  if (!node)
    return result;

  /* Go down the right subtree first because the closest object is more likely
     to lie in the larger bounding boxes */
  result_temp = dmnsn_bvst_search_recursive(node->container, ray, t);
  if (result_temp.node && (t < 0.0 || result_temp.intersection->t < t)) {
    result = result_temp;
    t = result.intersection->t;
  } else {
    dmnsn_delete_intersection(result_temp.intersection);
  }

  if (dmnsn_box_contains(ray.x0, node->min, node->max)
      || dmnsn_ray_box_intersection(ray, node->min, node->max, t))
  {
    /* Transform the ray according to the object */
    ray_trans = dmnsn_matrix_line_mul(node->object->trans_inv, ray);

    if (dmnsn_box_contains(ray_trans.x0, node->object->min, node->object->max)
        || dmnsn_ray_box_intersection(ray_trans, node->object->min,
                                      node->object->max, t))
    {
      result_temp.intersection =
        (*node->object->intersection_fn)(node->object, ray_trans);

      if (result_temp.intersection
          && (t < 0.0 || result_temp.intersection->t < t)) {
        dmnsn_delete_intersection(result.intersection);
        result.node = node;
        result.intersection = result_temp.intersection;
        t = result.intersection->t;

        /* Transform the intersection back to the observer's view */
        result.intersection->ray = ray;
        result.intersection->normal = dmnsn_vector_normalize(
          dmnsn_vector_sub(
            dmnsn_matrix_vector_mul(
              node->object->trans,
              result.intersection->normal
            ),
            dmnsn_matrix_vector_mul(
              node->object->trans,
              dmnsn_zero
            )
          )
        );
      } else {
        dmnsn_delete_intersection(result_temp.intersection);
      }
    }

    /* Go down the left subtree */
    result_temp = dmnsn_bvst_search_recursive(node->contains, ray, t);
    if (result_temp.node && (t < 0.0 || result_temp.intersection->t < t)) {
      dmnsn_delete_intersection(result.intersection);
      result = result_temp;
    } else {
      dmnsn_delete_intersection(result_temp.intersection);
    }
  }

  return result;
}

static int
dmnsn_ray_box_intersection(dmnsn_line line, dmnsn_vector min, dmnsn_vector max,
                           double t)
{
  double t_temp;
  dmnsn_vector p;

  if (line.n.x != 0.0) {
    /* x == min.x */
    t_temp = (min.x - line.x0.x)/line.n.x;
    p = dmnsn_line_point(line, t_temp);
    if (p.y >= min.y && p.y <= max.y && p.z >= min.z && p.z <= max.z
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;

    /* x == max.x */
    t_temp = (max.x - line.x0.x)/line.n.x;
    p = dmnsn_line_point(line, t_temp);
    if (p.y >= min.y && p.y <= max.y && p.z >= min.z && p.z <= max.z
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;
  }

  if (line.n.y != 0.0) {
    /* y == -1.0 */
    t_temp = (min.y - line.x0.y)/line.n.y;
    p = dmnsn_line_point(line, t_temp);
    if (p.x >= min.x && p.x <= max.x && p.z >= min.z && p.z <= max.z
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;

    /* y == 1.0 */
    t_temp = (max.y - line.x0.y)/line.n.y;
    p = dmnsn_line_point(line, t_temp);
    if (p.x >= min.x && p.x <= max.x && p.z >= min.z && p.z <= max.z
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;
  }

  if (line.n.z != 0.0) {
    /* z == -1.0 */
    t_temp = (min.z - line.x0.z)/line.n.z;
    p = dmnsn_line_point(line, t_temp);
    if (p.x >= min.x && p.x <= max.x && p.y >= min.y && p.y <= max.y
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;

    /* z == 1.0 */
    t_temp = (max.z - line.x0.z)/line.n.z;
    p = dmnsn_line_point(line, t_temp);
    if (p.x >= min.x && p.x <= max.x && p.y >= min.y && p.y <= max.y
        && t_temp >= 0.0 && (t < 0.0 || t_temp < t))
      return 1;
  }

  return 0;
}