virtual HyperBox<T, D> get_axis_aligned_bounding_box() const;
virtual bool contains(const LinAl::Vector<T, D> &) const;
- virtual bool check_intersection(const Ray<T, D> &) const;
virtual unsigned get_max_ray_intersections() const;
virtual unsigned get_intersections(const Ray<T, D> &, SurfacePoint<T, D> *, unsigned) const;
};
return base->contains(LinAl::Vector<T, D-1>(point));
}
-template<typename T, unsigned D>
-inline bool ExtrudedShape<T, D>::check_intersection(const Ray<T, D> &ray) const
-{
- return get_intersections(ray, 0, 1);
-}
-
template<typename T, unsigned D>
inline unsigned ExtrudedShape<T, D>::get_max_ray_intersections() const
{
base_points = reinterpret_cast<SurfacePoint<T, D-1> *>(points+size)-size;
unsigned count = base->get_intersections(base_ray, base_points, size);
- for(unsigned i=0; i<count; ++i)
+ for(unsigned i=0; (n<size && i<count); ++i)
{
if(points)
{
}
++n;
- if(n==size)
- return n;
}
}
/* If the ray is not parallel to the base space, it may pass through the
caps. */
- if(ray_direction[D-1])
+ if(n<size && ray_direction[D-1])
{
- for(int i=-1; i<=1; i+=2)
+ for(int i=-1; (n<size && i<=1); i+=2)
{
T x = (half_length*i-ray_start[D-1])/ray_direction[D-1];
if(!ray.check_limits(x))
continue;
LinAl::Vector<T, D> p = ray_start+ray_direction*x;
- if(base->contains(LinAl::Vector<T, D-1>(p)) && n<size)
+ if(base->contains(LinAl::Vector<T, D-1>(p)))
{
if(points)
{
points[n].normal = LinAl::Vector<T, D>();
points[n].normal[D-1] = i;
points[n].distance = x;
-
- if(n==1 && x<points[0].distance)
- swap(points[0], points[1]);
}
++n;
- if(n==size)
- return n;
}
}
+
+ sort_points(points, n);
}
return n;