112 lines
3.3 KiB
C
112 lines
3.3 KiB
C
#include <tuples.h>
|
|
#include <unity.h>
|
|
|
|
#include "../testutils.h"
|
|
#include "plane.h"
|
|
|
|
void setUp(void) {}
|
|
void tearDown(void) {}
|
|
|
|
void test_construct_a_plane_on_heap(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
TEST_ASSERT_NOT_NULL(p);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_initialize_plane_on_stack(void) {
|
|
PLANE_Plane p2;
|
|
PLANE_init(&p2);
|
|
TEST_ASSERT_NOT_NULL(p2.transform);
|
|
PLANE_destroy(&p2);
|
|
}
|
|
|
|
void test_normal_of_plane_is_constant_everywhere(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
TUPLES_Vector n1, n2, n3, normal;
|
|
TUPLES_Point p1, p2, p3;
|
|
TUPLES_init_vector(&normal, 0, 1, 0);
|
|
TUPLES_init_point(&p1, 0, 0, 0);
|
|
TUPLES_init_point(&p2, 10, 0, -10);
|
|
TUPLES_init_point(&p3, -5, 0, 150);
|
|
PLANE_local_normal_at(&n1, p, &p1, NULL);
|
|
PLANE_local_normal_at(&n2, p, &p2, NULL);
|
|
PLANE_local_normal_at(&n3, p, &p3, NULL);
|
|
test_tuples(&normal, &n1);
|
|
test_tuples(&normal, &n2);
|
|
test_tuples(&normal, &n3);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_intersect_ray_parallel_to_plane(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
RAY_Ray r;
|
|
RAY_init(&r, 0, 10, 0, 0, 0, 1);
|
|
RAY_Intersections *intersections = RAY_new_intersections();
|
|
PLANE_local_intersect(intersections, p, &r);
|
|
TEST_ASSERT_EQUAL(0, intersections->count);
|
|
RAY_delete_intersections(intersections);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_intersect_with_coplanar_ray(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
RAY_Ray r;
|
|
RAY_init(&r, 0, 0, 0, 0, 0, 1);
|
|
RAY_Intersections *intersections = RAY_new_intersections();
|
|
PLANE_local_intersect(intersections, p, &r);
|
|
TEST_ASSERT_EQUAL(0, intersections->count);
|
|
RAY_delete_intersections(intersections);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_intersect_plane_from_above(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
RAY_Ray r;
|
|
RAY_init(&r, 0, 1, 0, 0, -1, 0);
|
|
RAY_Intersections *intersections = RAY_new_intersections();
|
|
PLANE_local_intersect(intersections, p, &r);
|
|
TEST_ASSERT_EQUAL(1, intersections->count);
|
|
TEST_ASSERT_EQUAL_DOUBLE(1.0, intersections->xs[0].t);
|
|
TEST_ASSERT_EQUAL_PTR(p, intersections->xs[0].object);
|
|
RAY_delete_intersections(intersections);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_intersect_plane_from_below(void) {
|
|
PLANE_Plane *p = PLANE_new();
|
|
RAY_Ray r;
|
|
RAY_init(&r, 0, -1, 0, 0, 1, 0);
|
|
RAY_Intersections *intersections = RAY_new_intersections();
|
|
PLANE_local_intersect(intersections, p, &r);
|
|
TEST_ASSERT_EQUAL(1, intersections->count);
|
|
TEST_ASSERT_EQUAL_DOUBLE(1.0, intersections->xs[0].t);
|
|
TEST_ASSERT_EQUAL_PTR(p, intersections->xs[0].object);
|
|
RAY_delete_intersections(intersections);
|
|
PLANE_delete(p);
|
|
}
|
|
|
|
void test_plane_bounding_box(void) {
|
|
PLANE_Plane *plane = PLANE_new();
|
|
BOUND_Box box;
|
|
plane->vtable->bounds_of(plane, &box);
|
|
TUPLES_Point min_expected, max_expected;
|
|
TUPLES_init_point(&min_expected, -INFINITY, 0, -INFINITY);
|
|
TUPLES_init_point(&max_expected, INFINITY, 0, INFINITY);
|
|
TEST_ASSERT_TRUE(TUPLES_is_equal(&min_expected, &box.min));
|
|
TEST_ASSERT_TRUE(TUPLES_is_equal(&max_expected, &box.max));
|
|
PLANE_delete(plane);
|
|
}
|
|
|
|
int main(void) {
|
|
UNITY_BEGIN();
|
|
RUN_TEST(test_construct_a_plane_on_heap);
|
|
RUN_TEST(test_initialize_plane_on_stack);
|
|
RUN_TEST(test_normal_of_plane_is_constant_everywhere);
|
|
RUN_TEST(test_intersect_ray_parallel_to_plane);
|
|
RUN_TEST(test_intersect_with_coplanar_ray);
|
|
RUN_TEST(test_intersect_plane_from_above);
|
|
RUN_TEST(test_intersect_plane_from_below);
|
|
RUN_TEST(test_plane_bounding_box);
|
|
return UNITY_END();
|
|
}
|