Home
last modified time | relevance | path

Searched refs:trmEdge (Results 1 – 5 of 5) sorted by relevance

/dports/games/dhewm3/dhewm3-1.5.1/neo/cm/
H A DCollisionModel_translate.cpp256 CM_SetEdgeSidedness( edge, *pl, tw->vertices[trmEdge->vertexNum[0]].pl, trmEdge->vertexNum[0] ); in TranslateTrmEdgeThroughPolygon()
257 CM_SetEdgeSidedness( edge, *pl, tw->vertices[trmEdge->vertexNum[1]].pl, trmEdge->vertexNum[1] ); in TranslateTrmEdgeThroughPolygon()
259 if ( !(((edge->side >> trmEdge->vertexNum[0]) ^ (edge->side >> trmEdge->vertexNum[1])) & 1) ) { in TranslateTrmEdgeThroughPolygon()
264 CM_SetVertexSidedness( v1, tw->polygonVertexPlueckerCache[i], trmEdge->pl, trmEdge->bitNum ); in TranslateTrmEdgeThroughPolygon()
266 CM_SetVertexSidedness( v2, tw->polygonVertexPlueckerCache[i+1], trmEdge->pl, trmEdge->bitNum ); in TranslateTrmEdgeThroughPolygon()
272 …if ( !idCollisionModelManagerLocal::TranslateEdgeThroughEdge( trmEdge->cross, trmEdge->pl, *pl, &f… in TranslateTrmEdgeThroughPolygon()
301 tw->trace.c.normal = ( end - start ).Cross( trmEdge->end - trmEdge->start ); in TranslateTrmEdgeThroughPolygon()
316 normal[0] = trmEdge->cross[2]; in TranslateTrmEdgeThroughPolygon()
317 normal[1] = -trmEdge->cross[1]; in TranslateTrmEdgeThroughPolygon()
318 normal[2] = trmEdge->cross[0]; in TranslateTrmEdgeThroughPolygon()
[all …]
H A DCollisionModel_rotate.cpp489 …if ( tw->vertices[trmEdge->vertexNum[0]].polygonSide & tw->vertices[trmEdge->vertexNum[1]].polygon… in RotateTrmEdgeThroughPolygon()
495 if ( !trmEdge->rotationBounds.IntersectsBounds( poly->bounds ) ) { in RotateTrmEdgeThroughPolygon()
500 if ( trmEdge->rotationBounds.PlaneSide( poly->plane ) != SIDE_CROSS ) { in RotateTrmEdgeThroughPolygon()
535 if ( !trmEdge->rotationBounds.IntersectsBounds( bounds ) ) { in RotateTrmEdgeThroughPolygon()
539 f1 = trmEdge->pl.PermutedInnerProduct( tw->polygonEdgePlueckerCache[i] ); in RotateTrmEdgeThroughPolygon()
546 f2 = trmEdge->pl.PermutedInnerProduct( epsPl ); in RotateTrmEdgeThroughPolygon()
551 if ( !EdgeFurthestFromEdge( tw, trmEdge->plzaxis, v1->p, v2->p, startTan, dir ) ) { in RotateTrmEdgeThroughPolygon()
573 …if ( !RotateEdgeThroughEdge(tw, trmEdge->plzaxis, v1->p + epsDir, v2->p + epsDir, 0.0f, tanHalfAng… in RotateTrmEdgeThroughPolygon()
583 if ( !CollisionBetweenEdgeBounds( tw, trmEdge->start, trmEdge->end, v1->p, v2->p, in RotateTrmEdgeThroughPolygon()
600 if ( (tw->trace.c.normal * trmEdge->start) - tw->trace.c.dist < 0 ) { in RotateTrmEdgeThroughPolygon()
[all …]
H A DCollisionModel_contents.cpp159 cm_trmEdge_t *trmEdge; in TestTrmInPolygon() local
349 trmEdge = tw->edges + abs(trmEdgeNum); in TestTrmInPolygon()
352 CM_SetTrmEdgeSidedness( edge, trmEdge->pl, tw->polygonEdgePlueckerCache[i], bitNum ); in TestTrmInPolygon()
357 d = trmEdge->pl.PermutedInnerProduct( tw->polygonEdgePlueckerCache[i] ); in TestTrmInPolygon()
H A DCollisionModel_local.h351 … TranslateTrmEdgeThroughPolygon( cm_traceWork_t *tw, cm_polygon_t *poly, cm_trmEdge_t *trmEdge );
369 …void RotateTrmEdgeThroughPolygon( cm_traceWork_t *tw, cm_polygon_t *poly, cm_trmEdge_t *trmEdge
H A DCollisionModel_load.cpp798 const traceModelEdge_t *trmEdge; in SetupTrmModel() local
825 trmEdge = trm.edges + 1; in SetupTrmModel()
826 for ( i = 0; i < trm.numEdges; i++, edge++, trmEdge++ ) { in SetupTrmModel()
827 edge->vertexNum[0] = trmEdge->v[0]; in SetupTrmModel()
828 edge->vertexNum[1] = trmEdge->v[1]; in SetupTrmModel()
829 edge->normal = trmEdge->normal; in SetupTrmModel()