Thank you for your splendid work. I have read your code and have some questions about your implementation.
Your algorithm searches for the nearest nodes using brute force (line 163~169 in sgmp.m).
I wonder whether algorithms like KDtree improve the speed? Do you use brute force because it is fast or simple to implement?