Biomechanical Joint Model  Author: Anderson Maciel

---

ray.h

Go to the documentation of this file.

#ifndef RAY_H
#define RAY_H

using namespace LinAlg;
#include <LinAlg/vecarray.h>

#include <vector>
   using namespace std;

   //typedef VVV vector<int>;

   struct Ray {
      VEC O;        // ray origin
      VEC D;        // ray direction
      VEC P;        // intersection point
      REAL t;       // distance from O to P w.r.t. D's norm
      bool segment; // sometimes we're just interested in the intersection 
                    // with a segment (of length D's norm)
      Ray() : O(3), D(3), P(3), t(0), segment(false) {};
      Ray(const VEC &origin, const VEC &dir) : O(origin), D(dir), P(3), t(0), segment(false) {};
      Ray(const Ray &r) : O(r.O), D(r.D), P(r.P), t(r.t), segment(r.segment) {};
   };

   //class BBox;
   //class BBoxHierarchy;

   bool intersect_triangle ( const VEC &orig, const VEC &dir,
                             const VEC &v0, const VEC &v1, const VEC &v2,
                             REAL &t, REAL &u, REAL &v );

   vector<int> find_closest(const VEC &X, const VECArray &Y, int m, REAL radius=infinity);

   int project_on_mesh_tmp(const VEC &X, const VECArray &vertlist, 
                       const VECArray &normlist, const vector<int> &trilist, 
                       REAL &u, REAL &v, VEC &P);

   int project_on_mesh(const VEC &X, const  VECArray &vertlist, const vector<int> &trilist,
                       REAL &u, REAL &v, VEC &P);




#endif

---