Distance-based algorithm for solving representative node set in two-dimensional space

The invention discloses a novel distance-based algorithm for solving a representative node set in a two-dimensional space. The novel distance-based algorithm comprises the steps of inputting a data set; calculating the Skyline point set Q in the data set through the BNL algorithm; sequencing the point set Q; solving the manhattan distance value from the initial point to any other Skyline point and storing; solving k representative Skyline points in the Skyline point set; returning the k representative Skyline points. According to the algorithm, the time complexity is shown as O (K2LOG3m) which is far less than that of the DRS algorithm in the prior art.