T radius;
public:
- HyperSphere();
+ HyperSphere(): radius(1) { }
explicit HyperSphere(T);
virtual HyperSphere *clone() const;
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 { return 2; }
virtual unsigned get_intersections(const Ray<T, D> &, SurfacePoint<T, D> *, unsigned) const;
};
-template<typename T, unsigned D>
-inline HyperSphere<T, D>::HyperSphere():
- radius(1)
-{ }
-
template<typename T, unsigned D>
inline HyperSphere<T, D>::HyperSphere(T r):
radius(r)
return inner_product(point, point)<=radius*radius;
}
-template<typename T, unsigned D>
-inline bool HyperSphere<T, D>::check_intersection(const Ray<T, D> &ray) const
-{
- T x = inner_product(ray.get_direction(), ray.get_start());
- if(x>0)
- return contains(ray.get_start());
- else
- return contains(ray.get_start()-ray.get_direction()*x);
-}
-
template<typename T, unsigned D>
inline unsigned HyperSphere<T, D>::get_intersections(const Ray<T, D> &ray, SurfacePoint<T, D> *points, unsigned size) const
{
T offset = sqrt(offset_sq);
unsigned n = 0;
- for(int i=-1; i<=1; i+=2)
+ for(int i=-1; (n<size && i<=1); i+=2)
{
T x = mid+offset*i;
- if(ray.check_limits(x) && n<size)
+ if(ray.check_limits(x))
{
if(points)
{
}
++n;
- if(n==size)
- return n;
}
}