william-silversmith
commented
5 years ago Since we are literally searching in 3D space, a rough approximation of how much faster it would be is (4/3 pi (2r)^3 ) / (2 x 4/3 pi r^3 ) = 4x in free space
Closed william-silversmith closed 4 years ago
william-silversmith
commented
5 years ago Since we are literally searching in 3D space, a rough approximation of how much faster it would be is (4/3 pi (2r)^3 ) / (2 x 4/3 pi r^3 ) = 4x in free space
Dijkstra's algorithm is a bottleneck in Kimimaro. Would it be possible to make it faster in target mode?
https://en.wikipedia.org/wiki/Bidirectional_search