private:
Shape<T, D> *shape;
AffineTransformation<T, D> transformation;
+ AffineTransformation<T, D> inverse_trans;
public:
TransformedShape(const Shape<T, D> &, const AffineTransformation<T, D> &);
template<typename T, unsigned D>
inline TransformedShape<T, D>::TransformedShape(const Shape<T, D> &s, const AffineTransformation<T, D> &t):
shape(s.clone()),
- transformation(t)
+ transformation(t),
+ inverse_trans(invert(t))
{ }
template<typename T, unsigned D>
inline TransformedShape<T, D>::TransformedShape(const TransformedShape &other):
shape(other.shape->clone()),
- transformation(other.transformation)
+ transformation(other.transformation),
+ inverse_trans(other.inverse_trans)
{ }
template<typename T, unsigned D>
delete shape;
shape = other.shape->clone();
transformation = other.transformation;
+ inverse_trans = other.inverse_trans;
}
template<typename T, unsigned D>
template<typename T, unsigned D>
inline bool TransformedShape<T, D>::check_intersection(const Ray<T, D> &ray) const
{
- // TODO cache the inverse transformation for performance
- LinAl::SquareMatrix<T, D+1> inverse_trans = LinAl::invert(transformation.get_matrix());
- Ray<T, D> trans_ray(reduce_vector(inverse_trans*augment_vector(ray.get_start(), T(1))),
- reduce_vector(inverse_trans*augment_vector(ray.get_direction(), T(0))));
- return shape->check_intersection(trans_ray);
+ Ray<T, D> local_ray(inverse_trans.transform(ray.get_start()),
+ inverse_trans.transform_linear(ray.get_direction()));
+ return shape->check_intersection(local_ray);
}
} // namespace Geometry