Re:How to smooth and spread A* paths for an RTS
by hesdeadjim on Tuesday January 31, 2023 @03:08PM
(#34601144)
A* is as valid on a navmesh as it is in a grid-based layout. A* just needs "points" (or each edge of a navmesh polygon) and the edges that connect them, how those points and edges are represented or exist in the world is entirely an implementation detail.
[ Parent
| on HN ]
Re:How to smooth and spread A* paths for an RTS
by TillE on Tuesday January 31, 2023 @11:07PM
(#34606216)
It's funny cause A* (a slight modification of Dijkstra's algorithm) is explicitly an algorithm that operates on graphs. Applying it to a "navmesh" is actually conceptually simpler than thinking of a grid-based game world as a big uniform graph.