R5Reloaded/r5sdk
1
0
Fork 0
mirror of https://github.com/Mauler125/r5sdk.git synced 2025-02-09 19:15:03 +01:00
Code Issues Packages Projects Releases Wiki Activity

Recast: add utility to get tile side by vector direction

Browse Source 
Necessary for next upgrade to traverse link algorithm to get the neighbor tile facing the direction of the edge's normal.
This commit is contained in:
Kawe Mazidjatari 2024-08-28 12:17:29 +02:00
parent a3753dec9f
commit 57e66f1dfc
2 changed files with 27 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/thirdparty/recast/Shared/Include/SharedCommon.h vendored
View File

@ -469,6 +469,7 @@ float rdCalcLedgeSpanOffsetAmount(const float ledgeSpan, const float slopeAngle,
unsigned char rdClassifyPointOutsideBounds(const float* pt, const float* bmin, const float* bmax);
unsigned char rdClassifyPointInsideBounds(const float* pt, const float* bmin, const float* bmax);
unsigned char rdClassifyDirection(const float* dir, const float* bmin, const float* bmax);
/// Determines if the specified point is inside the convex polygon on the xy-plane.
/// @param[in] pt The point to check. [(x, y, z)]

26
src/thirdparty/recast/Shared/Source/SharedCommon.cpp vendored
View File

@ -503,3 +503,29 @@ unsigned char rdClassifyPointInsideBounds(const float* pt, const float* bmin, co
return rdClassifyPointOutsideBounds(newPt, bmin, bmax);
}
unsigned char rdClassifyDirection(const float* dir, const float* bmin, const float* bmax)
{
const float len = rdMathSqrtf(dir[0]*dir[0] + dir[1]*dir[1]);
float dirNorm[2] = { 0.0f, 0.0f };
if (len > RD_EPS)
{
dirNorm[0] = dir[0] / len;
dirNorm[1] = dir[1] / len;
}
float center[2];
center[0] = (bmin[0]+bmax[0]) * 0.5f;
center[1] = (bmin[1]+bmax[1]) * 0.5f;
float boxSize[2];
boxSize[0] = bmax[0]-bmin[0];
boxSize[1] = bmax[1]-bmin[1];
float newPt[2];
newPt[0] = center[0]+dirNorm[0] * boxSize[0];
newPt[1] = center[1]+dirNorm[1] * boxSize[1];
return rdClassifyPointOutsideBounds(newPt, bmin, bmax);
}