4 #define MAXRECURSIVEPORTALPLANES 1024
5 #define MAXRECURSIVEPORTALS 256
7 static tinyplane_t portalplanes[MAXRECURSIVEPORTALPLANES];
8 static int portalplanestack[MAXRECURSIVEPORTALS];
9 static int portalplanecount;
10 static int ranoutofportalplanes;
11 static int ranoutofportals;
12 static float portaltemppoints[2][256][3];
13 static float portaltemppoints2[256][3];
14 static int portal_markid = 0;
15 //float viewportalpoints[16*3];
16 static float boxpoints[4*3];
18 int R_ClipPolygonToPlane(float *in, float *out, int inpoints, int maxoutpoints, tinyplane_t *p)
20 int i, outpoints, prevside, side;
21 float *prevpoint, prevdist, dist, dot;
25 // begin with the last point, then enter the loop with the first point as current
26 prevpoint = in + 3 * (inpoints - 1);
27 prevdist = DotProduct(prevpoint, p->normal) - p->dist;
28 prevside = prevdist >= 0 ? SIDE_FRONT : SIDE_BACK;
32 for (;i < inpoints;i++)
40 dist = DotProduct(in, p->normal) - p->dist;
41 side = dist >= 0 ? SIDE_FRONT : SIDE_BACK;
43 if (prevside == SIDE_FRONT)
45 if (outpoints >= maxoutpoints)
47 VectorCopy(prevpoint, out);
50 if (side == SIDE_FRONT)
53 else if (side == SIDE_BACK)
56 // generate a split point
57 if (outpoints >= maxoutpoints)
59 dot = prevdist / (prevdist - dist);
60 out[0] = prevpoint[0] + dot * (in[0] - prevpoint[0]);
61 out[1] = prevpoint[1] + dot * (in[1] - prevpoint[1]);
62 out[2] = prevpoint[2] + dot * (in[2] - prevpoint[2]);
71 void R_TriangleToPlane(vec3_t point1, vec3_t point2, vec3_t point3, tinyplane_t *p)
74 VectorSubtract(point1, point2, v1);
75 VectorSubtract(point3, point2, v2);
76 CrossProduct(v1, v2, p->normal);
77 // VectorNormalize(p->normal);
78 VectorNormalizeFast(p->normal);
79 p->dist = DotProduct(point1, p->normal);
83 int R_PortalThroughPortalPlanes(tinyplane_t *clipplanes, int clipnumplanes, float *targpoints, int targnumpoints, float *out, int maxpoints)
86 if (targnumpoints < 3)
90 numpoints = targnumpoints;
91 memcpy(&portaltemppoints[0][0][0], targpoints, numpoints * 3 * sizeof(float));
92 for (i = 0;i < clipnumplanes;i++)
94 numpoints = R_ClipPolygonToPlane(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints, 256, clipplanes + i);
97 memcpy(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints * 3 * sizeof(float));
99 if (numpoints > maxpoints)
101 memcpy(out, &portaltemppoints[1][0][0], numpoints * 3 * sizeof(float));
105 int Portal_RecursiveFlowSearch (mleaf_t *leaf, vec3_t eye, int firstclipplane, int numclipplanes)
108 int newpoints, i, prev;
109 vec3_t center, v1, v2;
110 tinyplane_t *newplanes;
112 if (leaf->portalmarkid == portal_markid)
115 // follow portals into other leafs
116 for (p = leaf->portals;p;p = p->next)
118 // only flow through portals facing away from the viewer
119 if (PlaneDiff(eye, (&p->plane)) < 0)
121 newpoints = R_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, (float *) p->points, p->numpoints, &portaltemppoints2[0][0], 256);
124 else if (firstclipplane + numclipplanes + newpoints > MAXRECURSIVEPORTALPLANES)
125 ranoutofportalplanes = true;
128 // find the center by averaging
130 for (i = 0;i < newpoints;i++)
131 VectorAdd(center, portaltemppoints2[i], center);
132 // ixtable is a 1.0f / N table
133 VectorScale(center, ixtable[newpoints], center);
134 // calculate the planes, and make sure the polygon can see it's own center
135 newplanes = &portalplanes[firstclipplane + numclipplanes];
136 for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
138 // R_TriangleToPlane(eye, portaltemppoints2[i], portaltemppoints2[prev], newplanes + i);
139 VectorSubtract(eye, portaltemppoints2[i], v1);
140 VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v2);
141 CrossProduct(v1, v2, newplanes[i].normal);
142 VectorNormalizeFast(newplanes[i].normal);
143 newplanes[i].dist = DotProduct(eye, newplanes[i].normal);
144 if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
146 // polygon can't see it's own center, discard and use parent portal
152 if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane + numclipplanes, newpoints))
157 if (Portal_RecursiveFlowSearch(p->past, eye, firstclipplane, numclipplanes))
167 void Portal_PolygonRecursiveMarkLeafs(mnode_t *node, float *polypoints, int numpoints)
173 if (node->contents < 0)
175 ((mleaf_t *)node)->portalmarkid = portal_markid;
180 for (i = 0, p = polypoints;i < numpoints;i++, p += 3)
182 if (DotProduct(p, node->plane->normal) > node->plane->dist)
187 if (front == numpoints)
189 node = node->children[0];
193 Portal_PolygonRecursiveMarkLeafs(node->children[0], polypoints, numpoints);
195 node = node->children[1];
199 int Portal_CheckPolygon(model_t *model, vec3_t eye, float *polypoints, int numpoints)
201 int i, prev, returnvalue;
203 vec3_t center, v1, v2;
207 Portal_PolygonRecursiveMarkLeafs(model->nodes, polypoints, numpoints);
209 eyeleaf = Mod_PointInLeaf(eye, model);
211 // find the center by averaging
213 for (i = 0;i < numpoints;i++)
214 VectorAdd(center, (&polypoints[i * 3]), center);
215 // ixtable is a 1.0f / N table
216 VectorScale(center, ixtable[numpoints], center);
218 // calculate the planes, and make sure the polygon can see it's own center
219 for (prev = numpoints - 1, i = 0;i < numpoints;prev = i, i++)
221 // R_TriangleToPlane(eye, portaltemppoints2[i], portaltemppoints2[prev], newplanes + i);
222 VectorSubtract(eye, (&polypoints[i * 3]), v1);
223 VectorSubtract((&polypoints[prev * 3]), (&polypoints[i * 3]), v2);
224 CrossProduct(v1, v2, portalplanes[i].normal);
225 VectorNormalizeFast(portalplanes[i].normal);
226 portalplanes[i].dist = DotProduct(eye, portalplanes[i].normal);
227 if (DotProduct(portalplanes[i].normal, center) <= portalplanes[i].dist)
229 // polygon can't see it's own center, discard
234 portalplanecount = 0;
235 ranoutofportalplanes = false;
236 ranoutofportals = false;
238 returnvalue = Portal_RecursiveFlowSearch(eyeleaf, eye, 0, numpoints);
240 if (ranoutofportalplanes)
241 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d plane stack when recursing through portals\n", MAXRECURSIVEPORTALPLANES);
243 Con_Printf("Portal_RecursiveFlowSearch: ran out of %d portal stack when recursing through portals\n", MAXRECURSIVEPORTALS);
248 #define Portal_MinsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
250 if (eye[(axis)] < ((axisvalue) - 0.5f))\
252 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
253 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
254 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
255 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
256 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
261 #define Portal_MaxsBoxPolygon(axis, axisvalue, x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) \
263 if (eye[(axis)] > ((axisvalue) + 0.5f))\
265 boxpoints[ 0] = x1;boxpoints[ 1] = y1;boxpoints[ 2] = z1;\
266 boxpoints[ 3] = x2;boxpoints[ 4] = y2;boxpoints[ 5] = z2;\
267 boxpoints[ 6] = x3;boxpoints[ 7] = y3;boxpoints[ 8] = z3;\
268 boxpoints[ 9] = x4;boxpoints[10] = y4;boxpoints[11] = z4;\
269 if (Portal_CheckPolygon(model, eye, boxpoints, 4))\
274 int Portal_CheckBox(model_t *model, vec3_t eye, vec3_t a, vec3_t b)
276 if (eye[0] >= (a[0] - 1.0f) && eye[0] < (b[0] + 1.0f)
277 && eye[1] >= (a[1] - 1.0f) && eye[1] < (b[1] + 1.0f)
278 && eye[2] >= (a[2] - 1.0f) && eye[2] < (b[2] + 1.0f))
281 Portal_MinsBoxPolygon
289 Portal_MaxsBoxPolygon
297 Portal_MinsBoxPolygon
305 Portal_MaxsBoxPolygon
313 Portal_MinsBoxPolygon
321 Portal_MaxsBoxPolygon