System and method for browsing hierarchically based node-link structures based on an estimated degree of interest
First Claim
1. A method for displaying hierarchically linked information, said hierarchically linked information comprised of a plurality of nodes each having one or more links to other of said plurality of nodes, said method comprising the steps of:
- a) dynamically identifying a focus node for any of said plurality of nodes;
b) generating a degree of interest (DOI) value for each of said plurality of nodes, said degree of interest value relative to said focus node and sibling order distance from the focus node and corresponding to a node size;
c) laying out said plurality of nodes positioned based on associated links and sized based on associated degree of interest values in a tree structure;
d) identifying and performing any node compression necessary for boundedly displaying said hierarchically linked information based on the layout of said plurality of nodes; and
e) displaying said hierarchically linked information based on the layout of said plurality of nodes and node compression on a display area.
0 Assignments
0 Petitions
Accused Products
Abstract
Method and system to enable a user to view large collections of hierarchically linked information on a computer based display. A tree structure visualization is created which presents a representation of the complete collection of information on the display. The visualization fits completely within a fixed area of the computer based display, negating the need to scroll information into the display area. The visualization is based on identified focus nodes and through calculation of a Degree of Interest (DOI) for each of the nodes based in the structure. Layout and presentation of the visualization structure is based on the DOI values in combination with considerations of available display space. A user may dynamically manipulate views of the structure by selecting one or more focus nodes, thus causing a recalculation of the degree of interest.
155 Citations
26 Claims
-
1. A method for displaying hierarchically linked information, said hierarchically linked information comprised of a plurality of nodes each having one or more links to other of said plurality of nodes, said method comprising the steps of:
-
a) dynamically identifying a focus node for any of said plurality of nodes;
b) generating a degree of interest (DOI) value for each of said plurality of nodes, said degree of interest value relative to said focus node and sibling order distance from the focus node and corresponding to a node size;
c) laying out said plurality of nodes positioned based on associated links and sized based on associated degree of interest values in a tree structure;
d) identifying and performing any node compression necessary for boundedly displaying said hierarchically linked information based on the layout of said plurality of nodes; and
e) displaying said hierarchically linked information based on the layout of said plurality of nodes and node compression on a display area. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25)
-
-
11. System for browsing a collection of hierarchically linked data comprising:
-
display means having a display area for presenting views of a visualization of said collection of hierarchically linked data;
input device for providing input to change view of said visualization of said collection of linked data based on dynamically selected linked data; and
visualization processing element coupled to said display means and said input device, said visualization for creating a bounded tree structure visualization of said collection of hierarchically linked data based on a Degree of Interest relative to said focus node and sibling order distance from the focus node and a size of said display area. - View Dependent Claims (12, 13)
-
-
14. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for displaying hierarchically linked information, said hierarchically linked information comprised of a plurality of nodes each having one or more links to other of said plurality of nodes, said method comprising the steps of:
-
a) dynamically identifying a focus node for any of said plurality of nodes;
b) generating a degree of interest (DOI) value for each of said plurality of nodes, said degree of interest value relative to said focus node and sibling order distance from the focus node and corresponding to a node size;
c) laying out said plurality of nodes positioned based on associated links and sized based on associated degree of interest values in a tree structure;
d) identifying and performing any node compression necessary for boundedly displaying said hierarchically linked information based on the layout of said plurality of nodes; and
e) displaying said hierarchically linked information based on the layout of said plurality of nodes and node compression on a display area.
-
-
26. A method for displaying hierarchically linked information, said hierarchically linked information comprised of a plurality of nodes each having one or more links to other of said plurality of nodes, said method comprising the steps of:
-
dynamically identifying at least two focus nodes from any of said plurality of nodes;
generating a degree of interest (DOI) value for each of said plurality of nodes, said degree of interest value relative to the at least two focus nodes and to the sibling order distance from the at least two focus nodes and corresponding to a node size;
laying out said plurality of nodes positioned based on associated links and sized based on associated degree of interest values in a tree structure;
identifying and performing any node compression necessary for boundedly displaying said hierarchically linked information based on the layout of said plurality of nodes; and
displaying said hierarchically linked information based on the layout of said plurality of nodes and node compression on a display area.
-
Specification