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

Fix typos

Browse Source
This commit is contained in:
Kawe Mazidjatari 2023-07-08 02:20:33 +02:00
parent 2565ff44ef
commit 0110cd91c2
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
r5dev/thirdparty/recast/DetourCrowd/Source/DetourPathCorridor.cpp vendored
View File

@ -181,17 +181,17 @@ One of the difficulties in maintaining a path is that floating point errors, loc
steering can result in the agent crossing the boundary of the path corridor, temporarily invalidating the path.
This class uses local mesh queries to detect and update the corridor as needed to handle these types of issues.
The fact that local mesh queries are used to move the position and target locations results in two beahviors that
The fact that local mesh queries are used to move the position and target locations results in two behaviors that
need to be considered:
Every time a move function is used there is a chance that the path will become non-optimial. Basically, the further
Every time a move function is used there is a chance that the path will become non-optimal. Basically, the further
the target is moved from its original location, and the further the position is moved outside the original corridor,
the more likely the path will become non-optimal. This issue can be addressed by periodically running the
#optimizePathTopology() and #optimizePathVisibility() methods.
All local mesh queries have distance limitations. (Review the #dtNavMeshQuery methods for details.) So the most accurate
use case is to move the position and target in small increments. If a large increment is used, then the corridor
may not be able to accurately find the new location. Because of this limiation, if a position is moved in a large
may not be able to accurately find the new location. Because of this limitation, if a position is moved in a large
increment, then compare the desired and resulting polygon references. If the two do not match, then path replanning
may be needed. E.g. If you move the target, check #getLastPoly() to see if it is the expected polygon.