#include "quakedef.h"
+#include "polygon.h"
#define MAXRECURSIVEPORTALPLANES 1024
#define MAXRECURSIVEPORTALS 256
static int portal_markid = 0;
static float boxpoints[4*3];
-int Portal_ClipPolygonToPlane(float *in, float *out, int inpoints, int maxoutpoints, tinyplane_t *p)
-{
- int i, outpoints, prevside, side;
- float *prevpoint, prevdist, dist, dot;
-
- if (inpoints < 3)
- return inpoints;
- // begin with the last point, then enter the loop with the first point as current
- prevpoint = in + 3 * (inpoints - 1);
- prevdist = DotProduct(prevpoint, p->normal) - p->dist;
- prevside = prevdist >= 0 ? SIDE_FRONT : SIDE_BACK;
- i = 0;
- outpoints = 0;
- goto begin;
- for (;i < inpoints;i++)
- {
- prevpoint = in;
- prevdist = dist;
- prevside = side;
- in += 3;
-
-begin:
- dist = DotProduct(in, p->normal) - p->dist;
- side = dist >= 0 ? SIDE_FRONT : SIDE_BACK;
-
- if (prevside == SIDE_FRONT)
- {
- if (outpoints >= maxoutpoints)
- return -1;
- VectorCopy(prevpoint, out);
- out += 3;
- outpoints++;
- if (side == SIDE_FRONT)
- continue;
- }
- else if (side == SIDE_BACK)
- continue;
-
- // generate a split point
- if (outpoints >= maxoutpoints)
- return -1;
- dot = prevdist / (prevdist - dist);
- out[0] = prevpoint[0] + dot * (in[0] - prevpoint[0]);
- out[1] = prevpoint[1] + dot * (in[1] - prevpoint[1]);
- out[2] = prevpoint[2] + dot * (in[2] - prevpoint[2]);
- out += 3;
- outpoints++;
- }
-
- return outpoints;
-}
-
-
-int Portal_PortalThroughPortalPlanes(tinyplane_t *clipplanes, int clipnumplanes, float *targpoints, int targnumpoints, float *out, int maxpoints)
+static int Portal_PortalThroughPortalPlanes(tinyplane_t *clipplanes, int clipnumplanes, float *targpoints, int targnumpoints, float *out, int maxpoints)
{
int numpoints, i;
if (targnumpoints < 3)
memcpy(&portaltemppoints[0][0][0], targpoints, numpoints * 3 * sizeof(float));
for (i = 0;i < clipnumplanes;i++)
{
- numpoints = Portal_ClipPolygonToPlane(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints, 256, clipplanes + i);
+ 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);
if (numpoints < 3)
return numpoints;
memcpy(&portaltemppoints[0][0][0], &portaltemppoints[1][0][0], numpoints * 3 * sizeof(float));
return numpoints;
}
-int Portal_RecursiveFlowSearch (mleaf_t *leaf, vec3_t eye, int firstclipplane, int numclipplanes)
+static int Portal_RecursiveFlowSearch (mleaf_t *leaf, vec3_t eye, int firstclipplane, int numclipplanes)
{
mportal_t *p;
int newpoints, i, prev;
VectorSubtract(eye, portaltemppoints2[i], v1);
VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v2);
CrossProduct(v1, v2, newplanes[i].normal);
- VectorNormalizeFast(newplanes[i].normal);
+ VectorNormalize(newplanes[i].normal);
newplanes[i].dist = DotProduct(eye, newplanes[i].normal);
if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
{
return false;
}
-void Portal_PolygonRecursiveMarkLeafs(mnode_t *node, float *polypoints, int numpoints)
+static void Portal_PolygonRecursiveMarkLeafs(mnode_t *node, float *polypoints, int numpoints)
{
int i, front;
float *p;
VectorSubtract(eye, (&polypoints[i * 3]), v1);
VectorSubtract((&polypoints[prev * 3]), (&polypoints[i * 3]), v2);
CrossProduct(v1, v2, portalplanes[i].normal);
- VectorNormalizeFast(portalplanes[i].normal);
+ VectorNormalize(portalplanes[i].normal);
portalplanes[i].dist = DotProduct(eye, portalplanes[i].normal);
if (DotProduct(portalplanes[i].normal, center) <= portalplanes[i].dist)
{
return false;
}
-vec3_t trianglepoints[3];
-
typedef struct portalrecursioninfo_s
{
int exact;
}
portalrecursioninfo_t;
-void Portal_RecursiveFlow_ExactLeafFaces(portalrecursioninfo_t *info, int *mark, int numleafsurfaces, int firstclipplane, int numclipplanes)
-{
- int i, j, *elements;
- float *v[3], *vertex3f;
- vec3_t trimins, trimaxs;
- msurface_t *surface;
- for (i = 0;i < numleafsurfaces;i++, mark++)
- {
- if (!CHECKPVSBIT(info->surfacepvs, *mark))
- {
- surface = info->model->brush.data_surfaces + *mark;
- if (BoxesOverlap(surface->mins, surface->maxs, info->boxmins, info->boxmaxs))
- {
- vertex3f = surface->groupmesh->data_vertex3f;
- elements = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle);
- for (j = 0;j < surface->num_triangles;j++, elements += 3)
- {
- v[0] = vertex3f + elements[0] * 3;
- v[1] = vertex3f + elements[1] * 3;
- v[2] = vertex3f + elements[2] * 3;
- if (PointInfrontOfTriangle(info->eye, v[0], v[1], v[2]))
- {
- trimins[0] = min(v[0][0], min(v[1][0], v[2][0]));
- trimaxs[0] = max(v[0][0], max(v[1][0], v[2][0]));
- trimins[1] = min(v[0][1], min(v[1][1], v[2][1]));
- trimaxs[1] = max(v[0][1], max(v[1][1], v[2][1]));
- trimins[2] = min(v[0][2], min(v[1][2], v[2][2]));
- trimaxs[2] = max(v[0][2], max(v[1][2], v[2][2]));
- if (BoxesOverlap(trimins, trimaxs, info->boxmins, info->boxmaxs) && Portal_PortalThroughPortalPlanes(&portalplanes[firstclipplane], numclipplanes, v[0], 3, &portaltemppoints2[0][0], 256) >= 3)
- {
- SETPVSBIT(info->surfacepvs, *mark);
- info->surfacelist[info->numsurfaces++] = *mark;
- break;
- }
- }
- }
- }
- }
- }
-}
-
-void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, int firstclipplane, int numclipplanes)
+static void Portal_RecursiveFlow (portalrecursioninfo_t *info, mleaf_t *leaf, int firstclipplane, int numclipplanes)
{
mportal_t *p;
int newpoints, i, prev;
float dist;
- vec3_t center, v1, v2;
+ vec3_t center;
tinyplane_t *newplanes;
for (i = 0;i < 3;i++)
int surfaceindex = leaf->firstleafsurface[i];
if (!CHECKPVSBIT(info->surfacepvs, surfaceindex))
{
- msurface_t *surface = info->model->brush.data_surfaces + surfaceindex;
+ msurface_t *surface = info->model->data_surfaces + surfaceindex;
if (BoxesOverlap(surface->mins, surface->maxs, info->boxmins, info->boxmaxs))
{
if (info->exact)
VectorAdd(center, portaltemppoints2[i], center);
// ixtable is a 1.0f / N table
VectorScale(center, ixtable[newpoints], center);
- // calculate the planes, and make sure the polygon can see it's own center
+ // calculate the planes, and make sure the polygon can see its own center
newplanes = &portalplanes[firstclipplane + numclipplanes];
for (prev = newpoints - 1, i = 0;i < newpoints;prev = i, i++)
{
- VectorSubtract(portaltemppoints2[prev], portaltemppoints2[i], v1);
- VectorSubtract(info->eye, portaltemppoints2[i], v2);
- CrossProduct(v1, v2, newplanes[i].normal);
- VectorNormalizeFast(newplanes[i].normal);
+ TriangleNormal(portaltemppoints2[prev], portaltemppoints2[i], info->eye, newplanes[i].normal);
+ VectorNormalize(newplanes[i].normal);
newplanes[i].dist = DotProduct(info->eye, newplanes[i].normal);
if (DotProduct(newplanes[i].normal, center) <= newplanes[i].dist)
{
- // polygon can't see it's own center, discard and use parent portal
+ // polygon can't see its own center, discard and use parent portal
break;
}
}
}
}
-void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t *node)
+static void Portal_RecursiveFindLeafForFlow(portalrecursioninfo_t *info, mnode_t *node)
{
if (node->plane)
{
else
{
mleaf_t *leaf = (mleaf_t *)node;
- if (leaf->portals)
+ if (leaf->clusterindex >= 0)
Portal_RecursiveFlow(info, leaf, 0, info->numfrustumplanes);
}
}
Mod_CheckLoaded(model);
- if (!model->brush.num_portals)
+ if (!model->brush.data_nodes)
{
Con_Print("Portal_Visibility: not a brush model\n");
return;