Struct rpt::KdTree

pub struct KdTree<T> { /* fields omitted */ }

A kd-tree based on bounding boxes, used to accelerate ray intersections

This is a simple implementation; we don't care about slight performance optimizations from things like cache locality and packing structs into 8 bytes (such as what's given in the PBRT book).

The tree construction & ray intersection code was largely adapted from fogleman/pt. Parts of the construction algorithm were also taken from PBRT, which helped optimize the code by a few orders of magnitude.

Implementations

impl<T: Bounded> KdTree<T>

pub fn new(objects: Vec<T>) -> Self

Construct a new kd-tree from a collection of objects

Trait Implementations

impl<T: Bounded> Bounded for KdTree<T>

pub fn bounding_box(&self) -> BoundingBox

Returns the shape's bounding box

impl<T: Bounded> Shape for KdTree<T>

pub fn intersect(&self, ray: &Ray, t_min: f64, record: &mut HitRecord) -> bool

Intersect the shape with a ray, for t >= t_min, returning true and mutating h if an intersection was found before the current closest one

pub fn sample(&self, target: &DVec3, rng: &mut StdRng) -> (DVec3, DVec3, f64)

Sample the shape for a random point on its surface, also returning the normal and PDF