You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When open_edges is initialized, the scanline checks intersection against all Edges in graph. It might be faster on graphs with many obstacle polygons to check if the scanline crosses the bounding box of each polygon first. For the boxes it does not cross, all edges in that polygon can be ignored.
The text was updated successfully, but these errors were encountered:
Using line_profiler to profile visible_vertices(), about 10% of running time is spent on initializing open_edges, so any improvements won't have a dramatic effect, but still worth exploring. (interesting note: 58% of time is spent on insort and bisect).
When
open_edges
is initialized, the scanline checks intersection against allEdge
s ingraph
. It might be faster on graphs with many obstacle polygons to check if the scanline crosses the bounding box of each polygon first. For the boxes it does not cross, all edges in that polygon can be ignored.The text was updated successfully, but these errors were encountered: