search

TaipanRex / pyvisgraph

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

Add choice of distance function to use #8

Open TaipanRex opened 8 years ago

TaipanRex commented 8 years ago

both euclidean distance and great circle. Need to be able to choose which to use