I'm trying to make a A* pathfinder script :
My script fills the maze with a grid of squares, It then goes through each rectangle and if that rectangle is: touching a square + with the same dimension along the edge they touch, has the same movment cost - then they will merge. This step is repeated and will fill the maze with larger rectangles speeding up the pathfinding process.
But it does not fill to the edges of the walls, and I would prefer an algorithm that fill the maze with convex hulls instead of being limited to rectangles. Is there a name for an algorithm like that?