Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
4
Newest
 Student
Impact
~382 people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Jan
7
awarded  Student
Jan
7
awarded  Scholar
Jan
7
awarded  Supporter
Jan
7
comment Is there a classic algorithm to find the shortest path between two points in a bidimentional space with polygon obstacles?
@hardmath that was my first guess, but it appears that finding out the "suitable" graph to use the Dijkstra is not trivial at all ;=)
Jan
7
accepted Is there a classic algorithm to find the shortest path between two points in a bidimentional space with polygon obstacles?
Jan
7
awarded  Autobiographer
Jan
7
asked Is there a classic algorithm to find the shortest path between two points in a bidimentional space with polygon obstacles?