diff options
author | Matthias Schiffer <matthias@gamezock.de> | 2009-12-09 16:25:16 +0100 |
---|---|---|
committer | Matthias Schiffer <matthias@gamezock.de> | 2009-12-09 16:25:16 +0100 |
commit | 3035d4c9e76d6f28579d0b5a024e1c1b2a538919 (patch) | |
tree | 497d32485f6510e39d82a2227fb1aaf3129f0206 /BSPTree.cpp | |
parent | 482852aceacb54879c08e6fffc909a2cc160d483 (diff) | |
download | c3d-3035d4c9e76d6f28579d0b5a024e1c1b2a538919.tar c3d-3035d4c9e76d6f28579d0b5a024e1c1b2a538919.zip |
BSPTrees angefangen
Diffstat (limited to 'BSPTree.cpp')
-rw-r--r-- | BSPTree.cpp | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/BSPTree.cpp b/BSPTree.cpp new file mode 100644 index 0000000..b30c907 --- /dev/null +++ b/BSPTree.cpp @@ -0,0 +1,25 @@ +#include "BSPTree.h" +#include <iostream> + +BSPTree::BSPTree(const std::list<Triangle> &t) { + Vertex center = findCenter(t); + std::cout << "Center at (" << center.getX() << ", " << center.getY() << ", " << center.getZ() << std::endl; + + +} + + +Vertex BSPTree::findCenter(const std::list<Triangle> &triangles) { + Vector v; + + for(std::list<Triangle>::const_iterator t = triangles.begin(); t != triangles.end(); ++t) { + v += Vector(t->getCenter()); + } + + return v/triangles.size(); +} + +const Triangle* BSPTree::findNearestTriangle(const std::list<Triangle> &triangles, const Vertex &v) { + Triangle *current = 0; + float distance; +} |