From 0110cd91c26fa7c92dca718b91dcc54cc74ced92 Mon Sep 17 00:00:00 2001 From: Kawe Mazidjatari <48657826+Mauler125@users.noreply.github.com> Date: Sat, 8 Jul 2023 02:20:33 +0200 Subject: [PATCH] Fix typos --- .../recast/DetourCrowd/Source/DetourPathCorridor.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/r5dev/thirdparty/recast/DetourCrowd/Source/DetourPathCorridor.cpp b/r5dev/thirdparty/recast/DetourCrowd/Source/DetourPathCorridor.cpp index 47f4e127..b4860bfa 100644 --- a/r5dev/thirdparty/recast/DetourCrowd/Source/DetourPathCorridor.cpp +++ b/r5dev/thirdparty/recast/DetourCrowd/Source/DetourPathCorridor.cpp @@ -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.