X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Fgeometry%2Fhypersphere.h;h=3c0412564fcc1cf055842c9d325943935812746a;hb=09cc3a8648dd20e9a07d669b353c4a120b67c1c4;hp=35cddd1ac36461f4ee2a0e00122abda491ce3b0a;hpb=1e34b120f1229b1390cee67c917829715615ccd0;p=libs%2Fmath.git diff --git a/source/geometry/hypersphere.h b/source/geometry/hypersphere.h index 35cddd1..3c04125 100644 --- a/source/geometry/hypersphere.h +++ b/source/geometry/hypersphere.h @@ -4,7 +4,7 @@ #include #include #include -#include "hyperbox.h" +#include "boundingbox.h" #include "ray.h" #include "shape.h" #include "surfacepoint.h" @@ -30,9 +30,8 @@ public: T get_radius() const { return radius; } - virtual HyperBox get_axis_aligned_bounding_box() const; + virtual BoundingBox get_axis_aligned_bounding_box() const; virtual bool contains(const LinAl::Vector &) const; - virtual bool check_intersection(const Ray &) const; virtual unsigned get_max_ray_intersections() const { return 2; } virtual unsigned get_intersections(const Ray &, SurfacePoint *, unsigned) const; }; @@ -52,12 +51,12 @@ inline HyperSphere *HyperSphere::clone() const } template -inline HyperBox HyperSphere::get_axis_aligned_bounding_box() const +inline BoundingBox HyperSphere::get_axis_aligned_bounding_box() const { - LinAl::Vector dimensions; + LinAl::Vector extent; for(unsigned i=0; i(dimensions); + extent[i] = radius; + return BoundingBox(-extent, extent); } template @@ -66,16 +65,6 @@ inline bool HyperSphere::contains(const LinAl::Vector &point) const return inner_product(point, point)<=radius*radius; } -template -inline bool HyperSphere::check_intersection(const Ray &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 inline unsigned HyperSphere::get_intersections(const Ray &ray, SurfacePoint *points, unsigned size) const { @@ -89,10 +78,10 @@ inline unsigned HyperSphere::get_intersections(const Ray &ray, Surfa T offset = sqrt(offset_sq); unsigned n = 0; - for(int i=-1; i<=1; i+=2) + for(int i=-1; (n::get_intersections(const Ray &ray, Surfa } ++n; - if(n==size) - return n; } }