Multiple people are running into the problem where they need an array of all the misorientation angles between neighboring pixels. We need one fast way to do that
Ideally, if you have an nxm crystalmap, would create an (n-1)x(m-1) array of misorientation angles for the Left-Right connection, and a second (n-1)x(m-1) Up-Down connection. For a hex grid, it would kick out three things instead of two (L-R, UL-DR, UR-DL)
should be a function inside a python file called "orix/graph_cut/aux.py" (make this file if it doesn't exist)
Multiple people are running into the problem where they need an array of all the misorientation angles between neighboring pixels. We need one fast way to do that
Ideally, if you have an nxm crystalmap, would create an (n-1)x(m-1) array of misorientation angles for the Left-Right connection, and a second (n-1)x(m-1) Up-Down connection. For a hex grid, it would kick out three things instead of two (L-R, UL-DR, UR-DL)
should be a function inside a python file called "orix/graph_cut/aux.py" (make this file if it doesn't exist)