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