Method and apparatus for organizing objects of a network map
First Claim
Patent Images
1. A method for efficiently organizing objects displayed on a screen of a network mapping tool, the method comprising the steps of:
- generating a connected graph of linked objects within a network atlas of maps, each map comprising a logical page depicting a portion of an inter network computing system;
organizing the connected graph on each logical page such that a collection of related ones of the linked objects is displayable on a window of the screen; and
recovering blank space in said graph by minimizing a distance from a center of a parent node object to a center of an associated child node object while ensuring that none of said linked objects overlap each other, wherein an angular position of one linked object relative to another linked object in said graph is calculated by first calculating a first value calculated by dividing a diameter of the one linked object by a length of a connection between the one and the another linked objects, the angular position being based upon a second value calculated by adding to the first value a predefined value.
3 Assignments
0 Petitions
Accused Products
Abstract
A layout technique generates a compact connected graph of linked objects that is organized on a page basis, i.e., the page comprises a collection of related objects displayed on a single scrollable window. Objects are generally grouped near neighboring objects with whom they share links. The technique further organizes the connected graph as a hub-and-spoke arrangement to reduce the number of overlapping objects and crossing links. Collectively, these layout features facilitate comprehension of the internetwork topology by a user.
92 Citations
20 Claims
-
1. A method for efficiently organizing objects displayed on a screen of a network mapping tool, the method comprising the steps of:
-
generating a connected graph of linked objects within a network atlas of maps, each map comprising a logical page depicting a portion of an inter network computing system; organizing the connected graph on each logical page such that a collection of related ones of the linked objects is displayable on a window of the screen; and recovering blank space in said graph by minimizing a distance from a center of a parent node object to a center of an associated child node object while ensuring that none of said linked objects overlap each other, wherein an angular position of one linked object relative to another linked object in said graph is calculated by first calculating a first value calculated by dividing a diameter of the one linked object by a length of a connection between the one and the another linked objects, the angular position being based upon a second value calculated by adding to the first value a predefined value. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A method for efficiently organizing objects displayed on a screen of a network mapping tool, the method comprising the steps of:
-
generating a compact connected graph of linked objects within a network atlas of maps by configuring the connected graph as a hub-and-spoke arrangement along a spanning tree having at least one branch coupled to hub and spoke objects, each map comprising a logical page depicting a portion of an internetwork computing system; organizing the connected graph on each logical page by grouping the objects near neighboring objects with whom they share links, such that a collection of grouped objects is displayable on a window of the screen; recursively laying-out each branch of the spanning tree starting at a predetermined root node located at a mid-point of a longest path through the spanning tree; and recovering blank space in said graph by minimizing a distance from a center of a parent node object to a center of an associated child node object while ensuring that none of said linked objects overlap each other, wherein an angular position of one linked object relative to another linked object in said graph is calculated by first calculating a first value calculated by dividing a diameter of the one linked object by a length of a connection between the one and the another linked objects, the angular positions being based upon a second value calculated by adding to the first value a predetermined value. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification