I’m seeing a load of misinformation on Pathfinding performance. Back in May I wrote an article getting into Pathfinding (PF) performance. See: #SL Pathfinding Update Week 20. Scroll down and read the section on The Size of the Problem.

PF has several different aspects. One could break it into two main parts. One is the part where PF figures out where everything is in the region and how to treat it, as what are obstacles and where are the paths. This is a slow and calculation intense process. But, it really only has to run at region start up, when a region’s ground topology changes, or things are built on the ground. It is sort of an initialization process.
Another part is when PF has to find what has moved, like a door opening. Things like a door that cut across paths are called cuts. PF has to find things that move and ‘cut’ the Navigation Mesh mostly referred to as Navmesh. The cut calc’s are very fast. They only need to revise the previously calculated Navmesh.

