Give Vector constructors from one higher/lower dimension

[libs/math.git] / source / geometry / affinetransformation.h

diff --git a/source/geometry/affinetransformation.h b/source/geometry/affinetransformation.h
index 93fb91abf29f9955ffc83cf9307092a4ff78c2cb..0e377baaa51d633186969ace978494d79edfccf1 100644 (file)
--- a/source/geometry/affinetransformation.h
+++ b/source/geometry/affinetransformation.h
@@ -62,6 +62,9 @@ public:
        static AffineTransformation<T, D> scaling(const LinAl::Vector<T, D> &);
        static AffineTransformation<T, D> shear(const LinAl::Vector<T, D> &, const LinAl::Vector<T, D> &);
 
+       AffineTransformation &operator*=(const AffineTransformation &);
+       AffineTransformation &invert();
+
        const LinAl::SquareMatrix<T, D+1> &get_matrix() const { return matrix; }
        operator const LinAl::SquareMatrix<T, D+1> &() const { return matrix; }
 
@@ -137,46 +140,44 @@ AffineTransformation<T, 3> AffineTransformationOps<T, 3>::rotation(const Angle<T
        return r;
 }
 
-
-template<typename T, unsigned N>
-inline LinAl::Vector<T, N+1> augment_vector(const LinAl::Vector<T, N> &v, T s)
+template<typename T, unsigned D>
+inline AffineTransformation<T, D> &AffineTransformation<T, D>::operator*=(const AffineTransformation<T, D> &other)
 {
-       LinAl::Vector<T, N+1> r;
-       for(unsigned i=0; i<N; ++i)
-               r[i] = v[i];
-       r[N] = s;
-       return r;
+       matrix *= other.get_matrix();
+       return *this;
 }
 
-template<typename T, unsigned N>
-inline LinAl::Vector<T, N-1> reduce_vector(const LinAl::Vector<T, N> &v)
+template<typename T, unsigned D>
+inline AffineTransformation<T, D> operator*(const AffineTransformation<T, D> &at1, const AffineTransformation<T, D> &at2)
 {
-       LinAl::Vector<T, N-1> r;
-       for(unsigned i=0; i<N-1; ++i)
-               r[i] = v[i];
-       return r;
+       AffineTransformation<T, D> r = at1;
+       return r *= at2;
 }
 
-template<typename T, unsigned N>
-inline LinAl::Vector<T, N-1> divide_vector(const LinAl::Vector<T, N> &v)
+template<typename T, unsigned D>
+inline AffineTransformation<T, D> &AffineTransformation<T, D>::invert()
 {
-       LinAl::Vector<T, N-1> r;
-       for(unsigned i=0; i<N-1; ++i)
-               r[i] = v[i]/v[N-1];
-       return r;
+       matrix.invert();
+       return *this;
 }
 
+template<typename T, unsigned D>
+inline AffineTransformation<T, D> invert(const AffineTransformation<T, D> &at)
+{
+       AffineTransformation<T, D> r = at;
+       return r.invert();
+}
 
 template<typename T, unsigned D>
 inline LinAl::Vector<T, D> AffineTransformation<T, D>::transform(const LinAl::Vector<T, D> &v) const
 {
-       return reduce_vector(matrix*augment_vector(v, T(1)));
+       return LinAl::Vector<T, D>(matrix*LinAl::Vector<T, D+1>(v, T(1)));
 }
 
 template<typename T, unsigned D>
 inline LinAl::Vector<T, D> AffineTransformation<T, D>::transform_linear(const LinAl::Vector<T, D> &v) const
 {
-       return reduce_vector(matrix*augment_vector(v, T(0)));
+       return LinAl::Vector<T, D>(matrix*LinAl::Vector<T, D+1>(v, T(0)));
 }
 
 } // namespace Geometry