issues
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
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Simplifying polygons
#7
TaipanRex
opened
8 years ago
4
point_in_polygon: find better way using segments
#6
TaipanRex
closed
7 years ago
0
Look at using generators to improve memory footprint
#5
TaipanRex
closed
7 years ago
0
Optimize removing edges that are inside polygons
#4
TaipanRex
closed
7 years ago
0
Tunings from Kitzinger
#3
TaipanRex
closed
7 years ago
0
Implement AVL Tree for open_edges
#2
TaipanRex
closed
7 years ago
0
Address colinearity in edge_intersect()
#1
TaipanRex
closed
7 years ago
0
Previous