---

CollisionHull.h

/*
  File: CollisionHull.h

  Copyright(C) C. Kotterink, Computed Graphics
*/
#ifndef COLLISIONHULL_H
#define COLLISIONHULL_H

#include<AABoundingBox.h>
#include<Vertex3.h>

#include<vector>

class RenderContext;
class Mesh;
class World;
class PolygonalModel;

class CollisionHull
{
public:
    static const real inf;
    static const real epsilon;

    CollisionHull(float r, float y);

    const AABoundingBox &getBound() const {
        return bound;
    }
    void operator +=(const Vertex3 &v) {
        position += v;
    }
    Vertex3 &getVelocity() {
        return velocity;
    }
    void setVelocity(const Vertex3 &v) {
        velocity = v;
    }
    const Vertex3 &getPosition() const {
        return position;
    }
    void setPosition(const Vertex3 &p) {
        position = p;
    }
    const Vertex3 &getNormVelocity() const {
        return normalizedVelocity;
    }
    real getYScale() const {
        return yScale;
    }
    real getRadius() const {
        return radius;
    }
    real getDistanceToTravel() const {
        return distanceToTravel;
    }
    bool update(World &world);
    bool collide(const AABoundingBox &box) const {
        return bound.intersect(box);
    }

protected:
    void recursiveCollide(World &world);
    void calculateBound();

    AABoundingBox bound;

    Vertex3 position;
    Vertex3 velocity;
    float radius;
    float yScale;

    // Calculation state:
    Vertex3 normalizedVelocity;
    real distanceToTravel;
};

template<typename T>
inline real collide( vector<T> &array, Vertex3 &nearestIntersection)
{
  real nearest = inf;
  vector<T>::iterator i = array.begin();
  for (;i<array.end;++i) {
    Vertex3 intersection;
    real d = collide(*i, intersection);
    if ((d >= 0.0) && (d < nearest)) {
      nearest = d;
      nearestIntersection = intersection;
    }
  }
  return nearest;
}

#endif

---

This documentation was generated using doxygen. If you have any comments or additions please mail me.