aboutsummaryrefslogtreecommitdiff
path: root/src/scene/shapes/sphere.rs
blob: 3f07b9efa56c1f45516798802674372662ff5ed5 (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
//! Implements sphere
//!
//! Spheres are relatively easy to calculate intersections between
use crate::Float;
use crate::core::{Ray, Vector3f, Hittable, Intersection};

pub struct Sphere {
    radius: Float,
    center: Vector3f,
}

impl Sphere {
    pub fn new(radius: Float, center: Vector3f) -> Sphere {
        Sphere {
            radius,
            center,
        }
    }

    fn norm_at(&self, point: &Vector3f) -> Vector3f {
        let mut v = *point - self.center;
        v /= self.radius;
        v
    }
}

impl Hittable for Sphere {
    // Implementation from ray tracing in a weekend
    fn intersect(&self, ray: &Ray) -> Option<Intersection> {
        let oc = ray.origin - self.center;
        let a = ray.direction.len_squared();
        let half_b = oc.dot(&ray.direction);
        let c = oc.len_squared() - self.radius * self.radius;
        let disc = half_b*half_b - a*c;

        if disc < 0.0 {
            return None
        } else {
            let distance = (-half_b - disc.sqrt()) / a;
            if distance < 0.0 {
                return None
            }
            let w = ray.at(distance);
            Some(Intersection {
                n: self.norm_at(&w),
                p: w,
            })
        }

    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn sphere_intersect() {
        let sph = Sphere::new(2.0, Vector3f::new_xyz(2.0, 3.0, 4.0));

        let ray = Ray {
            origin: Vector3f::new_xyz(1.0, 0.0, 0.0),
            direction: Vector3f::new_xyz(0.0, 1.0, 1.5).norm(),
        };

        let dist = sph.intersect(&ray);
        assert!((dist.unwrap() - 3.28).abs() < 0.01);
    }
}