seung-lab / dijkstra3d

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
GNU General Public License v3.0
71 stars 13 forks source link

Try Decision Tree #15

Open william-silversmith opened 3 years ago

william-silversmith commented 3 years ago

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 from e.g. autovectorization?