Struct arendur::shape::triangle::TriangleInstance

pub struct TriangleInstance { /* fields omitted */ }

An instance of triangle from a triangle mesh.

Methods

impl TriangleInstance

fn x(&self) -> Point3f

return points in local frame

fn y(&self) -> Point3f

return points in local frame

fn z(&self) -> Point3f

return points in local frame

fn uvs(&self) -> (Point2f, Point2f, Point2f)

return uv-coordinates

fn vidx(&self, idx: usize) -> usize

return vertice indices in the parent mesh

Trait Implementations

impl Iterator for TriangleInstance

type Item = TriangleInstance

The type of the elements being iterated over.

fn next(&mut self) -> Option<TriangleInstance>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

🔬 This is a nightly-only experimental API. (iterator_step_by)

unstable replacement of Range::step_by

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

Takes a closure and creates an iterator which calls that closure on each element.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that yields elements based on a predicate.

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

Creates an iterator that works like map, but flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item) -> (), 

Do something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool, 

Consumes an iterator, creating two collections from it.

fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator adaptor that applies a function, producing a single, final value.

fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator that satisfies a predicate.

fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator, returning its index.

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,
    Self: ExactSizeIterator + DoubleEndedIterator, 

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator's direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>,
    Self: Iterator<Item = (A, B)>, 

Converts an iterator of pairs into a pair of containers.

fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Lexicographically compares the elements of this Iterator with those of another.

fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are equal to those of another.

fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are unequal to those of another.

fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

impl Clone for TriangleInstance

fn clone(&self) -> TriangleInstance

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Index<usize> for TriangleInstance

type Output = Point3f

The returned type after indexing

fn index(&self, index: usize) -> &Point3f

The method for the indexing (container[index]) operation

impl Shape for TriangleInstance

fn bbox_local(&self) -> BBox3f

returns bounding box of the shape in its local frame

fn intersect_ray(&self, ray: &RawRay) -> Option<(Float, SurfaceInteraction)>

Tests for intersection. - if hit, return t as the parametric distance along the ray to the hitting point., and a surface_interaction for hitting information at the surface, in local frame.

fn surface_area(&self) -> Float

Return an estimation of the surface area of the shape, in local space

fn sample(&self, sample: Point2f) -> (Point3f, Vector3f, Float)

Sample the shape, return a point and normal of the sampled point

fn can_intersect(&self, ray: &RawRay) -> bool

Tests if the interaction can occur. Implementation maybe faster than self.intersect_ray

fn pdf(&self, _p: Point3f, _n: Vector3f) -> Float

pdf of a sampled interaction on the surface, defaults to 1/area

fn sample_wrt(
    &self,
    pref: Point3f,
    sample: Point2f
) -> (Point3f, Vector3f, Float)

Sample the shape wrt some reference point

fn pdf_wrt(&self, pos_ref: Point3f, wi: Vector3f) -> Float

Pdf wrt some reference point and an associated incoming ray

impl Composable for TriangleInstance

fn bbox_parent(&self) -> BBox3f

returns bounding box in parent frame.

fn intersect_ray(&self, ray: &mut RawRay) -> Option<SurfaceInteraction>

test for intersection. Note that its guarantees are from Shape's: - ray is specified in parent frame, - if hit, returns surface interaction data in parent frame. - if hit, ray's tmax would be updated to the hitting t.

fn can_intersect(&self, ray: &RawRay) -> bool

test if an intersection can occur. Might be more efficient

fn as_light(&self) -> &Light

fn intersection_cost(&self) -> Float

impl Light for TriangleInstance

fn flags(&self) -> LightFlag

return the flags of the light

fn is_delta(&self) -> bool

test if the light has delta distribution

fn evaluate_path(&self, pos: Point3f, dir: Vector3f) -> RGBSpectrumf

Given a position on surface and an direction in local coordinates, evaluate the light's emitted radiance along that direction.

fn evaluate_sampled(&self, pos: Point3f, sample: Point2f) -> LightSample

Given a pos in local frame with a uniform sample in $[0, 1)$, sample an incoming direction from the light to that location, returns the sampling result in a LightSample.

fn generate_path(&self, samples: SampleInfo) -> PathInfo

Generate a photon path from the light source based on the sample info

fn pdf_path(
    &self,
    pos: Point3f,
    dir: Vector3f,
    norm: Vector3f
) -> (Float, Float)

Given position and direction of a photon path, and the light's normal return its pdfs as (pdfpos, pdfdir)

fn pdf(&self, pos: Point3f, wi: Vector3f) -> Float

Given a position and lighting ray wi of an interaction, return the pdf of it

fn power(&self) -> RGBSpectrumf

returns an estimation of total power of this light

fn evaluate_ray(&self, rd: &RayDifferential) -> RGBSpectrumf

Given a position and an incoming direction in local coordinates, evaluate the light's radiance along that direction. This method takes an RayDifferential because some light implementations might found thouse differentials helpful.

fn preprocess(&mut self, _s: &Scene)

preporcess with scene components, if necessary. renderers should respect this requirement.

impl Primitive for TriangleInstance

fn get_material(&self) -> &Material

return the material associated with this primitive

fn is_emissive(&self) -> bool

return if the primitive can emit lights