I’m looking to build distance maps based on the navmesh. Basically doing a Dijkstra search and returning the poly’s and their distance to the start position. Clamped to a max radius of course:) Ideally, so we can use this data in EQS and where we have a lot of things pathfinding to a single point or area
How would you go about this? I basically need
findPolysInPathDistance but with a distance for each poly. I’m prepared to just write another version of that function. But I was wondering if there was a slicker way to do it.