search

TaipanRex / pyvisgraph

Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points
MIT License
217 stars 45 forks source link

Exceptions: polygons #24

Open TaipanRex opened 6 years ago

TaipanRex commented 6 years ago

If try to add a incorrect polygon, should raise an exception. Should be simple polygons, i.e. min. 3 points, no intersecting lines etc.

TaipanRex commented 6 years ago

With reference to #26, I may just refer this to the user. There are packages like Shapely that can do this for you.