WebSVN – gelsvn – Diff – /trunk/src/Geometry/BSPTree.h


#ifndef __BSPTREE_H__
#define __BSPTREE_H__
 
#include <vector>
 
#include "CGLA/Mat4x4f.h"
#include "Geometry/TriMesh.h"
 
#include "BBox.h"
 
namespace Geometry 
{
  struct BSPNode;
 
  // Initialization structure
  struct BSPNode 
  {
    unsigned char axis_leaf; // 00 = axis 0, 01 = axis 1, 10 = axis 2, 11 = leaf
    double plane;
    BSPNode *left, *right;
    int id;
    int count;
    unsigned int ref;
  };
 
  // Faster structure
  struct BSPLeaf {
    // bits 0..30 : offset to first son
    // bit 31 (sign) flag whether node is a leaf
    unsigned int flagAndOffset;
    unsigned int count;
  };
 
  struct BSPInner {
    unsigned int flagAndOffset;
    // bits 0..1 : splitting dimension
    // bits 2..30: offset bits
    // bit 31 (sign) flag whether node is a leaf
    float splitCoordinate;
  };
 
  union FastBSPNode
  {
    BSPLeaf leaf;
    BSPInner inner;
  };
 
  class BSPTree 
  {
    bool b_is_build;
   public:
    static int node_calls;
    static int tri_calls;
    BSPNode* root;
    BBox bbox;
    std::vector<Geometry::TriMesh*> trimesh;
    std::vector<CGLA::Mat4x4f> transforms;
    
    std::vector<ISectTri> isecttris;
    std::vector<TriAccel> triaccel;
    std::vector<ISectTri*> all_objects;
    std::vector<TriAccel*> all_triaccel;
    std::vector<FastBSPNode> fast_tree;
    
    unsigned int max_objects;
    unsigned int max_level;
	
    BSPTree();
    ~BSPTree();
 
    void delete_node(BSPNode *node);
//	bool intersect2(BRender::Ray &ray, const TriAccel &acc, double t_max) const;
    void subdivide_node(BSPNode &node, BBox &bbox, 
			unsigned int level, 
			std::vector<ISectTri*>& objects, 
			std::vector<TriAccel*>& tri_objects);
    void init();
    void clear();
 
    void init(std::vector<Geometry::TriMesh*>& trimesh, 
	      int max_objects, int max_level);
    void init(std::vector<Geometry::TriMesh*>& _trimesh, 
	      std::vector<CGLA::Mat4x4f>& _transforms, 
	      int _max_objects, int _max_level);
    void init(Geometry::TriMesh* mesh, CGLA::Mat4x4f transform, 
	      std::vector<int> &trilist, 
	      int _max_objects, int _max_level);
 
    void build();
    bool is_build();
 
    bool intersect_node(Ray &ray, const BSPNode &node, 
			double t_min, double t_max) const;
    bool intersect(Ray &ray) const;
    void print(BSPNode *node, int depth);
    int size(BSPNode *node);
    int size();
 
    void BSPTree::make_fast_tree(BSPNode *node);
    void BSPTree::push_fast_bsp_node(BSPNode *node, int id);
    void BSPTree::intersect_fast_node(Ray &ray, 
				      const FastBSPNode *node, 
				      double t_min, double t_max) const;
    bool intersect(Ray &ray, const ISectTri &isecttri, double t_max) const;
  };
}
#endif
 
 

Rev 290	Rev 299
1	`#ifndef __BSPTREE_H__`	1	`#ifndef __BSPTREE_H__`
2	`#define __BSPTREE_H__`	2	`#define __BSPTREE_H__`
3		3
4	`#include <vector>`	4	`#include <vector>`
5		5
6	`#include "CGLA/Mat4x4f.h"`	6	`#include "CGLA/Mat4x4f.h"`
7	`#include "Geometry/TriMesh.h"`	7	`#include "Geometry/TriMesh.h"`
8		8
9	`#include "BBox.h"`	9	`#include "BBox.h"`
10		10
11	`namespace Geometry`	11	`namespace Geometry`
12	`{`	12	`{`
13	`struct BSPNode;`	13	`struct BSPNode;`
14		14
15	`// Initialization structure`	15	`// Initialization structure`
16	`struct BSPNode`	16	`struct BSPNode`
17	`{`	17	`{`
18	`unsigned char axis_leaf; // 00 = axis 0, 01 = axis 1, 10 = axis 2, 11 = leaf`	18	`unsigned char axis_leaf; // 00 = axis 0, 01 = axis 1, 10 = axis 2, 11 = leaf`
19	`double plane;`	19	`double plane;`
20	`BSPNode left, right;`	20	`BSPNode left, right;`
21	`int id;`	21	`int id;`
22	`int count;`	22	`int count;`
23	`unsigned int ref;`	23	`unsigned int ref;`
24	`};`	24	`};`
25		25
26	`// Faster structure`	26	`// Faster structure`
27	`struct BSPLeaf {`	27	`struct BSPLeaf {`
28	`// bits 0..30 : offset to first son`	28	`// bits 0..30 : offset to first son`
29	`// bit 31 (sign) flag whether node is a leaf`	29	`// bit 31 (sign) flag whether node is a leaf`
30	`unsigned int flagAndOffset;`	30	`unsigned int flagAndOffset;`
31	`unsigned int count;`	31	`unsigned int count;`
32	`};`	32	`};`
33		33
34	`struct BSPInner {`	34	`struct BSPInner {`
35	`unsigned int flagAndOffset;`	35	`unsigned int flagAndOffset;`
36	`// bits 0..1 : splitting dimension`	36	`// bits 0..1 : splitting dimension`
37	`// bits 2..30: offset bits`	37	`// bits 2..30: offset bits`
38	`// bit 31 (sign) flag whether node is a leaf`	38	`// bit 31 (sign) flag whether node is a leaf`
39	`float splitCoordinate;`	39	`float splitCoordinate;`
40	`};`	40	`};`
41		41
42	`union FastBSPNode`	42	`union FastBSPNode`
43	`{`	43	`{`
44	`BSPLeaf leaf;`	44	`BSPLeaf leaf;`
45	`BSPInner inner;`	45	`BSPInner inner;`
46	`};`	46	`};`
47		47
48	`class BSPTree`	48	`class BSPTree`
49	`{`	49	`{`
50	`bool b_is_build;`	50	`bool b_is_build;`
51	`public:`	51	`public:`
52	`static int node_calls;`	52	`static int node_calls;`
53	`static int tri_calls;`	53	`static int tri_calls;`
54	`BSPNode* root;`	54	`BSPNode* root;`
55	`BBox bbox;`	55	`BBox bbox;`
56	`std::vector<Geometry::TriMesh*> trimesh;`	56	`std::vector<Geometry::TriMesh*> trimesh;`
57	`std::vector<CGLA::Mat4x4f> transforms;`	57	`std::vector<CGLA::Mat4x4f> transforms;`
58		58
59	`std::vector<ISectTri> isecttris;`	59	`std::vector<ISectTri> isecttris;`
60	`std::vector<TriAccel> triaccel;`	60	`std::vector<TriAccel> triaccel;`
61	`std::vector<ISectTri*> all_objects;`	61	`std::vector<ISectTri*> all_objects;`
62	`std::vector<TriAccel*> all_triaccel;`	62	`std::vector<TriAccel*> all_triaccel;`
63	`std::vector<FastBSPNode> fast_tree;`	63	`std::vector<FastBSPNode> fast_tree;`
64		64
65	`unsigned int max_objects;`	65	`unsigned int max_objects;`
66	`unsigned int max_level;`	66	`unsigned int max_level;`
67		67
68	`BSPTree();`	68	`BSPTree();`
69	`~BSPTree();`	69	`~BSPTree();`
70		70
71	`void delete_node(BSPNode *node);`	71	`void delete_node(BSPNode *node);`
72	`// bool intersect2(BRender::Ray &ray, const TriAccel &acc, double t_max) const;`	72	`// bool intersect2(BRender::Ray &ray, const TriAccel &acc, double t_max) const;`
73	`void subdivide_node(BSPNode &node, BBox &bbox,`	73	`void subdivide_node(BSPNode &node, BBox &bbox,`
74	`unsigned int level,`	74	`unsigned int level,`
75	`std::vector<ISectTri*>& objects,`	75	`std::vector<ISectTri*>& objects,`
76	`std::vector<TriAccel*>& tri_objects);`	76	`std::vector<TriAccel*>& tri_objects);`
77	`void init();`	77	`void init();`
78	`void clear();`	78	`void clear();`
79		79
80	`void init(std::vector<Geometry::TriMesh*>& trimesh,`	80	`void init(std::vector<Geometry::TriMesh*>& trimesh,`
81	`int max_objects, int max_level);`	81	`int max_objects, int max_level);`
82	`void init(std::vector<Geometry::TriMesh*>& _trimesh,`	82	`void init(std::vector<Geometry::TriMesh*>& _trimesh,`
83	`std::vector<CGLA::Mat4x4f>& _transforms,`	83	`std::vector<CGLA::Mat4x4f>& _transforms,`
84	`int _max_objects, int _max_level);`	84	`int _max_objects, int _max_level);`
85	`void init(Geometry::TriMesh* mesh, CGLA::Mat4x4f transform,`	85	`void init(Geometry::TriMesh* mesh, CGLA::Mat4x4f transform,`
86	`std::vector<int> &trilist,`	86	`std::vector<int> &trilist,`
87	`int _max_objects, int _max_level);`	87	`int _max_objects, int _max_level);`
88		88
89	`void build();`	89	`void build();`
90	`bool is_build();`	90	`bool is_build();`
91		91
92	`bool intersect_node(Ray &ray, const BSPNode &node,`	92	`bool intersect_node(Ray &ray, const BSPNode &node,`
93	`double t_min, double t_max) const;`	93	`double t_min, double t_max) const;`
94	`bool intersect(Ray &ray) const;`	94	`bool intersect(Ray &ray) const;`
95	`void print(BSPNode *node, int depth);`	95	`void print(BSPNode *node, int depth);`
96	`int size(BSPNode *node);`	96	`int size(BSPNode *node);`
97	`int size();`	97	`int size();`
98		98
99	`void BSPTree::make_fast_tree(BSPNode *node);`	99	`void BSPTree::make_fast_tree(BSPNode *node);`
100	`void BSPTree::push_fast_bsp_node(BSPNode *node, int id);`	100	`void BSPTree::push_fast_bsp_node(BSPNode *node, int id);`
101	`void BSPTree::intersect_fast_node(Ray &ray,`	101	`void BSPTree::intersect_fast_node(Ray &ray,`
102	`const FastBSPNode *node,`	102	`const FastBSPNode *node,`
103	`double t_min, double t_max) const;`	103	`double t_min, double t_max) const;`
104	`bool intersect(Ray &ray, const ISectTri &isecttri, double t_max) const;`	104	`bool intersect(Ray &ray, const ISectTri &isecttri, double t_max) const;`
105	`};`	105	`};`
106	`}`	106	`}`
107	`#endif`	107	`#endif`
108		108
109		109

Subversion Repositories gelsvn

(root)/trunk/src/Geometry/BSPTree.h – Rev 290 → 299