#include <cmath>
#include <stdexcept>
#include <msp/linal/vector.h>
-#include "ray.h"
#include "shape.h"
-#include "surfacepoint.h"
namespace Msp {
namespace Geometry {
const LinAl::Vector<T, D> &get_dimensions() const { return dimensions; }
T get_dimension(unsigned) const;
- virtual HyperBox<T, D> get_axis_aligned_bounding_box() const { return *this; }
+ virtual BoundingBox<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 { return 2; }
virtual unsigned get_intersections(const Ray<T, D> &, SurfacePoint<T, D> *, unsigned) const;
};
return dimensions[i];
}
+template<typename T, unsigned D>
+inline BoundingBox<T, D> HyperBox<T, D>::get_axis_aligned_bounding_box() const
+{
+ LinAl::Vector<T, D> half_dim = dimensions/T(2);
+ return BoundingBox<T, D>(-half_dim, half_dim);
+}
+
template<typename T, unsigned D>
inline bool HyperBox<T, D>::contains(const LinAl::Vector<T, D> &point) const
{
using std::abs;
for(unsigned i=0; i<D; ++i)
- if(abs(point[i])>dimensions[i]/2)
+ if(abs(point[i])>dimensions[i]/T(2))
return false;
return true;
}
-template<typename T, unsigned D>
-inline bool HyperBox<T, D>::check_intersection(const Ray<T, D> &ray) const
-{
- return get_intersections(ray, 0, 1);
-}
-
template<typename T, unsigned D>
inline unsigned HyperBox<T, D>::get_intersections(const Ray<T, D> &ray, SurfacePoint<T, D> *points, unsigned size) const
{
using std::abs;
+ if(size>2)
+ size = 2;
+
LinAl::Vector<T, D> half_dim = dimensions/T(2);
unsigned n = 0;
- for(unsigned i=0; i<D; ++i)
+ for(unsigned i=0; (n<size && i<D); ++i)
{
if(!ray.get_direction()[i])
continue;
- for(int j=-1; j<=1; j+=2)
+ for(int j=-1; (n<size && j<=1); j+=2)
{
T x = (T(j)*half_dim[i]-ray.get_start()[i])/ray.get_direction()[i];
if(!ray.check_limits(x))
for(unsigned k=0; (inside && k<D); ++k)
inside = (k==i || abs(p[k])<=half_dim[k]);
- if(inside && n<size)
+ if(inside)
{
if(points)
{
}
++n;
- if(n==size || n==2)
- return n;
}
}
}