BSPTree.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
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;
}