nalgebra/src/geometry/rotation_conversion.rs

246 lines
7.0 KiB
Rust
Raw Normal View History

use num::Zero;
2020-03-21 19:16:46 +08:00
use simba::scalar::{RealField, SubsetOf, SupersetOf};
2017-10-10 01:58:09 +08:00
#[cfg(feature = "mint")]
use mint;
2019-03-23 21:29:07 +08:00
use crate::base::allocator::Allocator;
use crate::base::dimension::{DimMin, DimName, DimNameAdd, DimNameSum, U1};
use crate::base::{DefaultAllocator, Matrix2, Matrix3, Matrix4, MatrixN};
2019-03-23 21:29:07 +08:00
use crate::geometry::{
2020-03-21 19:16:46 +08:00
AbstractRotation, Isometry, Rotation, Rotation2, Rotation3, Similarity, SuperTCategoryOf,
TAffine, Transform, Translation, UnitComplex, UnitQuaternion,
};
/*
* This file provides the following conversions:
* =============================================
*
* Rotation -> Rotation
* Rotation3 -> UnitQuaternion
* Rotation2 -> UnitComplex
* Rotation -> Isometry
* Rotation -> Similarity
* Rotation -> Transform
* Rotation -> Matrix (homogeneous)
2017-10-10 01:58:09 +08:00
* mint::EulerAngles -> Rotation
2017-07-25 23:55:54 +08:00
*/
impl<N1, N2, D: DimName> SubsetOf<Rotation<N2, D>> for Rotation<N1, D>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2018-02-02 19:26:35 +08:00
DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D>,
{
#[inline]
fn to_superset(&self) -> Rotation<N2, D> {
Rotation::from_matrix_unchecked(self.matrix().to_superset())
}
#[inline]
fn is_in_subset(rot: &Rotation<N2, D>) -> bool {
2019-03-23 21:29:07 +08:00
crate::is_convertible::<_, MatrixN<N1, D>>(rot.matrix())
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(rot: &Rotation<N2, D>) -> Self {
Rotation::from_matrix_unchecked(rot.matrix().to_subset_unchecked())
}
}
impl<N1, N2> SubsetOf<UnitQuaternion<N2>> for Rotation3<N1>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2018-02-02 19:26:35 +08:00
{
#[inline]
fn to_superset(&self) -> UnitQuaternion<N2> {
let q = UnitQuaternion::<N1>::from_rotation_matrix(self);
q.to_superset()
}
#[inline]
fn is_in_subset(q: &UnitQuaternion<N2>) -> bool {
2019-03-23 21:29:07 +08:00
crate::is_convertible::<_, UnitQuaternion<N1>>(q)
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(q: &UnitQuaternion<N2>) -> Self {
2019-03-23 21:29:07 +08:00
let q: UnitQuaternion<N1> = crate::convert_ref_unchecked(q);
q.to_rotation_matrix()
}
}
impl<N1, N2> SubsetOf<UnitComplex<N2>> for Rotation2<N1>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2018-02-02 19:26:35 +08:00
{
#[inline]
fn to_superset(&self) -> UnitComplex<N2> {
let q = UnitComplex::<N1>::from_rotation_matrix(self);
q.to_superset()
}
#[inline]
fn is_in_subset(q: &UnitComplex<N2>) -> bool {
2019-03-23 21:29:07 +08:00
crate::is_convertible::<_, UnitComplex<N1>>(q)
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(q: &UnitComplex<N2>) -> Self {
2019-03-23 21:29:07 +08:00
let q: UnitComplex<N1> = crate::convert_ref_unchecked(q);
q.to_rotation_matrix()
}
}
impl<N1, N2, D: DimName, R> SubsetOf<Isometry<N2, D, R>> for Rotation<N1, D>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2020-03-21 19:16:46 +08:00
R: AbstractRotation<N2, D> + SupersetOf<Self>,
2018-02-02 19:26:35 +08:00
DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D>,
{
#[inline]
fn to_superset(&self) -> Isometry<N2, D, R> {
2019-03-23 21:29:07 +08:00
Isometry::from_parts(Translation::identity(), crate::convert_ref(self))
}
#[inline]
fn is_in_subset(iso: &Isometry<N2, D, R>) -> bool {
iso.translation.vector.is_zero()
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(iso: &Isometry<N2, D, R>) -> Self {
2019-03-23 21:29:07 +08:00
crate::convert_ref_unchecked(&iso.rotation)
}
}
impl<N1, N2, D: DimName, R> SubsetOf<Similarity<N2, D, R>> for Rotation<N1, D>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2020-03-21 19:16:46 +08:00
R: AbstractRotation<N2, D> + SupersetOf<Self>,
2018-02-02 19:26:35 +08:00
DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D>,
{
#[inline]
fn to_superset(&self) -> Similarity<N2, D, R> {
2019-03-23 21:29:07 +08:00
Similarity::from_parts(Translation::identity(), crate::convert_ref(self), N2::one())
}
#[inline]
fn is_in_subset(sim: &Similarity<N2, D, R>) -> bool {
2018-02-02 19:26:35 +08:00
sim.isometry.translation.vector.is_zero() && sim.scaling() == N2::one()
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(sim: &Similarity<N2, D, R>) -> Self {
2019-03-23 21:29:07 +08:00
crate::convert_ref_unchecked(&sim.isometry.rotation)
}
}
impl<N1, N2, D, C> SubsetOf<Transform<N2, D, C>> for Rotation<N1, D>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2018-02-02 19:26:35 +08:00
C: SuperTCategoryOf<TAffine>,
D: DimNameAdd<U1> + DimMin<D, Output = D>, // needed by .is_special_orthogonal()
DefaultAllocator: Allocator<N1, D, D>
+ Allocator<N2, D, D>
+ Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>>
+ Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>
+ Allocator<(usize, usize), D>,
{
// needed by .is_special_orthogonal()
#[inline]
fn to_superset(&self) -> Transform<N2, D, C> {
Transform::from_matrix_unchecked(self.to_homogeneous().to_superset())
}
#[inline]
fn is_in_subset(t: &Transform<N2, D, C>) -> bool {
<Self as SubsetOf<_>>::is_in_subset(t.matrix())
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(t: &Transform<N2, D, C>) -> Self {
Self::from_superset_unchecked(t.matrix())
}
}
impl<N1, N2, D> SubsetOf<MatrixN<N2, DimNameSum<D, U1>>> for Rotation<N1, D>
2018-02-02 19:26:35 +08:00
where
2019-03-25 18:21:41 +08:00
N1: RealField,
N2: RealField + SupersetOf<N1>,
2018-02-02 19:26:35 +08:00
D: DimNameAdd<U1> + DimMin<D, Output = D>, // needed by .is_special_orthogonal()
DefaultAllocator: Allocator<N1, D, D>
+ Allocator<N2, D, D>
+ Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>>
+ Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>
+ Allocator<(usize, usize), D>,
{
// needed by .is_special_orthogonal()
#[inline]
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>> {
self.to_homogeneous().to_superset()
}
#[inline]
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool {
2018-02-02 19:26:35 +08:00
let rot = m.fixed_slice::<D, D>(0, 0);
let bottom = m.fixed_slice::<U1, D>(D::dim(), 0);
// Scalar types agree.
m.iter().all(|e| SupersetOf::<N1>::is_in_subset(e)) &&
// The block part is a rotation.
2019-03-23 21:29:07 +08:00
rot.is_special_orthogonal(N2::default_epsilon() * crate::convert(100.0)) &&
// The bottom row is (0, 0, ..., 1)
2018-02-02 19:26:35 +08:00
bottom.iter().all(|e| e.is_zero()) && m[(D::dim(), D::dim())] == N2::one()
}
#[inline]
2020-03-21 19:16:46 +08:00
fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self {
let r = m.fixed_slice::<D, D>(0, 0);
2019-03-23 21:29:07 +08:00
Self::from_matrix_unchecked(crate::convert_unchecked(r.into_owned()))
}
}
2017-07-25 23:55:54 +08:00
#[cfg(feature = "mint")]
2019-03-25 18:21:41 +08:00
impl<N: RealField> From<mint::EulerAngles<N, mint::IntraXYZ>> for Rotation3<N> {
2017-07-25 23:55:54 +08:00
fn from(euler: mint::EulerAngles<N, mint::IntraXYZ>) -> Self {
Self::from_euler_angles(euler.a, euler.b, euler.c)
}
}
2019-03-25 18:21:41 +08:00
impl<N: RealField> From<Rotation2<N>> for Matrix3<N> {
#[inline]
2020-03-21 19:16:46 +08:00
fn from(q: Rotation2<N>) -> Self {
q.to_homogeneous()
}
}
2019-03-25 18:21:41 +08:00
impl<N: RealField> From<Rotation2<N>> for Matrix2<N> {
#[inline]
fn from(q: Rotation2<N>) -> Self {
q.into_inner()
}
}
2019-03-25 18:21:41 +08:00
impl<N: RealField> From<Rotation3<N>> for Matrix4<N> {
#[inline]
fn from(q: Rotation3<N>) -> Self {
q.to_homogeneous()
}
}
2019-03-25 18:21:41 +08:00
impl<N: RealField> From<Rotation3<N>> for Matrix3<N> {
#[inline]
fn from(q: Rotation3<N>) -> Self {
q.into_inner()
}
}