BSPTree.h


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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70

#ifndef _BSPTREE_H_
#define _BSPTREE_H_

#include "Triangle.h"
#include <list>
#include <cmath>

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<Triangle> &triangles);

    template<typename T>
    void visit(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);
      }
    }

  private:
    Plane plane;
    std::list<Triangle> triangles;
    BSPTree *frontTree, *backTree;

    static Vertex findCenter(const std::list<Triangle> &triangles);
    static const Triangle* findNearestTriangle(const std::list<Triangle> &triangles, const Vertex &v);
};

#endif /* _BSPTREE_H_ */