- A* version: [5.3.7]
- Unity version: [2022.3.62f3]
I found out that if I want to frequenly check if path is reachable, or any wortk with pathing, I need to use AstarPath.active.GetNearest function. Then for example if units use only one graph, to walk on, I can simply check if target is reachable by comparing if end is in the same area as the start. It is quite fast, but this single function takes in my case 0.4 ms and I found out, that it will go through all nodes and check which one fits. When there are some voxels, I wonder, if there could be option to bake that nodes into voxels. So each voxel carries info of all nodes inside and when calling GetNearest I will just check nodes which are inside that voxel on the asked position. Even better for RTS games and some other games which works on XZ graph only it could be 2D grid (tiles in navmesh). This would make this what I think only slow function to significantly boost performance for a small cost of memory. Because of that I believe it should be an option. I just wonder, what is your opinion to this feature and if possible will by officially implemented or not?