So I've been working on my A* algorithm for awhile, and now I think it's time that I move into the 360° world. I think I've thought of a good way to do it all (I would explain it but it's hard for me to do so in an understandable way). The only problem is that I need to convert all my walls into walls on a grid (look at the picture).
Red = Wall (in 360° world)
Gray tile = Wall (in grid world)
White tile = Open tile
I have no idea how to go from the red lines to the gray tiles though. I've thought of using the lines' slopes, but that wouldn't work for vertical lines. I've thought of another method, but I don't think it's very good (I don't even know if it would work). I would iterate through all the lines and cast them onto the grid (but I'd only update the dynamic lines; static lines wouldn't need updating). This is an example of the one method I've thought of (and I think it could be much better).
// For this example, 1 unit will be the length of 1 tile
float x1, y1, x2, y2; // let these be the endpoints of the line
int distance = int(abs(y2 - y1) + abs(x2 - x1)); // the amount of tiles in between the two points in the Manhattan grid style
float dx = (x2 - x1) / distance; // the change in x's
float dy = (y2 - y1) / distance; // the change in y's
float currentX = x1;
float currentY = y1;
for (int a = 0; a <= distance; a++)
{
grid[int(currentX)][int(currentY)].status = wall;
currentX += dx;
currentY += dy;
}
I'd be using the grid to perform my A* search.
If there is a better way to do this, please let me know and help me out.
