- // 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);
+ if(detail)
+ return this->bisect_axis_aligned_bounding_box(detail);
+
+ return transformation.transform(shape->get_axis_aligned_bounding_box());
+}
+
+template<typename T, unsigned D>
+inline bool TransformedShape<T, D>::contains(const LinAl::Vector<T, D> &point) const
+{
+ return shape->contains(inverse_trans.transform(point));
+}
+
+template<typename T, unsigned D>
+inline unsigned TransformedShape<T, D>::get_intersections(const Ray<T, D> &ray, SurfacePoint<T, D> *points, unsigned size) const
+{
+ Ray<T, D> local_ray = inverse_trans.transform(ray);
+
+ unsigned count = shape->get_intersections(local_ray, points, size);
+ if(points)
+ {
+ for(unsigned i=0; i<count; ++i)
+ {
+ 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_linear(points[i].normal);
+ points[i].distance = inner_product(points[i].position-ray.get_start(), ray.get_direction());
+ }
+ }
+ return count;
+}
+
+template<typename T, unsigned D>
+inline Coverage TransformedShape<T, D>::get_coverage(const BoundingBox<T, D> &bbox) const
+{
+ BoundingBox<T, D> local_bbox = inverse_trans.transform(bbox);
+ Coverage coverage = shape->get_coverage(local_bbox);
+ if(coverage==PARTIAL_COVERAGE)
+ {
+ BoundingBox<T, D> outer_bbox = transformation.transform(local_bbox);
+ LinAl::Vector<T, D> min_pt = local_bbox.get_minimum_point();
+ LinAl::Vector<T, D> max_pt = local_bbox.get_maximum_point();
+ for(unsigned i=0; i<D; ++i)
+ {
+ T scale_ratio = (1-bbox.get_dimension(i)/outer_bbox.get_dimension(i))*local_bbox.get_dimension(i);
+ T low_gap = bbox.get_minimum_coordinate(i)-outer_bbox.get_minimum_coordinate(i);
+ T high_gap = outer_bbox.get_maximum_coordinate(i)-bbox.get_maximum_coordinate(i);
+ min_pt[i] += low_gap*scale_ratio;
+ max_pt[i] -= high_gap-scale_ratio;
+ }
+
+ local_bbox = BoundingBox<T, D>(min_pt, max_pt);
+ if(shape->get_coverage(local_bbox)>=PARTIAL_COVERAGE)
+ return PARTIAL_COVERAGE;
+ else
+ return UNCERTAIN_COVERAGE;
+ }
+ else
+ return coverage;