US6067093A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for organizing objects of a network map
Assignee: Oracle International Corp
•
Filing: 1996-08-14
•
Granted: 2000-05-23
•
Expires: 2016-08-14
Abstract
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.
Inventors
- 👤 Stephen H. Grau
- 👤 Stephen Bostock
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 16:55
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/12; G; G06; G06T; G06T11/00; G06T11/20; G06T11/26; H04L41/22
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
182 words
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.
Claim 2
Independent Claim
182 words
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.
Claim 3
Dependent Claim
22 words
The method of claim 1 wherein the step of generating comprises the step of configuring the connected graph as a hub-and-spoke arrangement.
Claim 4
Dependent Claim
25 words
The method of claim 2 wherein the step of organizing comprises the step of grouping the objects near neighboring objects with whom they share links.
Claim 5
Dependent Claim
27 words
The method of claim 3 wherein the step of configuring comprises the step of constructing a sparing tree having at least one branch for the connected graph.
Claim 6
Dependent Claim
28 words
The method of claim 4 wherein the step of constructing comprises the step of recursively laying-out each branch of the spanning tree starting at a predetermined root node.
Claim 7
Dependent Claim
23 words
The method of claim 5 wherein the predetermined root node is located at a mid-point of a longest path through the spanning tree.
Claim 8
Dependent Claim
29 words
The method of claim 6 wherein the step of grouping further comprises the step of grouping old leaf nodes with a parent node to form a new leaf node.
Claim 9
Dependent Claim
40 words
The method of claim 7 wherein the parent node is located at a center of the new leaf node as a hub node and the old leaf nodes are arranged as spokes along a circular arc surrounding the hub node.
Claim 10
Dependent Claim
45 words
The method of claim 8 wherein the step of recursively laying-out each branch further comprises the steps of: determining whether each hub node has neighbors; and one of if so, creating a new hub object; and if not, returning a pointer to the hub node.
Claim 11
Dependent Claim
42 words
The method of claim 9 wherein the step of recursively laying-out each branch further comprises the steps of: calling a layout member function for each new hub object; and adding the returned pointer to a spoke list of the new hub object.
Claim 12
Dependent Claim
59 words
The method of claim 10 wherein the step of recursively laying-out each branch further comprises the step of determining an initial length of a spoke by choosing the larger of one of (i) a sum of radii of all leaf nodes divided by π and (ii) a sum of radii of a largest leaf node and its hub node.
Claim 13
Dependent Claim
40 words
The method of claim 11 wherein the step of recursively laying-out each branch further comprises the step of calculating a sector angle for each spoke and leaf object by dividing the diameter of the leaf by the initial spoke length.
Claim 14
Dependent Claim
35 words
The method of claim 12 wherein the step of calculating a sector angle comprises the step of setting an angle of the spoke according to the position of the neighbor spoke and the sector angle.
Claim 15
Dependent Claim
30 words
The method of claim 13 wherein the step of configuring comprises the step of saving cartesian coordinates of each node as attributes in an anchor object associated with each node.
Claim 16
Independent Claim
240 words
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.
Claim 17
Independent Claim
240 words
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.
Claim 18
Dependent Claim
22 words
The method of claim 15 further comprising the step of setting positions of each hub and spoke object on each logical page.
Claim 19
Dependent Claim
26 words
The method of claim 16 wherein the step of setting comprises the step of placing the spoke objects along an exterior side of the hub object.
Claim 20
Dependent Claim
36 words
The method of claim 17 wherein the step of setting further comprises the step of arranging the spoke objects so that larger objects are closer to a center of the exterior side of the hub object.
Claim 21
Dependent Claim
39 words
The method of claim 18 wherein the step of setting further comprises the step of shortening the length of each spoke to a point where a leaf object contacts radial lines of a sector allocated to the leaf object.
Claim 22
Dependent Claim
30 words
The method of claim 19 wherein the step of shortening comprises shortening the length of each spoke to a point where a respective leaf object almost overlaps a grandparent node.
References Cited (Backward Citations)
US4833592A
Cited
US5247517A
Cited
US5276789A
Cited
US5226120A
Cited
US5295244A
Cited
US5394522A
Cited
US5412772A
Cited
US5504863A
Cited
US5619632A
Cited
US5572640A
Cited
US5715432A
Cited
US5684967A
Cited
US5751965A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-05-23 | 2003-11-22 | 2004-05-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-05-23 | 2007-11-22 | 2008-05-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-05-23 | 2011-11-22 | 2012-05-23 | $7700.00 | Window Closed / Lapsed |