The author of recast informs me that their library doesn't support this feature.
Any better ideas for me?
Thanks
Jack
The author of recast informs me that their library doesn't support this feature.
Any better ideas for me?
Thanks
Jack
Each link in the graph contains a maximum size for a unit that can traverse it. Then apply your favorite algorithm as usual.
Hi Jack,
Alvaro's solution won't well work for a robust navigation mesh system.
Please see my response in this thread. In it, I discuss the problems introduced by accounting for agents of different sizes as well as how to resolve them.