#ifndef MSP_GEOMETRY_HYPERSPHERE_H_
#define MSP_GEOMETRY_HYPERSPHERE_H_
+#include <cmath>
+#include <stdexcept>
#include <msp/linal/vector.h>
#include "hyperbox.h"
#include "ray.h"
T radius;
public:
- HyperSphere();
+ HyperSphere(): radius(1) { }
explicit HyperSphere(T);
virtual HyperSphere *clone() const;
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)
-{ }
+{
+ if(r<=T(0))
+ throw std::invalid_argument("HyperSphere::HyperShpere");
+}
template<typename T, unsigned D>
inline HyperSphere<T, D> *HyperSphere<T, D>::clone() const
template<typename T, unsigned D>
inline unsigned HyperSphere<T, D>::get_intersections(const Ray<T, D> &ray, SurfacePoint<T, D> *points, unsigned size) const
{
+ using std::sqrt;
+
T mid = -inner_product(ray.get_direction(), ray.get_start());
LinAl::Vector<T, D> nearest = ray.get_start()+ray.get_direction()*mid;
T offset_sq = radius*radius-inner_product(nearest, nearest);
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;
}
}