I have a set of objects (rectangles having 4 vertices of (X,Y) each) draw on a map using OpenGL ES. I would want to implement way finding between each of them.
For example I have rectangles A,B,C,D,E
Structure:
A[Vertex(X,Y),Vertex(X,Y),Vertex(X,Y),Vertex(X,Y)] - Rectangle A
..
..
E[Vertex(X,Y),Vertex(X,Y),Vertex(X,Y),Vertex(X,Y)] - Rectangle E
And I have no other information other than this. Is it possible to draw a path from B to E using A* path finding alogrithm.
Is there anything else required for its implemented? I've looked up A star search implementation but most of them word on grid based maps, where they calculate costs with the nearby nodes and use them for finding the map? Is there a way I could I calculate those with the data I have?