Carter Francis
Carter Francis
@din14970 This is very cool. It gives me a couple more ideas of where to go with this. I think in general this is the right idea of where to...
> I'm not entirely sure how the KDTree works under the hood to be honest, but indeed it's some kind of search index that works based on distance (you can...
Just a note that time is mostly related to the argmax and sum functions, each taking around 12 ms to complete. This really also depends on the sparsity of the...
Do we think that this is worth writing up? The performance gains from the other method are decent but not huge. I probably can't spend too much more time thinking...
Interestingly enough the method that I wrote above is basically the same as an Oct tree (I guess in 2 dimensions that might be called a Quad Tree) It is...
> I think we should write up our 1.0.0 and I think doing it (broadly) in the open is an excellent idea. I've had some success integrating Overleaf with Github...
@uellue Thank you for your input! I think the concept of an external code review is an excellent idea. For a largely software based submission it does seem appropriate that...
> A pyxem reference paper in M&M would be great. I hope to help whenever I find the time (away from kikuchipy). Any help would be appreciated! > Agree. Ideally,...
@pc494 @magnunor @dnjohnstone @JoonatanL I have a reasonably fleshed out draft for the pyxem 1.0.0 paper and was wondering if any of you would be willing to review it? There...
@magnunor @pc494 sonds good! I'm going to give it another couple of read throughs and I'll send it your way