#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"
namespace Msp {
namespace Geometry {
+/**
+A shape consisting of the points within a specific distance from the origin.
+Two- and three-dimensional cases are Circle and Sphere, respectively.
+*/
template<typename T, unsigned D>
class HyperSphere: public Shape<T, D>
{
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);
for(int i=-1; i<=1; i+=2)
{
T x = mid+offset*i;
- if(x>0 && n<size)
+ if(ray.check_limits(x) && n<size)
{
if(points)
{
points[n].position = ray.get_start()+ray.get_direction()*x;
points[n].normal = normalize(points[n].position);
+ points[n].distance = x;
}
++n;