1 | #include <cstdlib> |
1 | #include <cstdlib> |
2 | |
2 | |
3 | #include <vector> |
3 | #include <vector> |
4 | |
|
|
5 | using namespace std; |
4 | using namespace std; |
6 | |
5 | |
7 | #define GL_GLEXT_PROTOTYPES |
6 | #include "opengl.h" |
8 | #include <GL/gl.h> |
|
|
9 | #include <GL/glext.h> |
|
|
10 | |
7 | |
11 | #include "oct.h" |
8 | #include "oct.h" |
12 | #include "view.h" |
9 | #include "view.h" |
13 | #include "entity.h" |
10 | #include "entity.h" |
14 | |
11 | |
15 | vector<GLuint> occ_query_objects; |
12 | enum visibility_state { FULL, PARTIAL, SMALL, OCCLUDED }; |
16 | |
13 | |
17 | static GLuint begin_occ_query () |
14 | struct evis { |
18 | { |
15 | visibility_state state; |
19 | GLuint id; |
16 | double last; // time of last check |
|
|
17 | evis () : last(0.), state(FULL) { }; |
|
|
18 | }; |
20 | |
19 | |
21 | if (occ_query_objects.size ()) |
20 | struct oct_visibility : visibility_base |
|
|
21 | { |
|
|
22 | typedef map<entity *, evis> evismap; |
|
|
23 | evismap vismap; |
|
|
24 | |
|
|
25 | visibility_state state; |
|
|
26 | |
|
|
27 | oct_visibility (octant &oct) |
|
|
28 | : state(FULL) |
22 | { |
29 | { |
23 | id = *(occ_query_objects.end () - 1); |
|
|
24 | occ_query_objects.pop_back (); |
|
|
25 | } |
30 | } |
26 | else |
31 | }; |
27 | glGenQueriesARB (1, &id); |
|
|
28 | |
|
|
29 | glBeginQueryARB (GL_SAMPLES_PASSED, id); |
|
|
30 | return id; |
|
|
31 | } |
|
|
32 | |
|
|
33 | #define end_occ_query() glEndQueryARB (GL_SAMPLES_PASSED) |
|
|
34 | |
|
|
35 | GLuint occ_query_result (GLuint id) |
|
|
36 | { |
|
|
37 | GLuint count; |
|
|
38 | |
|
|
39 | glGetQueryObjectuivARB (id, GL_QUERY_RESULT, &count); |
|
|
40 | occ_query_objects.push_back (id); |
|
|
41 | |
|
|
42 | return count; |
|
|
43 | } |
|
|
44 | |
32 | |
45 | octant world(0, sector (SOFFS_MIN, SOFFS_MIN, SOFFS_MIN), MAXEXTENT); |
33 | octant world(0, sector (SOFFS_MIN, SOFFS_MIN, SOFFS_MIN), MAXEXTENT); |
46 | |
34 | |
47 | octant::octant (octant *parent, const sector &orig, uoffs extent) |
35 | octant::octant (octant *parent, const sector &orig, uoffs extent) |
48 | : parent(parent), orig(orig), extent(extent) |
36 | : parent(parent) |
|
|
37 | , orig(orig) |
|
|
38 | , extent(extent) |
49 | { |
39 | { |
50 | for (fill = 8; fill--; ) |
40 | for (fill = 8; fill--; ) |
51 | sub[fill] = 0; |
41 | sub[fill] = 0; |
52 | } |
42 | } |
53 | |
43 | |
|
|
44 | visibility_base *octant::new_visibility () |
|
|
45 | { |
|
|
46 | return new oct_visibility (*this); |
|
|
47 | } |
|
|
48 | |
|
|
49 | void octant::clear_visibility (visibility_base *vs) |
|
|
50 | { |
|
|
51 | ((oct_visibility *)vs)->vismap.clear (); |
|
|
52 | } |
|
|
53 | |
54 | octant::~octant () |
54 | octant::~octant () |
55 | { |
55 | { |
56 | for (fill = 8; fill--; ) |
56 | for (fill = 8; fill--; ) |
57 | delete sub[fill]; |
57 | delete sub[fill]; |
58 | } |
58 | } |
59 | |
59 | |
60 | static bool overlap (const sector &o1, uoffs ea, const box &bbox) |
60 | static bool overlap (const sector &o1, uoffs ea, const sector &a, const sector &b) |
61 | { |
61 | { |
62 | sector a2, b2; |
|
|
63 | |
|
|
64 | ea /= 2; |
62 | ea /= 2; |
65 | |
63 | |
66 | a2.x = o1.x + ea; |
64 | sector center_1 = o1 + ea; |
67 | a2.y = o1.y + ea; |
65 | sector size_2 = b - a; |
68 | a2.z = o1.z + ea; |
66 | sector center_2 = a + (size_2 >> 1); |
69 | |
|
|
70 | b2.x = (bbox.a.x + bbox.b.x) / 2; |
|
|
71 | b2.y = (bbox.a.y + bbox.b.y) / 2; |
|
|
72 | b2.z = (bbox.a.z + bbox.b.z) / 2; |
|
|
73 | |
67 | |
74 | return abs (a2.x - b2.x) <= ea + (bbox.b.x - bbox.a.x) |
68 | return abs (center_1 - center_2) <= ea + size_2; |
75 | && abs (a2.y - b2.y) <= ea + (bbox.b.y - bbox.a.y) |
|
|
76 | && abs (a2.z - b2.z) <= ea + (bbox.b.z - bbox.a.z); |
|
|
77 | } |
69 | } |
78 | |
70 | |
79 | void octant::add (entity_base *e) |
71 | void octant::add (entity *e) |
80 | { |
72 | { |
81 | box bbox = translate (e->bbox, e->orig, sector (0, 0, 0)); |
73 | const sector &a = e->a; |
|
|
74 | const sector &b = e->b; |
82 | |
75 | |
83 | uoffs size = max (abs (bbox.b.x - bbox.a.x), |
|
|
84 | max (abs (bbox.b.y - bbox.a.y), |
|
|
85 | abs (bbox.b.z - bbox.a.z))); |
|
|
86 | |
|
|
87 | if (overlap (orig, extent, bbox)) |
76 | if (overlap (orig, extent, a, b)) |
88 | { |
77 | { |
89 | uoffs extent2 = extent / 2; |
78 | uoffs extent2 = extent >> 1; |
|
|
79 | uoffs size = max (abs (b - a)); |
90 | |
80 | |
91 | if (size > extent2 || !extent2) |
81 | if (size >= extent2 >> 1) |
92 | { |
82 | { |
93 | push_back (e); |
83 | push_back (e); |
94 | e->o.push_back (this); |
84 | e->o.push_back (this); |
95 | return; |
85 | return; |
96 | } |
86 | } |
97 | |
87 | |
98 | for (int i = 8; i--; ) |
88 | for (int i = 8; i--; ) |
99 | { |
89 | { |
100 | sector s = orig; |
90 | sector s = orig; |
101 | s.offset (i, extent2); |
91 | s.offset (i, extent2); |
|
|
92 | |
102 | if (overlap (s, extent2, bbox)) |
93 | if (overlap (s, extent2, a, b)) |
103 | { |
94 | { |
104 | if (!sub[i]) |
95 | if (!sub[i]) |
|
|
96 | { |
105 | sub[i] = new octant (this, s, extent2); |
97 | sub[i] = new octant (this, s, extent2); |
|
|
98 | fill++; |
|
|
99 | } |
106 | |
100 | |
107 | sub[i]->add (e); |
101 | sub[i]->add (e); |
108 | } |
102 | } |
109 | } |
103 | } |
110 | } |
104 | } |
111 | } |
105 | } |
112 | |
106 | |
113 | void octant::remove (entity_base *e) |
107 | void octant::remove (entity *e) |
114 | { |
108 | { |
115 | } |
109 | } |
116 | |
110 | |
117 | void octant::detect_visibility (view &ctx) |
111 | bool octant::detect_visibility (view &ctx) |
118 | { |
112 | { |
119 | visibility_state &vs = ctx.vismap[this]; |
113 | GLfloat extent2 = 0.5F * (GLfloat)extent; |
|
|
114 | sector centeri = orig + (extent >> 1) - ctx.orig; |
|
|
115 | point centerf = point (centeri) + ((extent & 1) ? 0.5F : 0.F); |
120 | |
116 | |
121 | if (vs.generation != ctx.generation) |
117 | GLfloat rad = ctx.diagfact * extent2; |
122 | vs.visibility = visibility_state::UNKNOWN; |
|
|
123 | |
118 | |
124 | const sector &cam = ctx.orig; |
119 | if (!overlap (ctx.frustum.c, sphere (centerf, rad))) |
125 | if (cam.x >= orig.x && cam.x <= orig.x + extent |
120 | return false; |
126 | && cam.y >= orig.y && cam.y <= orig.y + extent |
121 | |
127 | && cam.z >= orig.z && cam.z <= orig.z + extent) |
122 | oct_visibility &vs = *(oct_visibility *)get_visibility (ctx); |
128 | { |
123 | |
129 | vs.visibility = visibility_state::PARTIAL; |
124 | if (orig <= ctx.orig && ctx.orig <= orig + extent) |
130 | vs.generation = ctx.generation; |
125 | vs.state = PARTIAL; |
|
|
126 | else |
131 | } |
127 | { |
132 | else |
128 | if (distance (ctx.frustum.t, centerf) < -rad) return false; |
|
|
129 | if (distance (ctx.frustum.b, centerf) < -rad) return false; |
|
|
130 | if (distance (ctx.frustum.l, centerf) < -rad) return false; |
|
|
131 | if (distance (ctx.frustum.r, centerf) < -rad) return false; |
|
|
132 | if (distance (ctx.frustum.n, centerf) < -rad) return false; |
|
|
133 | |
|
|
134 | #if 0 |
|
|
135 | GLfloat fd = distance (ctx.frustum.f, centerf); |
|
|
136 | |
|
|
137 | if (fd < -(ctx.c_far - ctx.z_far) -rad * 3.F) |
|
|
138 | return false; |
|
|
139 | #endif |
133 | { |
140 | } |
134 | point center ( |
|
|
135 | orig.x + (soffs)extent / 2 - cam.x, |
|
|
136 | orig.y + (soffs)extent / 2 - cam.y, |
|
|
137 | orig.z + (soffs)extent / 2 - cam.z |
|
|
138 | ); |
|
|
139 | |
141 | |
140 | GLfloat dia = (0.5 * sqrtf (3))*(GLfloat)extent; |
142 | #if 0 |
141 | |
143 | if (vs.state == OCCLUDED && size ()) |
142 | if (ctx.frustum.t.distance (center) < -dia) return; |
144 | { |
143 | if (ctx.frustum.b.distance (center) < -dia) return; |
|
|
144 | if (ctx.frustum.l.distance (center) < -dia) return; |
|
|
145 | if (ctx.frustum.r.distance (center) < -dia) return; |
|
|
146 | if (ctx.frustum.n.distance (center) < -dia) return; |
|
|
147 | |
|
|
148 | GLfloat fd = ctx.frustum.f.distance (center); |
|
|
149 | |
|
|
150 | if (fd < -dia) |
|
|
151 | { |
|
|
152 | if (fd < -dia * 2) |
|
|
153 | return; |
|
|
154 | |
|
|
155 | // cull, but do check for potential visibility |
|
|
156 | if (size ()) |
145 | if (size ()) |
157 | ctx.farlist.push_back (this); |
|
|
158 | } |
|
|
159 | } |
|
|
160 | |
|
|
161 | if (size ()) |
|
|
162 | ctx.vislist.push_back (this); |
146 | ctx.vislist.push_back (this); |
|
|
147 | return false; |
|
|
148 | } |
|
|
149 | #endif |
|
|
150 | |
|
|
151 | GLfloat z = ctx.z_near + distance (ctx.frustum.n, centerf) + rad; |
|
|
152 | if (ctx.perspfact * extent / z < 1.) // very crude "too small to see" check |
|
|
153 | return false; |
|
|
154 | //printf ("z %f, perspfact %f, z*p %f\n", z, ctx.perspfact, ctx.perspfact / z); |
|
|
155 | |
|
|
156 | #if 0 |
|
|
157 | if (vs.state == PARTIAL || vs.state == FULL) |
|
|
158 | ctx.nc_far = max (ctx.nc_far, z); |
|
|
159 | #endif |
163 | |
160 | |
164 | // node to start with |
161 | // node to start with |
165 | unsigned char si = ctx.d.x < 0 ? 1 : 0 |
162 | unsigned char si = centeri.x > 0 ? 1 : 0 |
166 | | ctx.d.y < 0 ? 2 : 0 |
163 | | centeri.y > 0 ? 2 : 0 |
167 | | ctx.d.z < 0 ? 4 : 0; |
164 | | centeri.z > 0 ? 4 : 0; |
168 | |
165 | |
169 | // bit-toggle to find next child for front-to-back order |
166 | // bit-toggle to find next child for front-to-back order |
170 | static unsigned char next[8] |
167 | static unsigned char toggle[8+1] |
171 | = { 0, 0^1, 1^2, 2^4, 4^3, 3^5, 5^6, 6^7 }; |
168 | = { 0, 0^1, 1^2, 2^4, 4^3, 3^5, 5^6, 6^7, 0 }; |
172 | |
169 | |
173 | for (int i = 0; i < 8; i++) |
170 | bool visible = vs.state == PARTIAL || vs.state == FULL; |
|
|
171 | |
|
|
172 | unsigned char *next = toggle; |
|
|
173 | do |
174 | { |
174 | { |
175 | si ^= next[i]; |
175 | si ^= *next; |
176 | |
176 | |
177 | if (sub[si]) |
177 | if (sub[si]) |
178 | sub[si]->detect_visibility (ctx); |
178 | visible = visible | sub[si]->detect_visibility (ctx); |
|
|
179 | } |
|
|
180 | while (*++next); |
|
|
181 | |
|
|
182 | if (visible) |
179 | } |
183 | { |
|
|
184 | if (size ()) |
|
|
185 | ctx.vislist.push_back (this); |
|
|
186 | } |
|
|
187 | else |
|
|
188 | { |
|
|
189 | vs.state = OCCLUDED; |
|
|
190 | ctx.vislist.push_back (this); |
|
|
191 | } |
180 | |
192 | |
181 | vs.generation = ctx.generation; |
193 | return visible; |
182 | } |
194 | } |
183 | |
195 | |
184 | void octant::display (view &ctx) |
196 | void octant::display (view &ctx) |
185 | { |
197 | { |
186 | #if 0 |
198 | oct_visibility &vs = *(oct_visibility *)get_visibility (ctx); |
187 | glBegin (GL_LINES); |
199 | |
|
|
200 | if (vs.state == OCCLUDED) |
|
|
201 | { |
|
|
202 | if (ctx.pass_type == view::POSTDEPTH) |
|
|
203 | { |
|
|
204 | ctx.begin_occ_query (*this, 0); |
188 | sector s = orig - ctx.orig; |
205 | sector s = orig - ctx.orig; |
189 | vec3 clr(0, 0.8, 0); |
206 | gl::draw_bbox (s, s + extent); |
190 | glMaterialfv (GL_FRONT_AND_BACK, GL_DIFFUSE, (const GLfloat*)&clr); |
207 | ctx.end_occ_query (); |
|
|
208 | } |
|
|
209 | } |
|
|
210 | else |
|
|
211 | { |
|
|
212 | int nvis = 0; |
191 | |
213 | |
192 | for (int i = 8; i--; ) |
214 | for (iterator i = begin (); i != end (); ) |
193 | for (int ji = 3; ji--; ) |
|
|
194 | { |
215 | { |
195 | int j = i | (1 << ji); |
216 | entity *e = *i++; |
196 | if (i != j) |
217 | |
|
|
218 | evis &evs = vs.vismap[e]; |
|
|
219 | |
|
|
220 | if (ctx.pass_type == view::POSTDEPTH) |
197 | { |
221 | { |
198 | glVertex3i (s.x + !!(i & 1) * extent, |
222 | if (evs.state == OCCLUDED) |
199 | s.y + !!(i & 2) * extent, |
223 | { |
200 | s.z + !!(i & 4) * extent); |
224 | ctx.begin_occ_query (*this, e); |
201 | glVertex3i (s.x + !!(j & 1) * extent, |
225 | gl::draw_bbox (e->a - ctx.orig, e->b - ctx.orig); |
202 | s.y + !!(j & 2) * extent, |
226 | ctx.end_occ_query (); |
203 | s.z + !!(j & 4) * extent); |
227 | } |
|
|
228 | else |
|
|
229 | nvis++; |
204 | } |
230 | } |
|
|
231 | else |
|
|
232 | { |
|
|
233 | if (!ctx.may_draw (e)) |
|
|
234 | continue; |
|
|
235 | |
|
|
236 | |
|
|
237 | if (evs.state != OCCLUDED) |
|
|
238 | { |
|
|
239 | sector center = ((e->a + e->b) >> 1) - ctx.orig; |
|
|
240 | GLfloat z = length (vec3 (center)); |
|
|
241 | ctx.pixfact = ctx.perspfact / z; |
|
|
242 | |
|
|
243 | ctx.nz_far = max (ctx.nz_far, z + extent); |
|
|
244 | ctx.nz_near = min (ctx.nz_near, z - extent); |
|
|
245 | |
|
|
246 | if (ctx.pass_type == view::DEPTH || evs.last + 0.3 > timer.now) |
|
|
247 | e->draw (ctx); |
|
|
248 | else |
|
|
249 | { |
|
|
250 | evs.last = timer.now; |
|
|
251 | ctx.begin_occ_query (*this, e); |
|
|
252 | e->draw (ctx); |
|
|
253 | ctx.end_occ_query (); |
|
|
254 | } |
|
|
255 | } |
|
|
256 | } |
205 | } |
257 | } |
206 | |
|
|
207 | glEnd (); |
|
|
208 | glDisable(GL_COLOR_MATERIAL); |
|
|
209 | #endif |
|
|
210 | |
258 | |
211 | for (iterator i = end (); i != begin (); ) |
259 | #if 1 |
212 | (*--i)->display (ctx); |
260 | if (ctx.pass_type == view::POSTDEPTH && nvis == 0 && size ()) |
213 | } |
261 | vs.state = OCCLUDED; |
214 | |
262 | #endif |
215 | void |
|
|
216 | octant::draw_bbox (view &ctx) |
|
|
217 | { |
|
|
218 | sector s = orig - ctx.orig; |
|
|
219 | int i; |
|
|
220 | GLint verts[4 * 6] = { |
|
|
221 | 0, 2, 3, 1, // -z |
|
|
222 | 4, 5, 7, 6, // +z |
|
|
223 | 0, 1, 5, 4, // -y |
|
|
224 | 7, 3, 2, 6, // +y |
|
|
225 | 0, 4, 6, 2, // -x |
|
|
226 | 1, 3, 7, 5, // +x |
|
|
227 | }; |
|
|
228 | |
|
|
229 | GLfloat cube[8][3] = |
|
|
230 | { |
|
|
231 | { s.x , s.y , s.z }, |
|
|
232 | { s.x + (soffs)extent, s.y , s.z }, |
|
|
233 | { s.x , s.y + (soffs)extent, s.z }, |
|
|
234 | { s.x + (soffs)extent, s.y + (soffs)extent, s.z }, |
|
|
235 | { s.x , s.y , s.z + (soffs)extent }, |
|
|
236 | { s.x + (soffs)extent, s.y , s.z + (soffs)extent }, |
|
|
237 | { s.x , s.y + (soffs)extent, s.z + (soffs)extent }, |
|
|
238 | { s.x + (soffs)extent, s.y + (soffs)extent, s.z + (soffs)extent }, |
|
|
239 | }; |
263 | } |
|
|
264 | } |
240 | |
265 | |
241 | glBegin (GL_QUADS); |
266 | void octant::event (occ_query &ev) |
242 | for (i = 0; i < 4 * 6; i++) { |
267 | { |
243 | glVertex3fv (cube [verts [i]]); |
268 | oct_visibility &vs = *(oct_visibility *)get_visibility (ev.ctx); |
|
|
269 | entity *e = (entity *)ev.id; |
|
|
270 | |
|
|
271 | if (e) |
|
|
272 | { |
|
|
273 | evis &evs = vs.vismap[e]; |
|
|
274 | evs.state = ev.count ? FULL : OCCLUDED; |
244 | } |
275 | } |
245 | glEnd (); |
276 | else |
|
|
277 | vs.state = ev.count ? FULL : OCCLUDED; |
246 | } |
278 | } |
247 | |
279 | |
248 | |
280 | |