The Computer Algorithms of Finding Shortest Distance Pair of Points in Space
空间最近点对的计算机算法研究

Finding Shortest Distance pair of points in space is the important problem of the air traffic control system.There are a lot of applications with the problem and it is also a basic one of the computing geometry study.By methods of divide and conquer,the problem has been solved from the points of linearity and plane,it can be accomplished within the O(nlogn)time.Under the base of unidimentional and two-dimensional algorithm,this paper solves the Shortest Distance pair of points in space problem and analyzes the complexity of the algorithms.