125 lines
3.7 KiB
C++
125 lines
3.7 KiB
C++
|
|
#ifndef SHAPE_H
|
|
#define SHAPE_H SHAPE_H
|
|
|
|
#include "util/Solver.h"
|
|
#include "util/Ray.h"
|
|
#include "util/Vector.h"
|
|
#include "util/Transform.h"
|
|
#include "util/Material.h"
|
|
#include "util/refptr.h"
|
|
#include <vector>
|
|
#include <utility>
|
|
|
|
class Shape
|
|
{
|
|
public:
|
|
class Intersection
|
|
{
|
|
public:
|
|
Intersection() {};
|
|
Intersection(refptr<Shape> shape,
|
|
const Vector & position,
|
|
const Vector & normal)
|
|
{
|
|
this->shape = shape;
|
|
this->position = position;
|
|
this->normal = normal;
|
|
}
|
|
refptr<Shape> shape;
|
|
Vector position;
|
|
Vector normal;
|
|
};
|
|
class BoolIntersection
|
|
{
|
|
public:
|
|
BoolIntersection() {};
|
|
BoolIntersection(const Intersection & intersection, bool left)
|
|
{
|
|
this->intersection = intersection;
|
|
this->left = left;
|
|
}
|
|
Intersection intersection;
|
|
bool left;
|
|
};
|
|
class IntersectionList
|
|
{
|
|
public:
|
|
void add(const Intersection & i)
|
|
{
|
|
m_intersections.push_back(i);
|
|
}
|
|
Intersection & operator[](int i)
|
|
{
|
|
return m_intersections[i];
|
|
}
|
|
const Intersection & operator[](int i) const
|
|
{
|
|
return m_intersections[i];
|
|
}
|
|
size_t size() const { return m_intersections.size(); }
|
|
std::vector<Intersection>::iterator begin()
|
|
{
|
|
return m_intersections.begin();
|
|
}
|
|
std::vector<Intersection>::iterator end()
|
|
{
|
|
return m_intersections.end();
|
|
}
|
|
protected:
|
|
std::vector< Intersection > m_intersections;
|
|
};
|
|
class BoolIntersectionList
|
|
{
|
|
public:
|
|
BoolIntersectionList(const IntersectionList & l1,
|
|
const IntersectionList & l2,
|
|
const Vector & startPoint);
|
|
BoolIntersection & operator[](int i)
|
|
{
|
|
return m_intersections[i];
|
|
}
|
|
const BoolIntersection & operator[](int i) const
|
|
{
|
|
return m_intersections[i];
|
|
}
|
|
size_t size() const { return m_intersections.size(); }
|
|
std::vector<BoolIntersection>::iterator begin()
|
|
{
|
|
return m_intersections.begin();
|
|
}
|
|
std::vector<BoolIntersection>::iterator end()
|
|
{
|
|
return m_intersections.end();
|
|
}
|
|
|
|
protected:
|
|
std::vector< BoolIntersection > m_intersections;
|
|
};
|
|
|
|
Shape();
|
|
virtual ~Shape();
|
|
virtual IntersectionList intersect(refptr<Shape> _this,
|
|
const Ray & ray) = 0;
|
|
virtual refptr<Shape> clone() = 0;
|
|
|
|
void setTransform(Transform & t)
|
|
{
|
|
m_transform = t;
|
|
m_inverse = t.getInverse();
|
|
}
|
|
Transform & getTransform() { return m_transform; }
|
|
|
|
virtual void setMaterial(refptr<Material> material);
|
|
refptr<Material> getMaterial() const { return m_material; }
|
|
|
|
protected:
|
|
Transform m_transform;
|
|
Transform m_inverse;
|
|
refptr<Material> m_material;
|
|
};
|
|
|
|
|
|
#endif
|
|
|