New edges not used in shortest tours of travelling salesman problems

For the symmetric travelling salesman problem in an Euclidian plane, a geometrical method for finding edges not used in shortest tours of a complete graph is shown. The edges are obtained as pairs, like edges crossing each other. In special cases, the number of these pairs is six times the number of crossing-pairs. Relations between the method introduced here and the shortest spanning tree are discussed.