Creating these node pairs is difficult when thousands of nodes are available. This program takes the nodes and creates groups which are enslaved to each other. This program finds a list of all nodes on the left and right borders of an OOF grid.
All groups have only two nodes.
If there are unequal numbers of nodes, it pairs up each node with the closest node on the opposing side based on y position. In this case, all nodes are placed in groups, some of which will have more than two nodes. To use this program, you must first create an ascii file of all grid points. This file is then used as an input file for the program. The program assumes that the width of the grid is 1.