Type Definition nalgebra::geometry::Rotation2

type Rotation2<N> = Rotation<N, U2>;

A 2-dimensional rotation matrix.

Methods

impl<N: Real> Rotation2<N>

pub fn new(angle: N) -> Self

Builds a 2 dimensional rotation matrix from an angle in radian.

pub fn from_scaled_axis<SB: Storage<N, U1>>(     axisangle: Vector<N, U1, SB> ) -> Self

Builds a 2 dimensional rotation matrix from an angle in radian wrapped in a 1-dimensional vector.

Equivalent to Self::new(axisangle[0]).

pub fn rotation_between<SB, SC>(     a: &Vector<N, U2, SB>,     b: &Vector<N, U2, SC> ) -> Self where     SB: Storage<N, U2>,     SC: Storage<N, U2>,

The rotation matrix required to align a and b but with its angle.

This is the rotation R such that (R * a).angle(b) == 0 && (R * a).dot(b).is_positive().

pub fn scaled_rotation_between<SB, SC>(     a: &Vector<N, U2, SB>,     b: &Vector<N, U2, SC>,     s: N ) -> Self where     SB: Storage<N, U2>,     SC: Storage<N, U2>,

The smallest rotation needed to make a and b collinear and point toward the same direction, raised to the power s.

impl<N: Real> Rotation2<N>

pub fn angle(&self) -> N

The rotation angle.

pub fn angle_to(&self, other: &Rotation2<N>) -> N

The rotation angle needed to make self and other coincide.

pub fn rotation_to(&self, other: &Rotation2<N>) -> Rotation2<N>

The rotation matrix needed to make self and other coincide.

The result is such that: self.rotation_to(other) * self == other.

pub fn powf(&self, n: N) -> Rotation2<N>

Raise the quaternion to a given floating power, i.e., returns the rotation with the angle of self multiplied by n.

pub fn scaled_axis(&self) -> VectorN<N, U1>

The rotation angle returned as a 1-dimensional vector.

Trait Implementations

impl<N1, N2> SubsetOf<UnitComplex<N2>> for Rotation2<N1> where     N1: Real,     N2: Real + SupersetOf<N1>,

fn to_superset(&self) -> UnitComplex<N2>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(q: &UnitComplex<N2>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(q: &UnitComplex<N2>) -> Self

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N: Real> Distribution<Rotation2<N>> for Standard where     OpenClosed01: Distribution<N>,

fn sample<'a, R: Rng + ?Sized>(&self, rng: &'a mut R) -> Rotation2<N>

Generate a uniformly distributed random rotation.

Important traits for DistIter<'a, D, R, T>

impl<'a, D, R, T> Iterator for DistIter<'a, D, R, T> where
    D: Distribution<T>,
    R: Rng + 'a,  type Item = T;

fn sample_iter<R>(&'a self, rng: &'a mut R) -> DistIter<'a, Self, R, T> where     R: Rng,

Create an iterator that generates random values of T, using rng as the source of randomness.

impl<N1, N2> SubsetOf<Rotation2<N2>> for UnitComplex<N1> where     N1: Real,     N2: Real + SupersetOf<N1>,

fn to_superset(&self) -> Rotation2<N2>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(rot: &Rotation2<N2>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(rot: &Rotation2<N2>) -> Self

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.