Convex polygonal obstacles

Question

Convex polygonal obstacles

Closed this issue 6 years ago · 4 comments

bulutkartal commented 7 years ago

Is there a way to use it with convex polygonal obstacles and coordinates?

Answer 1 · 2018-07-26T13:46:32.000Z

Could you provide more information ? Code examples etc ?

Answer 2 · 2018-07-26T14:53:46.000Z

Graphical uses Dijkstra's algorithm to calculate shortest path with polygonal obstacles.

Answer 3 · 2018-07-27T06:03:53.000Z

I have never use graphs for such purpose. I suspect the main challenge is to determine correct vertices and weights between corners of polygonal obstacles. If you have some idea how library could help with it PR welcome.

Answer 4 · 2018-10-26T16:53:02.000Z

Any answer since 3 month. Issue closed.