Patent ID: 9665270
Date: 2017-05-30
CPC Classifications: G06F,G06T

Claim:
1. A computer-implemented method for graphically arranging model entities, the method comprising the following operations performed by one or more computing resources: (i) receiving a grid comprising multiple rows r and multiple columns c defining multiple cells, wherein the number of columns is n; (ii) receiving a plurality of entities, wherein each entity has an associated entity height, and wherein one or more of the entities in the plurality of entities are linked by one or more associations to one or more other entities in the plurality of entities; (iii) calculating a number of entities associated with each of the plurality of entities; (iv) placing, in cells of the grid, entities from the plurality of entities, wherein each of the placed entities has no associations within the plurality of entities or only has self-associations between functions of the respective entity; (v) drawing a horizontal pathway below each row of placed entities; (vi) dynamically adjusting the height of the rows with placed entities; (vii) placing a particular entity, from the plurality of entities, having the highest number of associations in grid cell (r, INT(n/2)) or (r, INT(h/2)), whichever is lower, where h is the number of associated entities to be placed in row r and INT indicates a nearest rounded integer for a quotient of a respective division; (viii) placing entities associated with the particular entity of the cell (r, INT(n/2)) or (r, INT(h/2)) in order of increasing or decreasing number of associations, wherein the placing is performed in the sequence (r, 1), (r, 3), (r, 4), (r, 5), . . . , (r, n), (r, INT(n/2)) or (r, INT(h/2)) for increasing number of the associations, wherein the placing is performed in reverse sequence for decreasing number of the associations, and wherein if a cell of the sequence is occupied then the occupied cell is skipped for the placing; (ix) repeat operation (viii) for each of the other entities from the plurality of entities until all associated entities are placed on the grid, wherein if one row is occupied move to the next row of the grid; (x) dynamically adjusting the height of the rows with placed entities; (xi) determining a remaining entity with next highest number of associations, wherein if this determined remaining entity is already placed on the grid, then repeat operation (viii) for entities not placed on the grid, else repeat operations (v) to (viii); and (xii) drawing the associations of the entities placed on the grid, the associations drawn as lines connecting related entities.