Method of positioning two modules having angled edges

Claim 3

The method of claim 1 wherein said determining step further comprises the steps of: (a) determining if x 2 ≧x 1 and x 3 ≧x 4 , then said edges intersect by convergence and (i) if y 2 >y 4 choosing (x 2 ,y 2 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step; (ii) if y 4 ≧y 2 choosing (x 4 ,y 4 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step; (b) determining if x 1 ≧x 2 and x 4 ≧x 3 , then said edges intersect by divergence and (i) if y 1 >y 3 choosing (x 3 ,y 3 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step; (ii) if y 3 ≧y 1 choosing (x 1 ,y 1 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step; and (c) determining if the relationship of x 1 , x 2 , x 3 and x 4 are not found in steps (a) or (b), then calculating the slopes of the lines E 1 -E 2 and E 3 -E 4 where m 1 is the slope of line E 1 -E 2 and m 2 is the slope of E 3 -E 4 , where slope is dx/dy, then if (i) m 2 <m 1 , said edges intersect by divergence and choosing (x 3 ,y 3 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step to calculate a first constraint; choosing (x 1 ,y 1 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step to calculate a second constraint; and (ii) m 2 ≧m 1 , said edges intersect by convergence and choosing (x 2 ,y 2 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and x 4 ,y 4 ) as (Bx,By) in the constraint calculation step to calculate a first constraint; choosing (x 4 ,y 4 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step to calculate a second constraint; where Ptx, Pty, Bx, By, Tx, and Ty are coordinate values.

Claim 4

The method of claim 2 further comprising the step of comparing said first constraint to said second constraint (in the event step 2(c) is chosen) and selecting the larger number as the constraint; after said calculating step and prior to said moving step.

Claim 5

The method of claim 3 wherein said calculating step comprises: (a) choosing d=minus infinity or no constraint, if Pty≦By-S; (b) choosing ##EQU4## if Pty<By±S*dx/m where + is used if (Ptx,Pty) is to the left of the line E 1 - E 2 , and - is used if (Ptx,Pty) is to the right of the line E 3 - E 4 ; (c) choosing d =(S*m±dx*(Pty-By))/dy if Pty≦Ty±S*dx/m where + is used if (Ptx,Pty) is to the left of the line E 3 - E 4 , and - is used if (Ptx,Pty) is to the right of the line E 1 - E 2 ; (d) choosing ##EQU5## if Pty<Ty+S where + is used if (Ptx,Pty) is to the right of the line E 3 - E 4 , and - is used if (Ptx,Pty) is to the left of the line E 1 - E 2 ; or (e) choosing d=minus infinity, or no constraint, if Pty≧Ty+S; where d is the constraint, dx=Tx-Bx, dy=Ty-By, and ##EQU6##

Claim 6

The method of claim 4 wherein said moving step comprises: moving said modules in the x direction to one another until, Ptx<Bx-d if Ptx<Bx, or Ptx≧Bx+d if Ptx>Bx.

Claim 7

In a machine process for compacting two modules, representative of integrated circuits, on a planar field, each of said modules having an edge which is closest to the other module and each edge is characterized by two endpoints, said endpoints lie in a rectilinear coordinate system having the following coordinates E 1 (x 1 ,y 1 ), E 2 (x 2 ,y 2 ), E 3 (x 3 ,y 3 ), E 4 (x 4 ,y 4 ), where E 1 and E 2 are the endpoints of one of said edges, and E 3 and E 4 are the endpoints of the other edge, said endpoints characterized by the edge E 3 - E 4 being to one side of the edge E 1 - E 2 in the increasing x direction, y 1 >y 2 and y 3 >y 4 and wherein said edges are positioned, not necessarily parallel to one of the axis of the coordinate system, said machine process utilizing a computer with a stored program for moving said modules in the x direction to one another, further wherein the modules cannot be separated by a distance less than a minimum distance, S, from one another, at their closest points of separation, said method comprising the steps of: determining if the edges, if extended, intersect by divergence or by convergence; calculating the constraint between one of said endpoints of one edge and one of the endpoints of the other edge, as a function of S; and moving said modules in said x direction until the x coordinates of one of said endpoints of one edge and one of the endpoints of the other edge are separated by no less than said constraint.

Claim 8

In a machine process for compacting two modules, representative of integrated circuits, on a planar field, each of said modules having an edge which is closest to the other module and each edge is characterized by two endpoints, said endpoints lie in a rectilinear coordinate system having the following coordinates E 1 (x 1 ,y 1 ), E 2 (x 2 ,y 2 ), E 3 (x 3 ,y 3 ), E 4 (x 4 ,y 4 ), where E 1 and E 2 are the endpoints of one of said edges, and E 3 and E 4 are the endpoints of the other edge, said endpoints characterized by the edge E 3 - E 4 being to one side of the edge E 1 - E 2 in the increasing x direction, y 1 >y 2 and y 3 >y 4 and wherein said edges are positioned, not necessarily parallel to one of the axis of the coordinate system, said machine process utilizing a computer with a stored program for moving said modules in the x direction to one another, further wherein the modules cannot be separated by a distance less than a minimum distance, S, from one another, at their closest points of separation, said method comprising the steps of: determining if the edges, if extended, intersect by divergence or by convergence; calculating the constraint between one of said endpoints of one edge and one of the endpoints of the other edge, as a function of S; and moving said modules in said x direction until the x coordinates of one of said endpoints of one edge and one of the endpoints of the other edge are separated by no less than said constraint.

Claim 9

The method of claim 6 wherein said determining step further comprises the steps of: (a) determining if x 2 ≧x 1 and x 3 ≧x 4 , then said edges intersect by convergence and (i) if y 2 >y 4 choosing (x 2 ,y 2 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step; (ii) if y 4 ≧y 2 choosing (x 4 ,y 4 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step; (b) determining if x 1 ≧x 2 and x 4 ≧x 3 , then said edges intersect by divergence and (i) if y 1 >y 3 choosing (x 3 ,y 3 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step; (ii) if y 3 ≧y 1 choosing (x 1 ,y 1 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step; and (c) determining if the relationship of x 1 , x 2 , x 3 and x 4 are not found in steps (a) or (b), then calculating the slopes of the lines E 1 -E 2 and E 3 -E 4 where m 1 is the slope of line E 1 -E 2 and m 2 is the slope of E 3 -E 4 , where slope is dx/dy, then if (i) m 2 <m 1 , said edges intersect by divergence and choosing (x 3 ,y 3 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step to calculate a first constraint; choosing (x 1 ,y 1 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step to calculate a second constraint; and (ii) m 2 ≧m 1 , said edges intersect by convergence and choosing (x 2 ,y 2 ) as (Ptx,Pty) and (x 3 ,y 3 ) as (Tx,Ty) and (x 4 ,y 4 ) as (Bx,By) in the constraint calculation step to calculate a first constraint; choosing (x 4 ,y 4 ) as (Ptx,Pty) and (x 1 ,y 1 ) as (Tx,Ty) and (x 2 ,y 2 ) as (Bx,By) in the constraint calculation step to calculate a second constraint; where Ptx, Pty, Bx, By, Tx and Ty are coordinate values.

Claim 10

The method of claim 7 further comprising the step of comparing said first constraint to said second constraint (in the event step 2(c) is chosen) and selecting the larger number as the constraint; after said calculating step and prior to said moving step.

Claim 11

The method of claim 8 wherein said calculating step comprises: (a) choosing d=minus infinity, or no constraint, if Pty≦By-S; (b) choosing ##EQU7## if Pty<By±S*dx/m where + is used if (Ptx,Pty) is to the left of the line E 1 - E 2 , and - is used if (Ptx,Pty) is to the right of the line E 3 - E 4 ; (c) choosing d=(S*m±dx*(Pty-By))/dy if Pty≦Ty±S*dx/m where + is used if (Ptx,Pty) is to the left of the line E 3 - E 4 , and - is used if (Ptx,Pty) is to the right of the line E 1 - E 2 ; (d) choosing ##EQU8## if Pty<Ty+S where + is used if (Ptx,Pty) is to the right of the line E 3 - E 4 , and - is used if (Ptx,Pty) is to the left of the line E 1 - E 2 ; or (e) choosing d=minus infinity, or no constraint, if Pty≧Ty+S; where d is the constraint, dx=Tx-Bx, dy=Ty-By, and ##EQU9##

Claim 12

The method of claim 9 wherein said moving step comprises: moving said modules in the x direction to one another until, Ptx≦Bx-d if Ptx<Bx, or Ptx≧Bx+d if Ptx>Bx.