Nathan Vegdahl
630a79aca5
This is a "just get it working" implementation. Performance optimizations still need to be done.
51 lines
1.5 KiB
Rust
51 lines
1.5 KiB
Rust
#![allow(dead_code)]
|
|
|
|
// pub mod micropoly_batch;
|
|
pub mod triangle;
|
|
pub mod triangle_mesh;
|
|
|
|
use std::fmt::Debug;
|
|
|
|
use crate::{
|
|
boundable::Boundable,
|
|
math::{Matrix4x4, Normal, Point, Vector},
|
|
ray::{RayBatch, RayStack},
|
|
shading::surface_closure::SurfaceClosure,
|
|
shading::SurfaceShader,
|
|
};
|
|
|
|
pub trait Surface: Boundable + Debug + Sync {
|
|
fn intersect_rays(
|
|
&self,
|
|
rays: &mut RayBatch,
|
|
ray_stack: &mut RayStack,
|
|
isects: &mut [SurfaceIntersection],
|
|
shader: &SurfaceShader,
|
|
space: &[Matrix4x4],
|
|
);
|
|
}
|
|
|
|
#[derive(Debug, Copy, Clone)]
|
|
#[allow(clippy::large_enum_variant)]
|
|
pub enum SurfaceIntersection {
|
|
Miss,
|
|
Occlude,
|
|
Hit {
|
|
intersection_data: SurfaceIntersectionData,
|
|
closure: SurfaceClosure,
|
|
},
|
|
}
|
|
|
|
#[derive(Debug, Copy, Clone)]
|
|
pub struct SurfaceIntersectionData {
|
|
pub incoming: Vector, // Direction of the incoming ray
|
|
pub pos: Point, // Position of the intersection
|
|
pub pos_err: f32, // Error magnitude of the intersection position. Imagine
|
|
// a cube centered around `pos` with dimensions of `2 * pos_err`.
|
|
pub nor: Normal, // Shading normal
|
|
pub nor_g: Normal, // True geometric normal
|
|
pub local_space: Matrix4x4, // Matrix from global space to local space
|
|
pub t: f32, // Ray t-value at the intersection point
|
|
pub sample_pdf: f32, // The PDF of getting this point by explicitly sampling the surface
|
|
}
|