4 #define MAXRECURSIVEPORTALPLANES 1024
5 #define MAXRECURSIVEPORTALS 256
7 static tinyplane_t portalplanes[MAXRECURSIVEPORTALPLANES];
8 static int ranoutofportalplanes;
9 static int ranoutofportals;
10 static float portaltemppoints[2][256][3];
11 static float portaltemppoints2[256][3];
12 static int portal_markid = 0;
13 static float boxpoints[4*3];
15 int Portal_PortalThroughPortalPlanes(tinyplane_t *clipplanes, int clipnumplanes, float *targpoints, int targnumpoints, float *out, int maxpoints)
18 if (targnumpoints < 3)
22 numpoints = targnumpoints;
23 memcpy(&portaltemppoints[0][0][0], targpoints, numpoints * 3 * sizeof(float));
24 for (i = 0;i < clipnumplanes;i++)
26 PolygonF_Divide(numpoints, &portaltemppoints[0][0][0], clipplanes[i].normal[0], clipplanes[i].normal[1], clipplanes[i].normal[2], clipplanes[i].dist, 1.0f/32.0f, 256, &portaltemppoints[1][0][0], &numpoints, 0, NULL, NULL);
29 memcpy(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints * 3 * sizeof(float));
31 if (numpoints > maxpoints)
33 memcpy(out, &portaltemppoints[0][0][0], numpoints * 3 * sizeof(float));
37 int Portal_RecursiveFlowSearch (mleaf_t *leaf, vec3_t eye, int firstclipplane, int numclipplanes)
40 int newpoints, i, prev;
41 vec3_t center, v1, v2;
42 tinyplane_t *newplanes;
44 if (leaf->portalmarkid == portal_markid)
47 // follow portals into other leafs
48 for (p = leaf->portals;p;p = p->next)
50 // only flow through portals facing away from the viewer
51 if (PlaneDiff(eye, (&p->plane)) < 0)
53 newpoints = Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, (float *) p->points, p->numpoints, &portaltemppoints2[0][0], 256);
56 else if (firstclipplane + numclipplanes + newpoints > MAXRECURSIVEPORTALPLANES)
57 ranoutofportalplanes = true;
60 // find the center by averaging
62 for (i = 0;i < newpoints;i++)
63 VectorAdd(center, portaltemppoints2[i], center);
64 // ixtable is a 1.0f / N table
65 VectorScale(center, ixtable[newpoints], center);
66 // calculate the planes, and make sure the polygon can see it's own center
67 newplanes = &portalplanes[firstclipplane + numclipplanes];
68 for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
70 VectorSubtract(eye, portaltemppoints2[i], v1);
71 VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v2);
72 CrossProduct(v1, v2, newplanes[i].normal);
73 VectorNormalizeFast(newplanes[i].normal);
74 newplanes[i].dist = DotProduct(eye, newplanes[i].normal);
75 if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
77 // polygon can't see it's own center, discard and use parent portal
83 if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane + numclipplanes, newpoints))
88 if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane, numclipplanes))
98 void Portal_PolygonRecursiveMarkLeafs(mnode_t *node, float *polypoints, int numpoints)
106 ((mleaf_t *)node)->portalmarkid = portal_markid;
111 for (i = 0, p = polypoints;i < numpoints;i++, p += 3)
113 if (DotProduct(p, node->plane->normal) > node->plane->dist)
118 if (front == numpoints)
120 node = node->children[0];
124 Portal_PolygonRecursiveMarkLeafs(node->children[0], polypoints, numpoints);
126 node = node->children[1];
130 int Portal_CheckPolygon(model_t *model, vec3_t eye, float *polypoints, int numpoints)
132 int i, prev, returnvalue;
134 vec3_t center, v1, v2;
136 // if there is no model, it can not block visibility
137 if (model == NULL || !model->brush.PointInLeaf)
142 Mod_CheckLoaded(model);
143 Portal_PolygonRecursiveMarkLeafs(model->brush.data_nodes, polypoints, numpoints);
145 eyeleaf = model->brush.PointInLeaf(model, eye);
147 // find the center by averaging
149 for (i = 0;i < numpoints;i++)
150 VectorAdd(center, (&polypoints[i * 3]), center);
151 // ixtable is a 1.0f / N table
152 VectorScale(center, ixtable[numpoints], center);
154 // calculate the planes, and make sure the polygon can see it's own center
155 for (prev = numpoints - 1, i = 0;i < numpoints;prev = i, i++)
157 VectorSubtract(eye, (&polypoints[i * 3]), v1);
158 VectorSubtract((&polypoints[prev * 3]), (&polypoints[i * 3]), v2);
159 CrossProduct(v1, v2, portalplanes[i].normal);
160 VectorNormalizeFast(portalplanes[i].normal);
161 portalplanes[i].dist = DotProduct(eye, portalplanes[i].normal);
162 if (DotProduct(portalplanes[i].normal, center) <= portalplanes[i].dist)
164 // polygon can't see it's own center, discard
169 ranoutofportalplanes = false;
170 ranoutofportals = false;
172 returnvalue = Portal_RecursiveFlowSearch(eyeleaf, eye, 0, numpoints);
174 if (ranoutofportalplanes)
175 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
177 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
182 #define Portal_MinsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
184 if (eye[(axis)] < ((axisvalue) - 0.5f))\
186 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
187 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
188 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
189 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
190 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
195 #define Portal_MaxsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
197 if (eye[(axis)] > ((axisvalue) + 0.5f))\
199 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
200 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
201 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
202 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
203 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
208 int Portal_CheckBox(model_t *model, vec3_t eye, vec3_t a, vec3_t b)
210 if (eye[0] >= (a[0] - 1.0f) && eye[0] < (b[0] + 1.0f)
211 && eye[1] >= (a[1] - 1.0f) && eye[1] < (b[1] + 1.0f)
212 && eye[2] >= (a[2] - 1.0f) && eye[2] < (b[2] + 1.0f))
215 Portal_MinsBoxPolygon
223 Portal_MaxsBoxPolygon
231 Portal_MinsBoxPolygon
239 Portal_MaxsBoxPolygon
247 Portal_MinsBoxPolygon
255 Portal_MaxsBoxPolygon
267 vec3_t trianglepoints[3];
269 typedef struct portalrecursioninfo_s
272 int numfrustumplanes;
283 float *updateleafsmins;
284 float *updateleafsmaxs;
286 portalrecursioninfo_t;
288 void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, int firstclipplane, int numclipplanes)
291 int newpoints, i, prev;
293 vec3_t center, v1, v2;
294 tinyplane_t *newplanes;
296 for (i = 0;i < 3;i++)
298 if (info->updateleafsmins && info->updateleafsmins[i] > leaf->mins[i]) info->updateleafsmins[i] = leaf->mins[i];
299 if (info->updateleafsmaxs && info->updateleafsmaxs[i] < leaf->maxs[i]) info->updateleafsmaxs[i] = leaf->maxs[i];
305 int leafindex = leaf - info->model->brush.data_leafs;
306 if (!CHECKPVSBIT(info->leafpvs, leafindex))
308 SETPVSBIT(info->leafpvs, leafindex);
309 info->leaflist[info->numleafs++] = leafindex;
313 // mark surfaces in leaf that can be seen through portal
314 if (leaf->numleafsurfaces && info->surfacepvs)
316 for (i = 0;i < leaf->numleafsurfaces;i++)
318 int surfaceindex = leaf->firstleafsurface[i];
319 if (!CHECKPVSBIT(info->surfacepvs, surfaceindex))
321 msurface_t *surface = info->model->brush.data_surfaces + surfaceindex;
322 if (BoxesOverlap(surface->mins, surface->maxs, info->boxmins, info->boxmaxs))
328 const float *vertex3f;
329 float v[9], trimins[3], trimaxs[3];
330 vertex3f = surface->groupmesh->data_vertex3f;
331 elements = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle);
332 for (j = 0;j < surface->num_triangles;j++, elements += 3)
334 VectorCopy(vertex3f + elements[0] * 3, v + 0);
335 VectorCopy(vertex3f + elements[1] * 3, v + 3);
336 VectorCopy(vertex3f + elements[2] * 3, v + 6);
337 if (PointInfrontOfTriangle(info->eye, v + 0, v + 3, v + 6))
339 trimins[0] = min(v[0], min(v[3], v[6]));
340 trimaxs[0] = max(v[0], max(v[3], v[6]));
341 trimins[1] = min(v[1], min(v[4], v[7]));
342 trimaxs[1] = max(v[1], max(v[4], v[7]));
343 trimins[2] = min(v[2], min(v[5], v[8]));
344 trimaxs[2] = max(v[2], max(v[5], v[8]));
345 if (BoxesOverlap(trimins, trimaxs, info->boxmins, info->boxmaxs) && Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, v, 3, &portaltemppoints2[0][0], 256) >= 3)
347 SETPVSBIT(info->surfacepvs, surfaceindex);
348 info->surfacelist[info->numsurfaces++] = surfaceindex;
356 SETPVSBIT(info->surfacepvs, surfaceindex);
357 info->surfacelist[info->numsurfaces++] = surfaceindex;
364 // follow portals into other leafs
365 for (p = leaf->portals;p;p = p->next)
367 // only flow through portals facing the viewer
368 dist = PlaneDiff(info->eye, (&p->plane));
369 if (dist < 0 && BoxesOverlap(p->past->mins, p->past->maxs, info->boxmins, info->boxmaxs))
371 newpoints = Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, (float *) p->points, p->numpoints, &portaltemppoints2[0][0], 256);
374 else if (firstclipplane + numclipplanes + newpoints > MAXRECURSIVEPORTALPLANES)
375 ranoutofportalplanes = true;
378 // find the center by averaging
380 for (i = 0;i < newpoints;i++)
381 VectorAdd(center, portaltemppoints2[i], center);
382 // ixtable is a 1.0f / N table
383 VectorScale(center, ixtable[newpoints], center);
384 // calculate the planes, and make sure the polygon can see it's own center
385 newplanes = &portalplanes[firstclipplane + numclipplanes];
386 for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
388 VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v1);
389 VectorSubtract(info->eye, portaltemppoints2[i], v2);
390 CrossProduct(v1, v2, newplanes[i].normal);
391 VectorNormalizeFast(newplanes[i].normal);
392 newplanes[i].dist = DotProduct(info->eye, newplanes[i].normal);
393 if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
395 // polygon can't see it's own center, discard and use parent portal
400 Portal_RecursiveFlow(info, p->past, firstclipplane + numclipplanes, newpoints);
402 Portal_RecursiveFlow(info, p->past, firstclipplane, numclipplanes);
408 void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t *node)
412 float f = DotProduct(info->eye, node->plane->normal) - node->plane->dist;
414 Portal_RecursiveFindLeafForFlow(info, node->children[0]);
416 Portal_RecursiveFindLeafForFlow(info, node->children[1]);
420 mleaf_t *leaf = (mleaf_t *)node;
422 Portal_RecursiveFlow(info, leaf, 0, info->numfrustumplanes);
426 void Portal_Visibility(model_t *model, const vec3_t eye, int *leaflist, qbyte *leafpvs, int *numleafspointer, int *surfacelist, qbyte *surfacepvs, int *numsurfacespointer, const mplane_t *frustumplanes, int numfrustumplanes, int exact, const float *boxmins, const float *boxmaxs, float *updateleafsmins, float *updateleafsmaxs)
429 portalrecursioninfo_t info;
431 // if there is no model, it can not block visibility
434 Con_Print("Portal_Visibility: NULL model\n");
438 Mod_CheckLoaded(model);
440 if (!model->brush.num_portals)
442 Con_Print("Portal_Visibility: not a brush model\n");
446 // put frustum planes (if any) into tinyplane format at start of buffer
447 for (i = 0;i < numfrustumplanes;i++)
449 VectorCopy(frustumplanes[i].normal, portalplanes[i].normal);
450 portalplanes[i].dist = frustumplanes[i].dist;
453 ranoutofportalplanes = false;
454 ranoutofportals = false;
456 VectorCopy(boxmins, info.boxmins);
457 VectorCopy(boxmaxs, info.boxmaxs);
459 info.numsurfaces = 0;
460 info.surfacelist = surfacelist;
461 info.surfacepvs = surfacepvs;
463 info.leaflist = leaflist;
464 info.leafpvs = leafpvs;
466 VectorCopy(eye, info.eye);
467 info.numfrustumplanes = numfrustumplanes;
468 info.updateleafsmins = updateleafsmins;
469 info.updateleafsmaxs = updateleafsmaxs;
471 Portal_RecursiveFindLeafForFlow(&info, model->brush.data_nodes);
473 if (ranoutofportalplanes)
474 Con_Printf("Portal_RecursiveFlow: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
476 Con_Printf("Portal_RecursiveFlow: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
477 if (numsurfacespointer)
478 *numsurfacespointer = info.numsurfaces;
480 *numleafspointer = info.numleafs;