BSPTrees weiter aufbauen

1 files changed, 71 insertions, 4 deletions

diff --git a/BSPTree.h b/BSPTree.h
index dc7e2df..78ec81f 100644
--- a/BSPTree.h
+++ b/BSPTree.h
@@ -11,15 +11,49 @@ class BSPTree {
       public:
         Plane() : d(0) {}
         Plane(const Vector &n, float d0) : normal(n), d(d0) {}
+        Plane(const Triangle &t) : normal(t.getNormal()), d(t.getVertex(0).dot(normal)) {}
 
-        bool contains(Vertex v) {
-          return (fabsf(normal.dot(Vector(v)) - d) < 1E-6);
+        bool contains(const Vertex &v) {
+          return (fabsf(normal.dot(v) - d) < 1E-6);
         }
 
-        bool isBehind(Vertex v) {
-          return (normal.dot(Vector(v)) - d) < 0;
+        bool isBehind(const Vertex &v) {
+          return (normal.dot(v) - d) < 0;
         }
 
+        bool isInFront(const Vertex &v) {
+          return (normal.dot(v) - d) > 0;
+        }
+
+
+        bool contains(const Triangle &t) {
+          for(int i = 0; i < 3; ++i) {
+            if(!contains(t.getVertex(i)))
+              return false;
+          }
+
+          return true;
+        }
+
+        bool isBehind(const Triangle &t) {
+          for(int i = 0; i < 3; ++i) {
+            if(!isBehind(t.getVertex(i)) && !contains(t.getVertex(i)))
+              return false;
+          }
+
+          return true;
+        }
+
+        bool isInFront(const Triangle &t) {
+          for(int i = 0; i < 3; ++i) {
+            if(!isInFront(t.getVertex(i)) && !contains(t.getVertex(i)))
+              return false;
+          }
+
+          return true;
+        }
+
+
         const Vector& getNormal() {
           return normal;
         }
@@ -31,6 +65,39 @@ class BSPTree {
 
   public:
     BSPTree(const std::list<Triangle> &triangles);
+    virtual ~BSPTree() {
+      if(frontTree)
+        delete frontTree;
+
+      if(backTree)
+        delete backTree;
+    }
+
+    template<typename T>
+    void visit(const T& visitor, const Vector &v) {
+      if(plane.getNormal().dot(v) > 0) {
+        if(frontTree)
+          frontTree->visit(visitor, v);
+
+        for(std::list<Triangle>::iterator t = triangles.begin(); t != triangles.end(); ++t) {
+          visitor(*t);
+        }
+
+        if(backTree)
+          backTree->visit(visitor, v);
+      }
+      else {
+        if(backTree)
+          backTree->visit(visitor, v);
+
+        for(std::list<Triangle>::iterator t = triangles.begin(); t != triangles.end(); ++t) {
+          visitor(*t);
+        }
+
+        if(frontTree)
+          frontTree->visit(visitor, v);
+      }
+    }
 
     template<typename T>
     void visit(T& visitor, const Vector &v) {