Abstract: To solve the problem of independent baselines search,we introduced four classical algorithms generalized into two categories.We proposed a new algorithm based on vertex incidence matrix.And we analyzed the optimality and relative merits of these five methods.The simulation results verify the effectiveness and advantages of the proposed algorithm.Moreover,we studied the application of the new method to independent double-difference ambiguity selection.The study has demonstrated that the proposed algorithm outperforms the existing methods and can be extended to a higher dimensional space.Besides,we mertioned a new concept of vector weight.