// returns true if any of the trm vertices is inside the brush
bool TestTrmVertsInBrush(TraceWork tw, Brush b)
{
if (b.checkcount == this.checkCount)
{
return(false);
}
b.checkcount = this.checkCount;
if ((b.contents & tw.contents) == 0)
{
return(false);
}
// if the brush bounds don't intersect the trace bounds
if (!b.bounds.IntersectsBounds(tw.bounds))
{
return(false);
}
int numVerts = (tw.pointTrace ? 1 : tw.numVerts);
for (int j = 0; j < numVerts; j++)
{
idVec3 p = tw.vertices[j].p;
// see if the point is inside the brush
int bestPlane = 0;
float bestd = float.NegativeInfinity;
for (int i = 0; i < b.numPlanes; i++)
{
float d = b.planes[i].Distance(p);
if (d >= 0.0f)
{
break;
}
if (d > bestd)
{
bestd = d;
bestPlane = i;
}
}
if (i >= b.numPlanes)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_TRMVERTEX;
tw.trace.c.normal = b.planes[bestPlane].Normal();
tw.trace.c.dist = b.planes[bestPlane].Dist();
tw.trace.c.contents = b.contents;
tw.trace.c.material = b.material;
tw.trace.c.point = p;
tw.trace.c.modelFeature = 0;
tw.trace.c.trmFeature = j;
return(true);
}
}
return(false);
}
// returns true if any of the trm vertices is inside the brush
bool TestTrmVertsInBrush(TraceWork tw, Brush b)
{
if (b.checkcount == this.checkCount)
return false;
b.checkcount = this.checkCount;
if ((b.contents & tw.contents) == 0)
return false;
// if the brush bounds don't intersect the trace bounds
if (!b.bounds.IntersectsBounds(tw.bounds))
return false;
int numVerts = (tw.pointTrace ? 1 : tw.numVerts);
for (int j = 0; j < numVerts; j++)
{
idVec3 p = tw.vertices[j].p;
// see if the point is inside the brush
int bestPlane = 0;
float bestd = float.NegativeInfinity;
for (int i = 0; i < b.numPlanes; i++)
{
float d = b.planes[i].Distance(p);
if (d >= 0.0f)
break;
if (d > bestd)
{
bestd = d;
bestPlane = i;
}
}
if (i >= b.numPlanes)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_TRMVERTEX;
tw.trace.c.normal = b.planes[bestPlane].Normal();
tw.trace.c.dist = b.planes[bestPlane].Dist();
tw.trace.c.contents = b.contents;
tw.trace.c.material = b.material;
tw.trace.c.point = p;
tw.trace.c.modelFeature = 0;
tw.trace.c.trmFeature = j;
return true;
}
}
return false;
}
//#define CM_SetTrmEdgeSidedness( edge, bpl, epl, bitNum ) { \
// if ( !(edge->sideSet & (1<<bitNum)) ) { \
// float fl; \
// fl = (bpl).PermutedInnerProduct( epl ); \
// edge->side = (edge->side & ~(1<<bitNum)) | (FLOATSIGNBITSET(fl) << bitNum); \
// edge->sideSet |= (1 << bitNum); \
// } \
//}
//#define CM_SetTrmPolygonSidedness( v, plane, bitNum ) { \
// if ( !((v)->sideSet & (1<<bitNum)) ) { \
// float fl; \
// fl = plane.Distance( (v)->p ); \
// /* cannot use float sign bit because it is undetermined when fl == 0.0f */ \
// if ( fl < 0.0f ) { \
// (v)->side |= (1 << bitNum); \
// } \
// else { \
// (v)->side &= ~(1 << bitNum); \
// } \
// (v)->sideSet |= (1 << bitNum); \
// } \
//}
// returns true if the trm intersects the polygon
bool TestTrmInPolygon(TraceWork tw, Polygon p)
{
// if already checked this polygon
if (p.checkcount == this.checkCount)
return false;
p.checkcount = this.checkCount;
// if this polygon does not have the right contents behind it
if ((p.contents & tw.contents) == 0)
return false;
// if the polygon bounds don't intersect the trace bounds
if (!p.bounds.IntersectsBounds(tw.bounds))
return false;
// bounds should cross polygon plane
switch (tw.bounds.PlaneSide(p.plane))
{
case PLANESIDE_CROSS:
break;
case PLANESIDE_FRONT:
if (tw.model.isConvex)
{
tw.quickExit = true;
return true;
}
default:
return false;
}
// if the trace model is convex
if (tw.isConvex)
{
// test if any polygon vertices are inside the trm
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
// if this edge is already tested
if (edge.checkcount == this.checkCount)
continue;
for (int j = 0; j < 2; j++)
{
Vertex v = tw.model.vertices[edge.vertexNum[j]];
// if this vertex is already tested
if (v.checkcount == this.checkCount)
continue;
int bestPlane = 0;
float bestd = float.NegativeInfinity;
int k = 0;
for (; k < tw.numPolys; k++)
{
float d = tw.polys[k].plane.Distance(v.p);
if (d >= 0.0f)
break;
if (d > bestd)
{
bestd = d;
bestPlane = k;
}
}
if (k >= tw.numPolys)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_MODELVERTEX;
tw.trace.c.normal = -tw.polys[bestPlane].plane.Normal();
tw.trace.c.dist = -tw.polys[bestPlane].plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = v.p;
tw.trace.c.modelFeature = edge.vertexNum[j];
tw.trace.c.trmFeature = 0;
return true;
}
}
}
}
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
// reset sidedness cache if this is the first time we encounter this edge
if (edge.checkcount != this.checkCount)
edge.sideSet = 0;
// pluecker coordinate for edge
tw.polygonEdgePlueckerCache[i].FromLine(tw.model.vertices[edge.vertexNum[0]].p, tw.model.vertices[edge.vertexNum[1]].p);
Vertex v = tw.model.vertices[edge.vertexNum[MathEx.INTSIGNBITSET(edgeNum)]];
// reset sidedness cache if this is the first time we encounter this vertex
if (v.checkcount != this.checkCount)
v.sideSet = 0;
v.checkcount = this.checkCount;
}
// get side of polygon for each trm vertex
int[] sides = new int[CM.MAX_TRACEMODEL_VERTS];
for (int i = 0; i < tw.numVerts; i++)
{
float d = p.plane.Distance(tw.vertices[i].p);
sides[i] = (d < 0.0f ? -1 : 1);
}
// test if any trm edges go through the polygon
for (int i = 1; i <= tw.numEdges; i++)
{
// if the trm edge does not cross the polygon plane
if (sides[tw.edges[i].vertexNum[0]] == sides[tw.edges[i].vertexNum[1]])
continue;
// check from which side to which side the trm edge goes
bool flip = MathEx.INTSIGNBITSET(sides[tw.edges[i].vertexNum[0]]);
// test if trm edge goes through the polygon between the polygon edges
for (int j = 0; j < p.numEdges; j++)
{
int edgeNum = p.edges[j];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
#if true
CM_SetTrmEdgeSidedness(edge, tw.edges[i].pl, tw.polygonEdgePlueckerCache[j], i);
if (MathEx.INTSIGNBITSET(edgeNum) ^ ((edge.side >> i) & 1) ^ flip)
break;
#else
float d = tw.edges[i].pl.PermutedInnerProduct(tw.polygonEdgePlueckerCache[j]);
if (flip)
d = -d;
if (edgeNum > 0) { if (d <= 0.0f) break; }
else { if (d >= 0.0f) break; }
#endif
}
if (j >= p.numEdges)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_EDGE;
tw.trace.c.normal = p.plane.Normal();
tw.trace.c.dist = p.plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = tw.vertices[tw.edges[i].vertexNum[!flip]].p;
tw.trace.c.modelFeature = p;
tw.trace.c.trmFeature = i;
return true;
}
}
// test if any polygon edges go through the trm polygons
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
if (edge.checkcount == this.checkCount)
continue;
edge.checkcount = this.checkCount;
for (int j = 0; j < tw.numPolys; j++)
{
#if true
Vertex v1 = tw.model.vertices + edge.vertexNum[0];
CM_SetTrmPolygonSidedness(v1, tw.polys[j].plane, j);
Vertex v2 = tw.model.vertices + edge.vertexNum[1];
CM_SetTrmPolygonSidedness(v2, tw.polys[j].plane, j);
// if the polygon edge does not cross the trm polygon plane
if ((((v1.side ^ v2.side) >> j) & 1) == 0)
continue;
bool flip = (v1.side >> j) & 1;
#else
Vertex v1 = tw.model.vertices + edge.vertexNum[0];
float d1 = tw.polys[j].plane.Distance(v1.p);
Vertex v2 = tw.model.vertices + edge.vertexNum[1];
float d2 = tw.polys[j].plane.Distance(v2.p);
// if the polygon edge does not cross the trm polygon plane
if ((d1 >= 0.0f && d2 >= 0.0f) || (d1 <= 0.0f && d2 <= 0.0f))
continue;
bool flip = false;
if (d1 < 0.0f)
flip = true;
#endif
// test if polygon edge goes through the trm polygon between the trm polygon edges
int k = 0;
for (; k < tw.polys[j].numEdges; k++)
{
int trmEdgeNum = tw.polys[j].edges[k];
TrmEdge trmEdge = tw.edges[Math.Abs(trmEdgeNum)];
#if true
int bitNum = Math.Abs(trmEdgeNum);
CM_SetTrmEdgeSidedness(edge, trmEdge.pl, tw.polygonEdgePlueckerCache[i], bitNum);
if (MathEx.INTSIGNBITSET(trmEdgeNum) ^ ((edge.side >> bitNum) & 1) ^ flip)
break;
#else
float d = trmEdge.pl.PermutedInnerProduct(tw.polygonEdgePlueckerCache[i]);
if (flip)
d = -d;
if (trmEdgeNum > 0) { if (d <= 0.0f) break; }
else { if (d >= 0.0f) break; }
#endif
}
if (k >= tw.polys[j].numEdges)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_EDGE;
tw.trace.c.normal = -tw.polys[j].plane.Normal();
tw.trace.c.dist = -tw.polys[j].plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = tw.model.vertices[edge.vertexNum[!flip]].p;
tw.trace.c.modelFeature = edgeNum;
tw.trace.c.trmFeature = j;
return true;
}
}
}
return false;
}
int ContentsTrm(Trace results, ref idVec3 start, idTraceModel trm, ref idMat3 trmAxis, int contentMask, CmHandle model, ref idVec3 modelOrigin, ref idMat3 modelAxis)
{
// fast point case
if (!trm || (trm.bounds[1][0] - trm.bounds[0][0] <= 0.0f &&
trm.bounds[1][1] - trm.bounds[0][1] <= 0.0f &&
trm.bounds[1][2] - trm.bounds[0][2] <= 0.0f))
{
results.c.contents = TransformedPointContents(start, model, modelOrigin, modelAxis);
results.fraction = (results.c.contents == 0);
results.endpos = start;
results.endAxis = trmAxis;
return results.c.contents;
}
this.checkCount++;
TraceWork tw = new TraceWork();
tw.trace.fraction = 1.0f;
tw.trace.c.contents = 0;
tw.trace.c.type = ContactType.CONTACT_NONE;
tw.contents = contentMask;
tw.isConvex = true;
tw.rotation = false;
tw.positionTest = true;
tw.pointTrace = false;
tw.quickExit = false;
tw.numContacts = 0;
tw.model = this.models[(int)model];
tw.start = start - modelOrigin;
tw.end = tw.start;
bool model_rotated = modelAxis.IsRotated();
if (model_rotated)
invModelAxis = modelAxis.Transpose();
// setup trm structure
SetupTrm(ref tw, trm);
bool trm_rotated = trmAxis.IsRotated();
// calculate vertex positions
if (trm_rotated)
for (int i = 0; i < tw.numVerts; i++)
// rotate trm around the start position
tw.vertices[i].p *= trmAxis;
for (int i = 0; i < tw.numVerts; i++)
// set trm at start position
tw.vertices[i].p += tw.start;
if (model_rotated)
for (int i = 0; i < tw.numVerts; i++)
// rotate trm around model instead of rotating the model
tw.vertices[i].p *= invModelAxis;
// add offset to start point
if (trm_rotated)
{
idVec3 dir = trm->offset * trmAxis;
tw.start += dir;
tw.end += dir;
}
else
{
tw.start += trm->offset;
tw.end += trm->offset;
}
if (model_rotated)
{
// rotate trace instead of model
tw.start *= invModelAxis;
tw.end *= invModelAxis;
}
// setup trm vertices
tw.size.Clear();
for (int i = 0; i < tw.numVerts; i++)
// get axial trm size after rotations
tw.size.AddPoint(tw.vertices[i].p - tw.start);
// setup trm edges
for (int i = 1; i <= tw.numEdges; i++)
{
// edge start, end and pluecker coordinate
tw.edges[i].start = tw.vertices[tw.edges[i].vertexNum[0]].p;
tw.edges[i].end = tw.vertices[tw.edges[i].vertexNum[1]].p;
tw.edges[i].pl.FromLine(tw.edges[i].start, tw.edges[i].end);
}
// setup trm polygons
if (trm_rotated & model_rotated)
{
idMat3 tmpAxis = trmAxis * invModelAxis;
for (int i = 0; i < tw.numPolys; i++)
tw.polys[i].plane *= tmpAxis;
}
else if (trm_rotated)
{
for (int i = 0; i < tw.numPolys; i++)
tw.polys[i].plane *= trmAxis;
}
else if (model_rotated)
{
for (int i = 0; i < tw.numPolys; i++)
tw.polys[i].plane *= invModelAxis;
}
for (int i = 0; i < tw.numPolys; i++)
tw.polys[i].plane.FitThroughPoint(tw.edges[abs(tw.polys[i].edges[0])].start);
// bounds for full trace, a little bit larger for epsilons
for (int i = 0; i < 3; i++)
{
if (tw.start[i] < tw.end[i])
{
tw.bounds[0][i] = tw.start[i] + tw.size[0][i] - CM_BOX_EPSILON;
tw.bounds[1][i] = tw.end[i] + tw.size[1][i] + CM_BOX_EPSILON;
}
else
{
tw.bounds[0][i] = tw.end[i] + tw.size[0][i] - CM_BOX_EPSILON;
tw.bounds[1][i] = tw.start[i] + tw.size[1][i] + CM_BOX_EPSILON;
}
if (idMath.Fabs(tw.size[0][i]) > idMath.Fabs(tw.size[1][i]))
tw.extents[i] = idMath.Fabs(tw.size[0][i]) + CM_BOX_EPSILON;
else
tw.extents[i] = idMath.Fabs(tw.size[1][i]) + CM_BOX_EPSILON;
}
// trace through the model
TraceThroughModel(ref tw);
results = tw.trace;
results.fraction = (results.c.contents == 0);
results.endpos = start;
results.endAxis = trmAxis;
return results.c.contents;
}
//#define CM_SetTrmEdgeSidedness( edge, bpl, epl, bitNum ) { \
// if ( !(edge->sideSet & (1<<bitNum)) ) { \
// float fl; \
// fl = (bpl).PermutedInnerProduct( epl ); \
// edge->side = (edge->side & ~(1<<bitNum)) | (FLOATSIGNBITSET(fl) << bitNum); \
// edge->sideSet |= (1 << bitNum); \
// } \
//}
//#define CM_SetTrmPolygonSidedness( v, plane, bitNum ) { \
// if ( !((v)->sideSet & (1<<bitNum)) ) { \
// float fl; \
// fl = plane.Distance( (v)->p ); \
// /* cannot use float sign bit because it is undetermined when fl == 0.0f */ \
// if ( fl < 0.0f ) { \
// (v)->side |= (1 << bitNum); \
// } \
// else { \
// (v)->side &= ~(1 << bitNum); \
// } \
// (v)->sideSet |= (1 << bitNum); \
// } \
//}
// returns true if the trm intersects the polygon
bool TestTrmInPolygon(TraceWork tw, Polygon p)
{
// if already checked this polygon
if (p.checkcount == this.checkCount)
{
return(false);
}
p.checkcount = this.checkCount;
// if this polygon does not have the right contents behind it
if ((p.contents & tw.contents) == 0)
{
return(false);
}
// if the polygon bounds don't intersect the trace bounds
if (!p.bounds.IntersectsBounds(tw.bounds))
{
return(false);
}
// bounds should cross polygon plane
switch (tw.bounds.PlaneSide(p.plane))
{
case PLANESIDE_CROSS:
break;
case PLANESIDE_FRONT:
if (tw.model.isConvex)
{
tw.quickExit = true;
return(true);
}
default:
return(false);
}
// if the trace model is convex
if (tw.isConvex)
{
// test if any polygon vertices are inside the trm
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
// if this edge is already tested
if (edge.checkcount == this.checkCount)
{
continue;
}
for (int j = 0; j < 2; j++)
{
Vertex v = tw.model.vertices[edge.vertexNum[j]];
// if this vertex is already tested
if (v.checkcount == this.checkCount)
{
continue;
}
int bestPlane = 0;
float bestd = float.NegativeInfinity;
int k = 0;
for (; k < tw.numPolys; k++)
{
float d = tw.polys[k].plane.Distance(v.p);
if (d >= 0.0f)
{
break;
}
if (d > bestd)
{
bestd = d;
bestPlane = k;
}
}
if (k >= tw.numPolys)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_MODELVERTEX;
tw.trace.c.normal = -tw.polys[bestPlane].plane.Normal();
tw.trace.c.dist = -tw.polys[bestPlane].plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = v.p;
tw.trace.c.modelFeature = edge.vertexNum[j];
tw.trace.c.trmFeature = 0;
return(true);
}
}
}
}
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
// reset sidedness cache if this is the first time we encounter this edge
if (edge.checkcount != this.checkCount)
{
edge.sideSet = 0;
}
// pluecker coordinate for edge
tw.polygonEdgePlueckerCache[i].FromLine(tw.model.vertices[edge.vertexNum[0]].p, tw.model.vertices[edge.vertexNum[1]].p);
Vertex v = tw.model.vertices[edge.vertexNum[MathEx.INTSIGNBITSET(edgeNum)]];
// reset sidedness cache if this is the first time we encounter this vertex
if (v.checkcount != this.checkCount)
{
v.sideSet = 0;
}
v.checkcount = this.checkCount;
}
// get side of polygon for each trm vertex
int[] sides = new int[CM.MAX_TRACEMODEL_VERTS];
for (int i = 0; i < tw.numVerts; i++)
{
float d = p.plane.Distance(tw.vertices[i].p);
sides[i] = (d < 0.0f ? -1 : 1);
}
// test if any trm edges go through the polygon
for (int i = 1; i <= tw.numEdges; i++)
{
// if the trm edge does not cross the polygon plane
if (sides[tw.edges[i].vertexNum[0]] == sides[tw.edges[i].vertexNum[1]])
{
continue;
}
// check from which side to which side the trm edge goes
bool flip = MathEx.INTSIGNBITSET(sides[tw.edges[i].vertexNum[0]]);
// test if trm edge goes through the polygon between the polygon edges
for (int j = 0; j < p.numEdges; j++)
{
int edgeNum = p.edges[j];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
#if true
CM_SetTrmEdgeSidedness(edge, tw.edges[i].pl, tw.polygonEdgePlueckerCache[j], i);
if (MathEx.INTSIGNBITSET(edgeNum) ^ ((edge.side >> i) & 1) ^ flip)
{
break;
}
#else
float d = tw.edges[i].pl.PermutedInnerProduct(tw.polygonEdgePlueckerCache[j]);
if (flip)
{
d = -d;
}
if (edgeNum > 0)
{
if (d <= 0.0f)
{
break;
}
}
else
{
if (d >= 0.0f)
{
break;
}
}
#endif
}
if (j >= p.numEdges)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_EDGE;
tw.trace.c.normal = p.plane.Normal();
tw.trace.c.dist = p.plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = tw.vertices[tw.edges[i].vertexNum[!flip]].p;
tw.trace.c.modelFeature = p;
tw.trace.c.trmFeature = i;
return(true);
}
}
// test if any polygon edges go through the trm polygons
for (int i = 0; i < p.numEdges; i++)
{
int edgeNum = p.edges[i];
Edge edge = tw.model.edges[Math.Abs(edgeNum)];
if (edge.checkcount == this.checkCount)
{
continue;
}
edge.checkcount = this.checkCount;
for (int j = 0; j < tw.numPolys; j++)
{
#if true
Vertex v1 = tw.model.vertices + edge.vertexNum[0];
CM_SetTrmPolygonSidedness(v1, tw.polys[j].plane, j);
Vertex v2 = tw.model.vertices + edge.vertexNum[1];
CM_SetTrmPolygonSidedness(v2, tw.polys[j].plane, j);
// if the polygon edge does not cross the trm polygon plane
if ((((v1.side ^ v2.side) >> j) & 1) == 0)
{
continue;
}
bool flip = (v1.side >> j) & 1;
#else
Vertex v1 = tw.model.vertices + edge.vertexNum[0];
float d1 = tw.polys[j].plane.Distance(v1.p);
Vertex v2 = tw.model.vertices + edge.vertexNum[1];
float d2 = tw.polys[j].plane.Distance(v2.p);
// if the polygon edge does not cross the trm polygon plane
if ((d1 >= 0.0f && d2 >= 0.0f) || (d1 <= 0.0f && d2 <= 0.0f))
{
continue;
}
bool flip = false;
if (d1 < 0.0f)
{
flip = true;
}
#endif
// test if polygon edge goes through the trm polygon between the trm polygon edges
int k = 0;
for (; k < tw.polys[j].numEdges; k++)
{
int trmEdgeNum = tw.polys[j].edges[k];
TrmEdge trmEdge = tw.edges[Math.Abs(trmEdgeNum)];
#if true
int bitNum = Math.Abs(trmEdgeNum);
CM_SetTrmEdgeSidedness(edge, trmEdge.pl, tw.polygonEdgePlueckerCache[i], bitNum);
if (MathEx.INTSIGNBITSET(trmEdgeNum) ^ ((edge.side >> bitNum) & 1) ^ flip)
{
break;
}
#else
float d = trmEdge.pl.PermutedInnerProduct(tw.polygonEdgePlueckerCache[i]);
if (flip)
{
d = -d;
}
if (trmEdgeNum > 0)
{
if (d <= 0.0f)
{
break;
}
}
else
{
if (d >= 0.0f)
{
break;
}
}
#endif
}
if (k >= tw.polys[j].numEdges)
{
tw.trace.fraction = 0.0f;
tw.trace.c.type = ContactType.CONTACT_EDGE;
tw.trace.c.normal = -tw.polys[j].plane.Normal();
tw.trace.c.dist = -tw.polys[j].plane.Dist();
tw.trace.c.contents = p.contents;
tw.trace.c.material = p.material;
tw.trace.c.point = tw.model.vertices[edge.vertexNum[!flip]].p;
tw.trace.c.modelFeature = edgeNum;
tw.trace.c.trmFeature = j;
return(true);
}
}
}
return(false);
}
int ContentsTrm(Trace results, ref idVec3 start, idTraceModel trm, ref idMat3 trmAxis, int contentMask, CmHandle model, ref idVec3 modelOrigin, ref idMat3 modelAxis)
{
// fast point case
if (!trm || (trm.bounds[1][0] - trm.bounds[0][0] <= 0.0f &&
trm.bounds[1][1] - trm.bounds[0][1] <= 0.0f &&
trm.bounds[1][2] - trm.bounds[0][2] <= 0.0f))
{
results.c.contents = TransformedPointContents(start, model, modelOrigin, modelAxis);
results.fraction = (results.c.contents == 0);
results.endpos = start;
results.endAxis = trmAxis;
return(results.c.contents);
}
this.checkCount++;
TraceWork tw = new TraceWork();
tw.trace.fraction = 1.0f;
tw.trace.c.contents = 0;
tw.trace.c.type = ContactType.CONTACT_NONE;
tw.contents = contentMask;
tw.isConvex = true;
tw.rotation = false;
tw.positionTest = true;
tw.pointTrace = false;
tw.quickExit = false;
tw.numContacts = 0;
tw.model = this.models[(int)model];
tw.start = start - modelOrigin;
tw.end = tw.start;
bool model_rotated = modelAxis.IsRotated();
if (model_rotated)
{
invModelAxis = modelAxis.Transpose();
}
// setup trm structure
SetupTrm(ref tw, trm);
bool trm_rotated = trmAxis.IsRotated();
// calculate vertex positions
if (trm_rotated)
{
for (int i = 0; i < tw.numVerts; i++)
{
// rotate trm around the start position
tw.vertices[i].p *= trmAxis;
}
}
for (int i = 0; i < tw.numVerts; i++)
{
// set trm at start position
tw.vertices[i].p += tw.start;
}
if (model_rotated)
{
for (int i = 0; i < tw.numVerts; i++)
{
// rotate trm around model instead of rotating the model
tw.vertices[i].p *= invModelAxis;
}
}
// add offset to start point
if (trm_rotated)
{
idVec3 dir = trm->offset * trmAxis;
tw.start += dir;
tw.end += dir;
}
else
{
tw.start += trm->offset;
tw.end += trm->offset;
}
if (model_rotated)
{
// rotate trace instead of model
tw.start *= invModelAxis;
tw.end *= invModelAxis;
}
// setup trm vertices
tw.size.Clear();
for (int i = 0; i < tw.numVerts; i++)
{
// get axial trm size after rotations
tw.size.AddPoint(tw.vertices[i].p - tw.start);
}
// setup trm edges
for (int i = 1; i <= tw.numEdges; i++)
{
// edge start, end and pluecker coordinate
tw.edges[i].start = tw.vertices[tw.edges[i].vertexNum[0]].p;
tw.edges[i].end = tw.vertices[tw.edges[i].vertexNum[1]].p;
tw.edges[i].pl.FromLine(tw.edges[i].start, tw.edges[i].end);
}
// setup trm polygons
if (trm_rotated & model_rotated)
{
idMat3 tmpAxis = trmAxis * invModelAxis;
for (int i = 0; i < tw.numPolys; i++)
{
tw.polys[i].plane *= tmpAxis;
}
}
else if (trm_rotated)
{
for (int i = 0; i < tw.numPolys; i++)
{
tw.polys[i].plane *= trmAxis;
}
}
else if (model_rotated)
{
for (int i = 0; i < tw.numPolys; i++)
{
tw.polys[i].plane *= invModelAxis;
}
}
for (int i = 0; i < tw.numPolys; i++)
{
tw.polys[i].plane.FitThroughPoint(tw.edges[abs(tw.polys[i].edges[0])].start);
}
// bounds for full trace, a little bit larger for epsilons
for (int i = 0; i < 3; i++)
{
if (tw.start[i] < tw.end[i])
{
tw.bounds[0][i] = tw.start[i] + tw.size[0][i] - CM_BOX_EPSILON;
tw.bounds[1][i] = tw.end[i] + tw.size[1][i] + CM_BOX_EPSILON;
}
else
{
tw.bounds[0][i] = tw.end[i] + tw.size[0][i] - CM_BOX_EPSILON;
tw.bounds[1][i] = tw.start[i] + tw.size[1][i] + CM_BOX_EPSILON;
}
if (idMath.Fabs(tw.size[0][i]) > idMath.Fabs(tw.size[1][i]))
{
tw.extents[i] = idMath.Fabs(tw.size[0][i]) + CM_BOX_EPSILON;
}
else
{
tw.extents[i] = idMath.Fabs(tw.size[1][i]) + CM_BOX_EPSILON;
}
}
// trace through the model
TraceThroughModel(ref tw);
results = tw.trace;
results.fraction = (results.c.contents == 0);
results.endpos = start;
results.endAxis = trmAxis;
return(results.c.contents);
}
