X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Fgeometry%2Ftransformedshape.h;h=6a14b0b75a1951f69a72cc9c3034fb56161dfc49;hb=4bb4d03d5a6a0252083d6bc45b8a50fe7b504c51;hp=ea7281f746067c8d0c4dcb757edd1120ee0c903b;hpb=9260eee3126731c1e6b54ce3407be757d0d71716;p=libs%2Fmath.git diff --git a/source/geometry/transformedshape.h b/source/geometry/transformedshape.h index ea7281f..6a14b0b 100644 --- a/source/geometry/transformedshape.h +++ b/source/geometry/transformedshape.h @@ -2,12 +2,14 @@ #define MSP_GEOMETRY_TRANSFORMEDSHAPE_H_ #include "affinetransformation.h" -#include "ray.h" #include "shape.h" namespace Msp { namespace Geometry { +/** +A shape modified by an affine transformation. +*/ template class TransformedShape: public Shape { @@ -27,9 +29,8 @@ public: const Shape &get_shape() const { return *shape; } const AffineTransformation &get_transformation() const { return transformation; } - virtual HyperBox get_axis_aligned_bounding_box() const; + virtual BoundingBox get_axis_aligned_bounding_box() const; virtual bool contains(const LinAl::Vector &) const; - virtual bool check_intersection(const Ray &) const; virtual unsigned get_max_ray_intersections() const { return shape->get_max_ray_intersections(); } virtual unsigned get_intersections(const Ray &, SurfacePoint *, unsigned) const; }; @@ -42,7 +43,7 @@ inline TransformedShape::TransformedShape(const Shape &s, const Affi { } template -inline TransformedShape::TransformedShape(const TransformedShape &other): +inline TransformedShape::TransformedShape(const TransformedShape &other): shape(other.shape->clone()), transformation(other.transformation), inverse_trans(other.inverse_trans) @@ -70,10 +71,9 @@ inline TransformedShape *TransformedShape::clone() const } template -inline HyperBox TransformedShape::get_axis_aligned_bounding_box() const +inline BoundingBox TransformedShape::get_axis_aligned_bounding_box() const { - // XXX This is not correct for most shapes - return shape->get_axis_aligned_bounding_box(); + return transformation.transform(shape->get_axis_aligned_bounding_box()); } template @@ -82,19 +82,11 @@ inline bool TransformedShape::contains(const LinAl::Vector &point) c return shape->contains(inverse_trans.transform(point)); } -template -inline bool TransformedShape::check_intersection(const Ray &ray) const -{ - Ray local_ray(inverse_trans.transform(ray.get_start()), - inverse_trans.transform_linear(ray.get_direction())); - return shape->check_intersection(local_ray); -} - template inline unsigned TransformedShape::get_intersections(const Ray &ray, SurfacePoint *points, unsigned size) const { - Ray local_ray(inverse_trans.transform(ray.get_start()), - inverse_trans.transform_linear(ray.get_direction())); + Ray local_ray = inverse_trans.transform(ray); + unsigned count = shape->get_intersections(local_ray, points, size); if(points) { @@ -103,7 +95,8 @@ inline unsigned TransformedShape::get_intersections(const Ray &ray, points[i].position = transformation.transform(points[i].position); /* XXX This is not correct for nonuniform scaling. Inverse of the transpose of the upper DxD part of the matrix should be used. */ - points[i].normal = transformation.transform(points[i].normal); + points[i].normal = transformation.transform_linear(points[i].normal); + points[i].distance = inner_product(points[i].position-ray.get_start(), ray.get_direction()); } } return count;