×

MACHINE PROCESS FOR POSITIONING INTERCONNECTED COMPONENTS TO MINIMIZE INTERCONNECTING LINE LENGTH

  • US 3,681,782 A
  • Filed: 12/02/1970
  • Issued: 08/01/1972
  • Est. Priority Date: 12/02/1970
  • Status: Expired due to Term
First Claim
Patent Images

1. A machine process for positioning interconnected modules on a planar field defined by a Cartesian coordinate system having X and Y axes by use of a programmed digital computer having stored in its internal memory a program enabling the computer to perform the following steps:

  • a. randomly assigning modules to locations on the field, b. calculating an attraction vector for each module of every pair of interconnected modules, said vector being directed from the module in question toward the module to which it is connected and having a magnitude proportional to (i) the distance separating the two modules, and (ii) the number of lines connecting the two modules, c. calculating the X- and Y-components of each attraction vector, d. deleting from each module, pairs of oppositely directed vector components, beginning with the pair having the greatest magnitude in their respective directions and continuing with the pair having the next greatest magnitude, etc. until all such pairs have been deleted, e. calculating a repulsion vector for each module of every pair of unconnected modules, said repulsion vector being directed from the module in question in a direction opposite that in which the other module of the pair lies and having a magnitude inversely proportional to the distance separating the two modules, f. calculating for each module a resultant vector from the module'"'"''"'"'s attraction vectors and repuslion vectors, and g. simultaneously repositioning said modules by moving each in the direction of its resultant vector by an amount proportional to the magnitude of its resultant vector.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×