Efficient Algorithm of Computing the Shortest Distance of Massive Points Based on Probability and Statistics Model
Through adopting probability and statistics model in the process of computing shortest distance, partition strategy can solve the low efficiency of traditional algorithm. Theoretically the time complexity could be reduced to O(N). In this article main algorithms are provided and the factors of affecting algorithms efficiency are also discussed. Finally put forward some applications of the algorithms in our life and research.
J. Q. Deng and J. Zhang, "Efficient Algorithm of Computing the Shortest Distance of Massive Points Based on Probability and Statistics Model", Advanced Materials Research, Vols. 268-270, pp. 1462-1465, 2011