@unabomberman take a look at the "shadows" around the objects scattered about--the corners of these polygons are vertices in the graph that the A* algorithm searches. The edges of the graph are paths between vertices that are unobstructed, i.e. do not pass through the shadow. These edges can be saved if the geometry is static.
In contrast, (and for completeness' sake) the vertices on a grid-based map are the grid positions, and the edges are the north-south-east-west connections.
How did you do it wthout a grid?
unabomberman 1 year ago
@unabomberman take a look at the "shadows" around the objects scattered about--the corners of these polygons are vertices in the graph that the A* algorithm searches. The edges of the graph are paths between vertices that are unobstructed, i.e. do not pass through the shadow. These edges can be saved if the geometry is static.
In contrast, (and for completeness' sake) the vertices on a grid-based map are the grid positions, and the edges are the north-south-east-west connections.
sastraxi 1 year ago