In this paper, a new geometric method for solving TS problem is presented.Let n be the number of points in the point set, and m be the number of vertexes in convex hulls of the point set. The time complexity of the algorithm is: the number of computation distance is Ｏ（ｎｍ）, the number of comparisons is Ｏ（ｍａｘ（ｎｍ，ｎｌｏｇｎ）） and the number of computation included angle is Ｏ（n²/m）.