From 3035d4c9e76d6f28579d0b5a024e1c1b2a538919 Mon Sep 17 00:00:00 2001 From: Matthias Schiffer Date: Wed, 9 Dec 2009 16:25:16 +0100 Subject: BSPTrees angefangen --- BSPTree.h | 58 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) (limited to 'BSPTree.h') diff --git a/BSPTree.h b/BSPTree.h index 345f143..dc7e2df 100644 --- a/BSPTree.h +++ b/BSPTree.h @@ -3,10 +3,68 @@ #include "Triangle.h" #include +#include class BSPTree { private: + class Plane { + public: + Plane() : d(0) {} + Plane(const Vector &n, float d0) : normal(n), d(d0) {} + bool contains(Vertex v) { + return (fabsf(normal.dot(Vector(v)) - d) < 1E-6); + } + + bool isBehind(Vertex v) { + return (normal.dot(Vector(v)) - d) < 0; + } + + const Vector& getNormal() { + return normal; + } + + private: + Vector normal; + float d; + }; + + public: + BSPTree(const std::list &triangles); + + template + void visit(T& visitor, const Vector &v) { + if(plane.getNormal().dot(v) > 0) { + if(frontTree) + frontTree->visit(visitor, v); + + for(std::list::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::iterator t = triangles.begin(); t != triangles.end(); ++t) { + visitor(*t); + } + + if(frontTree) + frontTree->visit(visitor, v); + } + } + + private: + Plane plane; + std::list triangles; + BSPTree *frontTree, *backTree; + + static Vertex findCenter(const std::list &triangles); + static const Triangle* findNearestTriangle(const std::list &triangles, const Vertex &v); }; #endif /* _BSPTREE_H_ */ -- cgit v1.2.3