1 | #ifndef __KDINTERSECTABLE_H
|
---|
2 | #define __KDINTERSECTABLE_H
|
---|
3 |
|
---|
4 | #include "AxisAlignedBox3.h"
|
---|
5 | #include "Intersectable.h"
|
---|
6 | #include "Triangle3.h"
|
---|
7 |
|
---|
8 |
|
---|
9 | namespace GtpVisibilityPreprocessor {
|
---|
10 |
|
---|
11 |
|
---|
12 | struct VssRayContainer;
|
---|
13 | class KdNode;
|
---|
14 | //class BvhNode;
|
---|
15 | class BvhLeaf;
|
---|
16 | class Ray;
|
---|
17 |
|
---|
18 | struct Face;
|
---|
19 | struct Triangle3;
|
---|
20 |
|
---|
21 | class KdTree;
|
---|
22 |
|
---|
23 |
|
---|
24 | /**
|
---|
25 | Wrapper used for creating a PVS compliant intersectable.
|
---|
26 | */
|
---|
27 | template<typename T>
|
---|
28 | class IntersectableWrapper: public Intersectable
|
---|
29 | {
|
---|
30 | public:
|
---|
31 | IntersectableWrapper(T item);
|
---|
32 |
|
---|
33 | /** Returns node associated with this instance.
|
---|
34 | */
|
---|
35 | T GetItem() const;
|
---|
36 | /** See get.
|
---|
37 | */
|
---|
38 | void SetItem(T item);
|
---|
39 |
|
---|
40 |
|
---|
41 | /////////////////////////////////////////////
|
---|
42 | //-- inherited functions from Intersectable
|
---|
43 |
|
---|
44 | AxisAlignedBox3 GetBox() const;
|
---|
45 |
|
---|
46 | int CastRay(Ray &ray);
|
---|
47 |
|
---|
48 | bool IsConvex() const;
|
---|
49 | bool IsWatertight() const;
|
---|
50 | float IntersectionComplexity();
|
---|
51 |
|
---|
52 | int NumberOfFaces() const;
|
---|
53 |
|
---|
54 | int GetRandomSurfacePoint(GtpVisibilityPreprocessor::Vector3 &point,
|
---|
55 | GtpVisibilityPreprocessor::Vector3 &normal);
|
---|
56 |
|
---|
57 | int GetRandomVisibleSurfacePoint(GtpVisibilityPreprocessor::Vector3 &point,
|
---|
58 | GtpVisibilityPreprocessor::Vector3 &normal,
|
---|
59 | const GtpVisibilityPreprocessor::Vector3 &viewpoint,
|
---|
60 | const int maxTries);
|
---|
61 |
|
---|
62 | ostream &Describe(ostream &s);
|
---|
63 |
|
---|
64 |
|
---|
65 | protected:
|
---|
66 |
|
---|
67 | T mItem;
|
---|
68 | };
|
---|
69 |
|
---|
70 |
|
---|
71 | template<typename T>
|
---|
72 | IntersectableWrapper<T>::IntersectableWrapper(T item):
|
---|
73 | Intersectable(), mItem(item)
|
---|
74 | {
|
---|
75 | }
|
---|
76 |
|
---|
77 | template<typename T>
|
---|
78 | void IntersectableWrapper<T>::SetItem(T item)
|
---|
79 | {
|
---|
80 | mItem = item;
|
---|
81 | }
|
---|
82 |
|
---|
83 | template<typename T>
|
---|
84 | T IntersectableWrapper<T>::GetItem() const
|
---|
85 | {
|
---|
86 | return mItem;
|
---|
87 | }
|
---|
88 |
|
---|
89 | template<typename T>
|
---|
90 | AxisAlignedBox3 IntersectableWrapper<T>::GetBox() const
|
---|
91 | { // TODO matt
|
---|
92 | return AxisAlignedBox3();
|
---|
93 | }
|
---|
94 |
|
---|
95 | template<typename T>
|
---|
96 | int IntersectableWrapper<T>::CastRay(Ray &ray)
|
---|
97 | { // TODO matt
|
---|
98 | return 0;
|
---|
99 | }
|
---|
100 |
|
---|
101 | template<typename T>
|
---|
102 | bool IntersectableWrapper<T>::IsConvex() const
|
---|
103 | {
|
---|
104 | return true;
|
---|
105 | }
|
---|
106 |
|
---|
107 | template<typename T>
|
---|
108 | bool IntersectableWrapper<T>::IsWatertight() const
|
---|
109 | {
|
---|
110 | return true;
|
---|
111 | }
|
---|
112 |
|
---|
113 | template<typename T>
|
---|
114 | float IntersectableWrapper<T>::IntersectionComplexity()
|
---|
115 | {
|
---|
116 | return 1.0f;
|
---|
117 | }
|
---|
118 |
|
---|
119 | template<typename T>
|
---|
120 | int IntersectableWrapper<T>::NumberOfFaces() const
|
---|
121 | {
|
---|
122 | return 0;
|
---|
123 | }
|
---|
124 |
|
---|
125 | template<typename T>
|
---|
126 | int IntersectableWrapper<T>::GetRandomSurfacePoint(Vector3 &point,
|
---|
127 | Vector3 &normal)
|
---|
128 | {
|
---|
129 | return 0;
|
---|
130 | }
|
---|
131 |
|
---|
132 | template<typename T>
|
---|
133 | int IntersectableWrapper<T>::GetRandomVisibleSurfacePoint(Vector3 &point,
|
---|
134 | Vector3 &normal,
|
---|
135 | const Vector3 &viewpoint,
|
---|
136 | const int maxTries)
|
---|
137 | {
|
---|
138 | return 0;
|
---|
139 | }
|
---|
140 |
|
---|
141 | template<typename T>
|
---|
142 | ostream &IntersectableWrapper<T>::Describe(ostream &s)
|
---|
143 | {
|
---|
144 | s << mItem;
|
---|
145 | return s;
|
---|
146 | }
|
---|
147 |
|
---|
148 |
|
---|
149 | class KdIntersectable: public IntersectableWrapper<KdNode *>
|
---|
150 | {
|
---|
151 | public:
|
---|
152 | AxisAlignedBox3 mBox;
|
---|
153 |
|
---|
154 | KdIntersectable(KdNode *item, const AxisAlignedBox3 &box);
|
---|
155 |
|
---|
156 |
|
---|
157 | int Type() const
|
---|
158 | {
|
---|
159 | return Intersectable::KD_INTERSECTABLE;
|
---|
160 | }
|
---|
161 | |
---|
162 |
|
---|
163 | AxisAlignedBox3 GetBox() const {
|
---|
164 | return mBox;
|
---|
165 | } |
---|
166 | }; |
---|
167 |
|
---|
168 |
|
---|
169 | typedef map<KdNode *, KdIntersectable *> KdIntersectableMap;
|
---|
170 |
|
---|
171 | class BvhIntersectable: public IntersectableWrapper<BvhLeaf *>
|
---|
172 | {
|
---|
173 | public:
|
---|
174 | BvhIntersectable(BvhLeaf *item):
|
---|
175 | IntersectableWrapper<BvhLeaf *>(item) {}
|
---|
176 |
|
---|
177 | int Type() const
|
---|
178 | {
|
---|
179 | return Intersectable::BVH_INTERSECTABLE;
|
---|
180 | }
|
---|
181 | |
---|
182 | AxisAlignedBox3 GetBox() const; |
---|
183 | |
---|
184 | };
|
---|
185 |
|
---|
186 |
|
---|
187 | class TriangleIntersectable: public IntersectableWrapper<Triangle3>
|
---|
188 | {
|
---|
189 | public:
|
---|
190 | TriangleIntersectable(Triangle3 item):
|
---|
191 | IntersectableWrapper<Triangle3>(item) {}
|
---|
192 |
|
---|
193 | int CastRay(Ray &ray);
|
---|
194 | AxisAlignedBox3 GetBox() const;
|
---|
195 | int NumberOfFaces() const;
|
---|
196 | Vector3 GetNormal(const int idx) const;
|
---|
197 |
|
---|
198 | float GetArea() const {return mItem.GetArea();}
|
---|
199 | int Type() const
|
---|
200 | {
|
---|
201 | return Intersectable::TRIANGLE_INTERSECTABLE;
|
---|
202 | }
|
---|
203 |
|
---|
204 | int GetRandomSurfacePoint(Vector3 &point, Vector3 &normal);
|
---|
205 |
|
---|
206 | int GetRandomVisibleSurfacePoint(Vector3 &point,
|
---|
207 | Vector3 &normal,
|
---|
208 | const Vector3 &viewpoint,
|
---|
209 | const int maxTries);
|
---|
210 | };
|
---|
211 |
|
---|
212 |
|
---|
213 |
|
---|
214 |
|
---|
215 | }
|
---|
216 |
|
---|
217 | #endif
|
---|