nalgebra/src/geometry/similarity.rs

442 lines
14 KiB
Rust
Raw Normal View History

2018-05-19 21:41:58 +08:00
use approx::{AbsDiffEq, RelativeEq, UlpsEq};
use num::Zero;
use std::fmt;
use std::hash;
2018-07-20 21:25:55 +08:00
#[cfg(feature = "abomonation-serialize")]
use std::io::{Result as IOResult, Write};
#[cfg(feature = "serde-serialize-no-std")]
2018-10-22 13:00:10 +08:00
use serde::{Deserialize, Serialize};
#[cfg(feature = "abomonation-serialize")]
use abomonation::Abomonation;
2020-03-21 19:16:46 +08:00
use simba::scalar::{RealField, SubsetOf};
use simba::simd::SimdRealField;
2019-03-23 21:29:07 +08:00
use crate::base::allocator::Allocator;
use crate::base::dimension::{DimNameAdd, DimNameSum, U1};
use crate::base::storage::Owned;
2021-04-11 17:00:38 +08:00
use crate::base::{Const, DefaultAllocator, OMatrix, SVector, Scalar};
2020-03-21 19:16:46 +08:00
use crate::geometry::{AbstractRotation, Isometry, Point, Translation};
2017-02-13 01:17:09 +08:00
/// A similarity, i.e., an uniform scaling, followed by a rotation, followed by a translation.
#[repr(C)]
#[derive(Debug)]
#[cfg_attr(feature = "serde-serialize-no-std", derive(Serialize, Deserialize))]
2018-05-19 21:41:58 +08:00
#[cfg_attr(
feature = "serde-serialize-no-std",
2021-07-10 04:30:06 +08:00
serde(bound(serialize = "T: Scalar + Serialize,
R: Serialize,
2021-04-11 17:00:38 +08:00
DefaultAllocator: Allocator<T, Const<D>>,
Owned<T, Const<D>>: Serialize"))
2018-05-19 21:41:58 +08:00
)]
#[cfg_attr(
feature = "serde-serialize-no-std",
2021-07-10 04:30:06 +08:00
serde(bound(deserialize = "T: Scalar + Deserialize<'de>,
R: Deserialize<'de>,
2021-04-11 17:00:38 +08:00
DefaultAllocator: Allocator<T, Const<D>>,
Owned<T, Const<D>>: Deserialize<'de>"))
2018-05-19 21:41:58 +08:00
)]
pub struct Similarity<T, R, const D: usize> {
2017-02-13 01:17:09 +08:00
/// The part of this similarity that does not include the scaling factor.
2021-04-11 17:00:38 +08:00
pub isometry: Isometry<T, R, D>,
scaling: T,
}
#[cfg(feature = "abomonation-serialize")]
2021-04-11 17:00:38 +08:00
impl<T: Scalar, R, const D: usize> Abomonation for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
2021-04-11 17:00:38 +08:00
Isometry<T, R, D>: Abomonation,
{
2018-07-20 21:25:55 +08:00
unsafe fn entomb<W: Write>(&self, writer: &mut W) -> IOResult<()> {
self.isometry.entomb(writer)
}
2018-07-20 21:25:55 +08:00
fn extent(&self) -> usize {
self.isometry.extent()
}
unsafe fn exhume<'a, 'b>(&'a mut self, bytes: &'b mut [u8]) -> Option<&'b mut [u8]> {
self.isometry.exhume(bytes)
}
}
2021-04-11 17:00:38 +08:00
impl<T: Scalar + hash::Hash, R: hash::Hash, const D: usize> hash::Hash for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
Owned<T, Const<D>>: hash::Hash,
2018-02-02 19:26:35 +08:00
{
fn hash<H: hash::Hasher>(&self, state: &mut H) {
self.isometry.hash(state);
self.scaling.hash(state);
}
}
2021-04-11 17:00:38 +08:00
impl<T: Scalar + Copy + Zero, R: AbstractRotation<T, D> + Copy, const D: usize> Copy
for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
Owned<T, Const<D>>: Copy,
2020-03-21 19:16:46 +08:00
{
}
2021-04-11 17:00:38 +08:00
impl<T: Scalar + Zero, R: AbstractRotation<T, D> + Clone, const D: usize> Clone
for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
{
#[inline]
fn clone(&self) -> Self {
Similarity::from_isometry(self.isometry.clone(), self.scaling.clone())
}
}
2021-04-11 17:00:38 +08:00
impl<T: Scalar + Zero, R, const D: usize> Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
2021-04-11 17:00:38 +08:00
R: AbstractRotation<T, D>,
2018-02-02 19:26:35 +08:00
{
/// Creates a new similarity from its rotational and translational parts.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn from_parts(translation: Translation<T, D>, rotation: R, scaling: T) -> Self {
Self::from_isometry(Isometry::from_parts(translation, rotation), scaling)
}
/// Creates a new similarity from its rotational and translational parts.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn from_isometry(isometry: Isometry<T, R, D>, scaling: T) -> Self {
assert!(!scaling.is_zero(), "The scaling factor must not be zero.");
2020-03-21 19:16:46 +08:00
Self { isometry, scaling }
}
/// The scaling factor of this similarity transformation.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn set_scaling(&mut self, scaling: T) {
assert!(
!scaling.is_zero(),
"The similarity scaling factor must not be zero."
);
self.scaling = scaling;
}
}
2021-04-11 17:00:38 +08:00
impl<T: Scalar, R, const D: usize> Similarity<T, R, D> {
/// The scaling factor of this similarity transformation.
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn scaling(&self) -> T {
self.scaling.clone()
}
}
2021-04-11 17:00:38 +08:00
impl<T: SimdRealField, R, const D: usize> Similarity<T, R, D>
where
2021-04-11 17:00:38 +08:00
T::Element: SimdRealField,
R: AbstractRotation<T, D>,
{
/// Creates a new similarity that applies only a scaling factor.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn from_scaling(scaling: T) -> Self {
Self::from_isometry(Isometry::identity(), scaling)
}
/// Inverts `self`.
#[inline]
#[must_use = "Did you mean to use inverse_mut()?"]
pub fn inverse(&self) -> Self {
let mut res = self.clone();
res.inverse_mut();
res
}
/// Inverts `self` in-place.
#[inline]
pub fn inverse_mut(&mut self) {
self.scaling = T::one() / self.scaling.clone();
self.isometry.inverse_mut();
self.isometry.translation.vector *= self.scaling.clone();
}
/// The similarity transformation that applies a scaling factor `scaling` before `self`.
#[inline]
#[must_use = "Did you mean to use prepend_scaling_mut()?"]
2021-04-11 17:00:38 +08:00
pub fn prepend_scaling(&self, scaling: T) -> Self {
2018-02-02 19:26:35 +08:00
assert!(
!scaling.is_zero(),
2018-02-02 19:26:35 +08:00
"The similarity scaling factor must not be zero."
);
Self::from_isometry(self.isometry.clone(), self.scaling.clone() * scaling)
}
/// The similarity transformation that applies a scaling factor `scaling` after `self`.
#[inline]
#[must_use = "Did you mean to use append_scaling_mut()?"]
2021-04-11 17:00:38 +08:00
pub fn append_scaling(&self, scaling: T) -> Self {
2018-02-02 19:26:35 +08:00
assert!(
!scaling.is_zero(),
2018-02-02 19:26:35 +08:00
"The similarity scaling factor must not be zero."
);
Self::from_parts(
Translation::from(&self.isometry.translation.vector * scaling.clone()),
self.isometry.rotation.clone(),
self.scaling.clone() * scaling,
2018-02-02 19:26:35 +08:00
)
}
/// Sets `self` to the similarity transformation that applies a scaling factor `scaling` before `self`.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn prepend_scaling_mut(&mut self, scaling: T) {
2018-02-02 19:26:35 +08:00
assert!(
!scaling.is_zero(),
2018-02-02 19:26:35 +08:00
"The similarity scaling factor must not be zero."
);
self.scaling *= scaling
}
/// Sets `self` to the similarity transformation that applies a scaling factor `scaling` after `self`.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn append_scaling_mut(&mut self, scaling: T) {
2018-02-02 19:26:35 +08:00
assert!(
!scaling.is_zero(),
2018-02-02 19:26:35 +08:00
"The similarity scaling factor must not be zero."
);
self.isometry.translation.vector *= scaling.clone();
self.scaling *= scaling;
}
/// Appends to `self` the given translation in-place.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn append_translation_mut(&mut self, t: &Translation<T, D>) {
self.isometry.append_translation_mut(t)
}
/// Appends to `self` the given rotation in-place.
#[inline]
pub fn append_rotation_mut(&mut self, r: &R) {
self.isometry.append_rotation_mut(r)
}
/// Appends in-place to `self` a rotation centered at the point `p`, i.e., the rotation that
/// lets `p` invariant.
#[inline]
2021-04-11 17:00:38 +08:00
pub fn append_rotation_wrt_point_mut(&mut self, r: &R, p: &Point<T, D>) {
self.isometry.append_rotation_wrt_point_mut(r, p)
}
/// Appends in-place to `self` a rotation centered at the point with coordinates
/// `self.translation`.
#[inline]
pub fn append_rotation_wrt_center_mut(&mut self, r: &R) {
self.isometry.append_rotation_wrt_center_mut(r)
}
/// Transform the given point by this similarity.
///
/// This is the same as the multiplication `self * pt`.
///
/// # Example
/// ```
/// # #[macro_use] extern crate approx;
/// # use std::f32;
/// # use nalgebra::{Point3, Similarity3, Vector3};
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
/// let translation = Vector3::new(1.0, 2.0, 3.0);
/// let sim = Similarity3::new(translation, axisangle, 3.0);
/// let transformed_point = sim.transform_point(&Point3::new(4.0, 5.0, 6.0));
/// assert_relative_eq!(transformed_point, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
/// ```
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn transform_point(&self, pt: &Point<T, D>) -> Point<T, D> {
self * pt
}
/// Transform the given vector by this similarity, ignoring the translational
/// component.
///
/// This is the same as the multiplication `self * t`.
///
/// # Example
/// ```
/// # #[macro_use] extern crate approx;
/// # use std::f32;
/// # use nalgebra::{Similarity3, Vector3};
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
/// let translation = Vector3::new(1.0, 2.0, 3.0);
/// let sim = Similarity3::new(translation, axisangle, 3.0);
/// let transformed_vector = sim.transform_vector(&Vector3::new(4.0, 5.0, 6.0));
/// assert_relative_eq!(transformed_vector, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);
/// ```
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn transform_vector(&self, v: &SVector<T, D>) -> SVector<T, D> {
self * v
}
/// Transform the given point by the inverse of this similarity. This may
/// be cheaper than inverting the similarity and then transforming the
/// given point.
///
/// # Example
/// ```
/// # #[macro_use] extern crate approx;
/// # use std::f32;
/// # use nalgebra::{Point3, Similarity3, Vector3};
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
/// let translation = Vector3::new(1.0, 2.0, 3.0);
/// let sim = Similarity3::new(translation, axisangle, 2.0);
/// let transformed_point = sim.inverse_transform_point(&Point3::new(4.0, 5.0, 6.0));
/// assert_relative_eq!(transformed_point, Point3::new(-1.5, 1.5, 1.5), epsilon = 1.0e-5);
/// ```
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn inverse_transform_point(&self, pt: &Point<T, D>) -> Point<T, D> {
self.isometry.inverse_transform_point(pt) / self.scaling()
}
/// Transform the given vector by the inverse of this similarity,
/// ignoring the translational component. This may be cheaper than
/// inverting the similarity and then transforming the given vector.
///
/// # Example
/// ```
/// # #[macro_use] extern crate approx;
/// # use std::f32;
/// # use nalgebra::{Similarity3, Vector3};
/// let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
/// let translation = Vector3::new(1.0, 2.0, 3.0);
/// let sim = Similarity3::new(translation, axisangle, 2.0);
/// let transformed_vector = sim.inverse_transform_vector(&Vector3::new(4.0, 5.0, 6.0));
/// assert_relative_eq!(transformed_vector, Vector3::new(-3.0, 2.5, 2.0), epsilon = 1.0e-5);
/// ```
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn inverse_transform_vector(&self, v: &SVector<T, D>) -> SVector<T, D> {
self.isometry.inverse_transform_vector(v) / self.scaling()
}
}
2018-09-24 12:48:42 +08:00
// NOTE: we don't require `R: Rotation<...>` here because this is not useful for the implementation
// and makes it harder to use it, e.g., for Transform × Isometry implementation.
// This is OK since all constructors of the isometry enforce the Rotation bound already (and
// explicit struct construction is prevented by the private scaling factor).
2021-04-11 17:00:38 +08:00
impl<T: SimdRealField, R, const D: usize> Similarity<T, R, D> {
/// Converts this similarity into its equivalent homogeneous transformation matrix.
#[inline]
#[must_use]
2021-04-11 17:00:38 +08:00
pub fn to_homogeneous(&self) -> OMatrix<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>
2018-02-02 19:26:35 +08:00
where
Const<D>: DimNameAdd<U1>,
2021-04-11 17:00:38 +08:00
R: SubsetOf<OMatrix<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>>,
DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>,
2018-02-02 19:26:35 +08:00
{
let mut res = self.isometry.to_homogeneous();
2021-04-11 17:00:38 +08:00
for e in res.fixed_slice_mut::<D, D>(0, 0).iter_mut() {
*e *= self.scaling.clone()
}
res
}
}
2021-04-11 17:00:38 +08:00
impl<T: SimdRealField, R, const D: usize> Eq for Similarity<T, R, D> where
R: AbstractRotation<T, D> + Eq
2020-03-21 19:16:46 +08:00
{
}
2021-04-11 17:00:38 +08:00
impl<T: SimdRealField, R, const D: usize> PartialEq for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
2021-04-11 17:00:38 +08:00
R: AbstractRotation<T, D> + PartialEq,
2018-02-02 19:26:35 +08:00
{
#[inline]
fn eq(&self, right: &Self) -> bool {
self.isometry == right.isometry && self.scaling == right.scaling
}
}
2021-04-11 17:00:38 +08:00
impl<T: RealField, R, const D: usize> AbsDiffEq for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
2021-04-11 17:00:38 +08:00
R: AbstractRotation<T, D> + AbsDiffEq<Epsilon = T::Epsilon>,
T::Epsilon: Clone,
2018-02-02 19:26:35 +08:00
{
2021-04-11 17:00:38 +08:00
type Epsilon = T::Epsilon;
#[inline]
fn default_epsilon() -> Self::Epsilon {
2021-04-11 17:00:38 +08:00
T::default_epsilon()
}
#[inline]
2018-05-19 21:41:58 +08:00
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
self.isometry.abs_diff_eq(&other.isometry, epsilon.clone())
2018-05-19 21:41:58 +08:00
&& self.scaling.abs_diff_eq(&other.scaling, epsilon)
}
2018-05-19 21:41:58 +08:00
}
2021-04-11 17:00:38 +08:00
impl<T: RealField, R, const D: usize> RelativeEq for Similarity<T, R, D>
2018-05-19 21:41:58 +08:00
where
2021-04-11 17:00:38 +08:00
R: AbstractRotation<T, D> + RelativeEq<Epsilon = T::Epsilon>,
T::Epsilon: Clone,
2018-05-19 21:41:58 +08:00
{
#[inline]
2018-05-19 21:41:58 +08:00
fn default_max_relative() -> Self::Epsilon {
2021-04-11 17:00:38 +08:00
T::default_max_relative()
}
#[inline]
2018-02-02 19:26:35 +08:00
fn relative_eq(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon,
2020-04-06 00:49:48 +08:00
) -> bool {
2018-02-02 19:26:35 +08:00
self.isometry
.relative_eq(&other.isometry, epsilon.clone(), max_relative.clone())
2018-07-20 21:25:55 +08:00
&& self
.scaling
2018-02-02 19:26:35 +08:00
.relative_eq(&other.scaling, epsilon, max_relative)
}
2018-05-19 21:41:58 +08:00
}
2021-04-11 17:00:38 +08:00
impl<T: RealField, R, const D: usize> UlpsEq for Similarity<T, R, D>
2018-05-19 21:41:58 +08:00
where
2021-04-11 17:00:38 +08:00
R: AbstractRotation<T, D> + UlpsEq<Epsilon = T::Epsilon>,
T::Epsilon: Clone,
2018-05-19 21:41:58 +08:00
{
#[inline]
fn default_max_ulps() -> u32 {
2021-04-11 17:00:38 +08:00
T::default_max_ulps()
2018-05-19 21:41:58 +08:00
}
#[inline]
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
self.isometry
.ulps_eq(&other.isometry, epsilon.clone(), max_ulps)
2018-02-02 19:26:35 +08:00
&& self.scaling.ulps_eq(&other.scaling, epsilon, max_ulps)
}
}
/*
*
* Display
*
*/
2021-04-11 17:00:38 +08:00
impl<T, R, const D: usize> fmt::Display for Similarity<T, R, D>
2018-02-02 19:26:35 +08:00
where
2021-04-11 17:00:38 +08:00
T: RealField + fmt::Display,
R: AbstractRotation<T, D> + fmt::Display,
2018-02-02 19:26:35 +08:00
{
2021-07-26 01:06:14 +08:00
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
let precision = f.precision().unwrap_or(3);
2019-03-23 21:29:07 +08:00
writeln!(f, "Similarity {{")?;
write!(f, "{:.*}", precision, self.isometry)?;
write!(f, "Scaling: {:.*}", precision, self.scaling)?;
writeln!(f, "}}")
}
}