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

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Vaswani, Ramesh H., Klevjer, Kaare H., Kita, Ronald A.
• Primary Examiner(s): Nguyen, Phu K.
• Application Number:
  US08/100,001
• Time in Patent Office: 628 Days
• Field of Search: 395/140, 395/141, 395/142, 395/143, 395/155, 395/161, 345/135, 345/136, 345/16, 345/17, 345/18
• US Class Current: 345/440
• CPC Class Codes: G06F 2111/12 Symbolic schematics
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

An apparatus and method for generating connected graphs for display on a computer monitor. A data structure and virtual map are defined which provide a linked list of objects appearing at any location in the connected graph, the virtual map being larger than the dimensions of the display monitor if the connected graph demands larger dimensions. Commands carried out with respect to any object on the monitor are correlated with the cell maps in the virtual map, which point to the linked lists of objects, the lists in turn pointing to objects stored in an object records database. This provides rapid access to all objects at any given location on the display or in the connected graph. When a user gives a command to create a connection between two objects in the graph, the method generates the shortest connection possible, in terms of both pixel length and arc length for arc-connections, balanced against a minimization of collisions by the connection with existing objects, including other connections. The method is described in connection with the generation of graphical models of finite state machines (FSMs), but is suitable for use in any system where it is desirable to rapidly produce connected graphs and to maintain a minimum, user-definable level of clarity and legibility of the graph.

Claims

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.

2. The method of claim 1, wherein the colliding object is an object other than the first vertex object and the second vertex object.

3. The method of claim 1, wherein the first and second location are both on the first object, the method further including, after each of steps 1 and 4 and before steps 2 and 5, respectively, the steps of:

for each of a predetermined number of registration cells, determining whether the registration cell corresponds to a position of one of a predefined group of objects, and if so, rejecting the proposed connector and proceeding to step 4.

4. The method of claim 3, wherein the predetermined group of objects includes another connector to and from the first vertex object.

5. The method of claim 3, wherein the predetermined group of objects includes a vertex object other than the first vertex object.

6. The method of claim 3, wherein the predetermined group of objects includes a connector other than the connector to the first vertex object.

7. The method of claim 1, including earlier iterations and later iterations of steps 4 through 7, wherein at least some of the proposed connectors generated in the later iterations are longer than proposed connectors generated in the earlier iterations.

8. The method of claim 7, further including the step of displaying the connector with a broken portion if the connector exceeds a predetermined length.

9. The method of claim 7, wherein said at least one predetermined break criterion includes a maximum length for the connector.

10. The method of claim 1, including earlier iterations and later iterations of steps 4 through 7, wherein at least some of the proposed connectors generated in the later iterations have a radius of curvature smaller than proposed connectors generated in the earlier iterations.

11. The method of claim 10, wherein said at least one predetermined break criterion includes a maximum arc length for the proposed connector.

12. The method of claim 1, wherein said at least one predetermined break criterion includes a maximum number of proposed connectors generated.

13. The method of claim 1, further including the step of displaying the connector with broken portion if the connector includes said collision cells, the broken portion being at a position on the monitor corresponding to the collision cells.

14. The method of claim 1, wherein a previously generated connector from the first location to the second location is defined as a noncolliding object, and the connector generated by the method of steps 1-9 is a new connector between the first location and the second location, the new connector and the previously generated connector occupying a common set of cells.

15. The method of claim 14, including, after step 9, the step of generating an object for visually distinguishing between the previously generated connector and the new connector.

16. The method of claim 1, including, before step 9, the steps of:

(10) generating a cell map relating to each cell of the best connector, each cell map referencing a linked list of pointers, with one pointer to each object in the database that includes a cell corresponding to a location occupied by a cell of the best connector; and

(11) storing each generated cell map.

17. The method of claim 16, wherein each of steps 2 and 5 includes the step of traversing the linked list corresponding to each said cell corresponding to the first position or the new position, respectively, for determining which objects in the database are colliding objects.