aboutsummaryrefslogtreecommitdiff
path: root/src/object.cpp
blob: 179785a39464038d6f318458d0fe15b1bfd76420 (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
#include "object.hpp"

#include <math.h>
#include <iostream>
#include "common.hpp"

Sphere::Sphere(Vec3d center, double radius) {
    m_center = center;
    m_radius = radius;
}

Plane::Plane(Vec3d start, Vec3d norm) {
    m_start = start;
    m_norm = norm;

    m_norm.normalize();
}

Vec3d Sphere::norm_at(const Vec3d &point, const Vec3d&) const {
    auto res = point - m_center;
    res.normalize();
    return res;
}

// https://www.scratchapixel.com/lessons/3d-basic-rendering/minimal-ray-tracer-rendering-simple-shapes/ray-sphere-intersection
double Sphere::intersect(const Ray &ray, bool skip_dist) const {
    // Calculate O - C used multiple places
    auto oc = ray.m_start - m_center;
    // Calculate components of quadratic formula
    // a = 1 when ray.direction is a unit vector
    auto a = 1;
    auto b = 2 * ray.m_direction.dot(oc);
    auto c = oc.dot(oc) - m_radius * m_radius;

    // Solve quadratic function
    auto discr = b * b - 4 * a * c;
    if (discr < 0) {
        // No solution
        return -1;
    }
    if (skip_dist) {
        // Do not calculate distance
        return 1;
    }

    auto q = (b > 0) ?
        -0.5 * (b + sqrt(discr)):
        -0.5 * (b - sqrt(discr));
    auto t1 = q; // Assuming a = 1
    auto t0 = c / q;

    // Find correct result
    if (t0 <= ZERO_APPROX) {
        t0 = t1;
    }

    if (t0 <= ZERO_APPROX) {
        return -1;
    }

    return t0;
}

Vec3d Plane::norm_at(const Vec3d&, const Vec3d &indir) const {
    auto scale = m_norm.dot(indir);
    return scale > 0 ? -m_norm : m_norm;
}

// https://www.scratchapixel.com/lessons/3d-basic-rendering/minimal-ray-tracer-rendering-simple-shapes/ray-plane-and-ray-disk-intersection
// Requires that vectors are normalized
// Skip dist is ignored as distance must be calculated
double Plane::intersect(const Ray &ray, bool) const {
    // If ray is parallel
    auto nr = m_norm.dot(ray.m_direction);
    if (abs(nr) < ZERO_APPROX) {
        return -1;
    }

    // Calculate distance
    auto dist = m_norm.dot(m_start - ray.m_start) / nr;
    if (dist < 0) {
        return -1;
    }

    return dist;
}