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
|
/*************************************************************************
* Copyright (C) 2010-2014 Tavian Barnes <tavianator@tavianator.com> *
* *
* This file is part of The Dimension Test Suite. *
* *
* The Dimension Test Suite is free software; you can redistribute it *
* and/or modify it under the terms of the GNU 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 Test Suite 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 *
* General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
*************************************************************************/
/*
* Basic tests of PR-trees
*/
#include "../platform.c"
#include "../threads.c"
#include "../future.c"
#include "../bvh.c"
#include "../prtree.c"
#include <stdio.h>
#include <stdlib.h>
unsigned int calls = 0;
static bool
dmnsn_fake_intersection_fn(const dmnsn_object *object, dmnsn_line line,
dmnsn_intersection *intersection)
{
intersection->t = (object->bounding_box.min.z - line.x0.z)/line.n.z;
intersection->normal = dmnsn_x;
++calls;
return true;
}
static void
dmnsn_randomize_bounding_box(dmnsn_object *object)
{
dmnsn_vector a, b;
a.x = 2.0*((double)rand())/RAND_MAX - 1.0;
a.y = 2.0*((double)rand())/RAND_MAX - 1.0;
a.z = 2.0*((double)rand())/RAND_MAX - 1.0;
b.x = 2.0*((double)rand())/RAND_MAX - 1.0;
b.y = 2.0*((double)rand())/RAND_MAX - 1.0;
b.z = 2.0*((double)rand())/RAND_MAX - 1.0;
object->bounding_box.min = dmnsn_vector_min(a, b);
object->bounding_box.max = dmnsn_vector_max(a, b);
}
int
main(void)
{
/* Treat warnings as errors for tests */
dmnsn_die_on_warnings(true);
const size_t nobjects = 128;
dmnsn_array *objects = DMNSN_NEW_ARRAY(dmnsn_object *);
for (size_t i = 0; i < nobjects; ++i) {
dmnsn_object *object = dmnsn_new_object();
dmnsn_randomize_bounding_box(object);
object->intersection_fn = dmnsn_fake_intersection_fn;
object->trans_inv = dmnsn_identity_matrix();
dmnsn_array_push(objects, &object);
}
dmnsn_bvh *bvh = dmnsn_new_bvh(objects, DMNSN_BVH_PRTREE);
dmnsn_intersection intersection;
dmnsn_line ray = dmnsn_new_line(
dmnsn_new_vector(0.0, 0.0, -2.0),
dmnsn_new_vector(0.0, 0.0, 1.0)
);
if (!dmnsn_bvh_intersection(bvh, ray, &intersection, true)) {
fprintf(stderr, "--- Didn't find intersection! ---\n");
return EXIT_FAILURE;
}
if (calls > DMNSN_PRTREE_B) {
fprintf(stderr,
"--- Too many intersection function calls: %u! ---\n",
calls);
return EXIT_FAILURE;
}
dmnsn_delete_bvh(bvh);
DMNSN_ARRAY_FOREACH (dmnsn_object **, object, objects) {
dmnsn_delete_object(*object);
}
dmnsn_delete_array(objects);
return EXIT_SUCCESS;
}
|
