dijkstra3d
dijkstra3d copied to clipboard
seung-lab
Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
Experimenting with a hill climbing distance metric as requested in https://github.com/seung-lab/dijkstra3d/issues/26 Thanks for the inspiration in https://github.com/ReubenDo/dijkstra3d/blob/master/dijkstra3d.hpp ```python dijkstra3d.dijkstra( data, source, target, metric="gradient", metric_args=[1.0, 1.0], # equal weight to euclidean...
I don't have a great use case for this myself, but it seems like it should be possible to run bidirectional dijkstra with two threads.
Dijkstra's algorithm finds shortest paths based on weigths assigned to edges in a graph. As far as I understand it, in dijkstra3d, given a field image, a directed graph is...
Distance field computation seems amenable to a scan-line algorithm and may be a rate-limiting step in Kimimaro.
The compiler can't easily make inferences about how code will be accessed within the core neighborhood loop so if we instead write it explicitly, will we see a performance improvement...
Jump Point Search is supposedly better than A* on uniform-cost rectangular grids. Unfortunately, the problem I work with is non-uniform cost rectangular grids. However, if someone finds this idea useful,...
Currently `compass=True` only has meaning for `bidirectional=False`. Compass mode is more formally known as A* search.
Hi, Trying to figure out how to use the parents function. My goal is to obtain ALL possible shortest paths between a pair of nodes (or voxels). Using the path_from_parents...
