×

Method and apparatus for schematic routing

  • US 5,408,597 A
  • Filed: 07/29/1993
  • Issued: 04/18/1995
  • Est. Priority Date: 07/29/1993
  • Status: Expired due to Term
First Claim
Patent Images

1. A method for generating a graphical connector to form a connection between a first location on a first vertex object and a second location on one of the first vertex object or a second vertex object, the vertex objects being displayed on a monitor controlled by a computer, the computer including a memory storing an object records database and a software application mapping the monitor onto an array of cells, each cell corresponding to a predetermined number of pixels, the method including the steps of:

  • (1) generating a first proposed connector having a first length and corresponding to the first position on the monitor, the first proposed connector extending from the first location to the second location;

    (2) for each cell corresponding to the first position, determining whether that cell is a collision cell corresponding to a position of a colliding object stored in the database, and if so, assigning a value to a collision count, the value depending upon the total number of cells that are collision cells;

    (3) if the collision count for the first position is zero, then storing the first proposed connector as the best connector and proceeding to step 9;

    (4) generating an new proposed connector corresponding to a new position on the monitor and extending from the first location to the second location;

    (5) for each cell corresponding to the new position, determining whether that cell is a collision cell corresponding to a position of an object stored in the database, and if so, assigning a value to a new collision count, the value depending upon the total number of cells that are collision cells;

    (6) if the new collision count for the new position is zero, then storing the new proposed connector as the best connector and proceeding to step 9;

    (7) if the new collision count for the new position is nonzero, maintaining a best collision count record of the proposed position having the lowest collision count of all proposed positions generated so far and storing the corresponding connector with the lowest collision count as the best connector, and returning to step 4;

    (8) repeating steps 4 through 7 until at least one predetermined break criterion is met, and then proceeding to step 9; and

    (9) storing the cells of the best connector in said memory.

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