1 #ifndef MSP_GEOMETRY_EXTRUDEDSHAPE_H_
2 #define MSP_GEOMETRY_EXTRUDEDSHAPE_H_
12 A shape embedded in space of dimension higher by one and extruded towards the
13 highest dimension. As an example, extruding a circle creates a cylinder. The
14 base shape's orientation is not changed.
16 template<typename T, unsigned D>
17 class ExtrudedShape: public Shape<T, D>
24 ExtrudedShape(const Shape<T, D-1> &, T);
25 ExtrudedShape(const ExtrudedShape &);
26 ExtrudedShape &operator=(const ExtrudedShape &);
27 virtual ~ExtrudedShape();
29 virtual ExtrudedShape *clone() const;
31 const Shape<T, D-1> &get_base() const { return *base; }
32 T get_length() const { return length; }
34 virtual HyperBox<T, D> get_axis_aligned_bounding_box() const;
35 virtual bool contains(const LinAl::Vector<T, D> &) const;
36 virtual bool check_intersection(const Ray<T, D> &) const;
37 virtual unsigned get_max_ray_intersections() const;
38 virtual unsigned get_intersections(const Ray<T, D> &, SurfacePoint<T, D> *, unsigned) const;
41 template<typename T, unsigned D>
42 inline ExtrudedShape<T, D>::ExtrudedShape(const Shape<T, D-1> &b, T l):
46 throw std::invalid_argument("ExtrudedShape::ExtrudedShape");
51 template<typename T, unsigned D>
52 inline ExtrudedShape<T, D>::ExtrudedShape(const ExtrudedShape<T, D> &other):
53 base(other.base.clone()),
57 template<typename T, unsigned D>
58 inline ExtrudedShape<T, D> &ExtrudedShape<T, D>::operator=(const ExtrudedShape<T, D> &other)
61 base = other.base.clone();
62 length = other.length;
65 template<typename T, unsigned D>
66 inline ExtrudedShape<T, D>::~ExtrudedShape()
71 template<typename T, unsigned D>
72 inline ExtrudedShape<T, D> *ExtrudedShape<T, D>::clone() const
74 return new ExtrudedShape<T, D>(*base, length);
77 template<typename T, unsigned D>
78 inline HyperBox<T, D> ExtrudedShape<T, D>::get_axis_aligned_bounding_box() const
80 HyperBox<T, D-1> base_bbox = base->get_axis_aligned_bounding_box();
81 return HyperBox<T, D>(LinAl::Vector<T, D>(base_bbox.get_dimensions(), length));
84 template<typename T, unsigned D>
85 inline bool ExtrudedShape<T, D>::contains(const LinAl::Vector<T, D> &point) const
89 if(abs(point[D-1])>length/T(2))
92 return base->contains(LinAl::Vector<T, D-1>(point));
95 template<typename T, unsigned D>
96 inline bool ExtrudedShape<T, D>::check_intersection(const Ray<T, D> &ray) const
98 return get_intersections(ray, 0, 1);
101 template<typename T, unsigned D>
102 inline unsigned ExtrudedShape<T, D>::get_max_ray_intersections() const
104 return std::max(base->get_max_ray_intersections(), 2U);
107 template<typename T, unsigned D>
108 inline unsigned ExtrudedShape<T, D>::get_intersections(const Ray<T, D> &ray, SurfacePoint<T, D> *points, unsigned size) const
113 T half_length = length/T(2);
114 const LinAl::Vector<T, D> &ray_start = ray.get_start();
115 const LinAl::Vector<T, D> &ray_direction = ray.get_direction();
116 LinAl::Vector<T, D-1> base_dir(ray_direction);
118 /* If the ray does not degenerate to a point in the base space, it could
119 intersect the base shape. */
120 if(inner_product(base_dir, base_dir)!=T(0))
124 if(ray.get_direction()[D-1]!=T(0))
126 offset = (half_length-ray_start[D-1])/ray_direction[D-1];
127 limit = (-half_length-ray_start[D-1])/ray_direction[D-1];
133 T distortion = base_dir.norm();
134 Ray<T, D-1> base_ray(LinAl::Vector<T, D-1>(ray_start+ray_direction*offset),
135 base_dir, (limit-offset)*distortion);
137 SurfacePoint<T, D-1> *base_points = 0;
139 /* Shamelessly reuse the provided storage. Align to the end of the array
140 so processing can start from the first (nearest) point. */
141 base_points = reinterpret_cast<SurfacePoint<T, D-1> *>(points+size)-size;
143 unsigned count = base->get_intersections(base_ray, base_points, size);
144 for(unsigned i=0; (n<size && i<count); ++i)
148 T x = offset+base_points[i].distance/distortion;
149 points[n].position = ray_start+ray_direction*x;
150 points[n].normal = LinAl::Vector<T, D>(base_points[i].normal, T(0));
151 points[n].distance = x;
158 /* If the ray is not parallel to the base space, it may pass through the
160 if(n<size && ray_direction[D-1])
162 for(int i=-1; (n<size && i<=1); i+=2)
164 T x = (half_length*i-ray_start[D-1])/ray_direction[D-1];
165 if(!ray.check_limits(x))
168 LinAl::Vector<T, D> p = ray_start+ray_direction*x;
169 if(base->contains(LinAl::Vector<T, D-1>(p)))
173 points[n].position = p;
174 points[n].normal = LinAl::Vector<T, D>();
175 points[n].normal[D-1] = i;
176 points[n].distance = x;
183 sort_points(points, n);
189 } // namespace Geometry