Method and apparatus for generating hierarchical displays

• US 4,613,946 A
• Filed: 06/07/1984
• Issued: 09/23/1986
• Est. Priority Date: 06/07/1984
• Status: Expired due to Term

• Current Assignee: Ernest H. Forman
• Original Assignee: Ernest H. Forman
• Inventors: Forman, Ernest H.
• Primary Examiner(s): NOT, DEFINED
• Application Number:
  US06/618,148
• Time in Patent Office: 838 Days
• Field of Search: 364/518, 364/521, 364/300, 340/720
• US Class Current: 715/853
• CPC Class Codes: G06T 17/005 Tree description, e.g. octree, quadtree

Abstract

Method and apparatus are described for drawing tree structures on output displays and on printed output reports. The tree structures include complete illustration of nodes and branches connecting the same, and further provides display or printing of data associated with the various nodes. The central node of the tree may be arbitrarily selected by redrawing the structure to focus on the root node of the tree or on the arbitrarily selected central node. For economic use of display space, a skeletal display may be provided in which only the nodes descendent from the central node of interest are shown with the associated data, the remaining nodes being displayed in skeletal format only. The tree structure may be applied to a descision making algorithm, and may be used to provide a number of alternatives useful for attaining a desired goal, and for evaluating the various alternatives.

Claims

1. A method for displaying information in a tree structure on a system having an input means, a display means and a control means comprising the steps of:

(a) providing from said input means to said control means input data representative of information associated with a root of the tree structure forming a 0^th node level therein;

(b) providing from said input means to said control means input data representative of nodes on a K^th level in the tree structure where K is an integer;

(c) receiving input data from said input means representative of a relationship between said nodes on said K^th level and nodes related thereto on a different level K+L where L is a nonzero integer;

(d) repeating steps (b) and (c) until information concerning all nodes for display on the K^th level has been provided to said control means;

(e) operating said control means to generate control data for controlling said display means to display the nodes of said K^th level and to display connections representing branches of said tree structure between said nodes and the nodes related thereto on said different level whereby any displayed node is displayed together with its related nodes;

(f) repeating steps (b) through (e) as necessary for successive values of K to represent a tree structure on said display means; and

(g) displaying said nodes of said tree levels and said branch connections between said nodes and said related nodes,

whereby a tree structure format is provided for displaying said input data.

2. A method as recited in claim 1 wherein said receiving step comprises a step of choosing L to be a positive integer for receiving data representative of descendent nodes of said nodes on said Kth level,

said operating step comprises the step of controlling said display means to display connections between said nodes and said descendent nodes on a subsequent level, and

said displaying step includes the step of displaying said nodes and said branch connections between said nodes and said descendent nodes.

3. A method as recited in claim 1 wherein said receiving step comprises a step of choosing L to be a negative integer for receiving data representative of antecedent nodes of said nodes on said Kth level,

said operating step comprises the step of controlling said display means to display connections between said nodes and said antecedent nodes on an earlier level, and

said displaying step includes the step of displaying said nodes and said branch connections between said nodes and said antecedent nodes.

4. A method as recited in claim 3 wherein step (b) comprises the step of providing literal information associated with said nodes on the K^th level.

5. A method as recited in claim 4 wherein step (g) comprises the step of displaying said literal information along with said nodes on said display means.

6. A method as recited in claim 3 wherein step (b) comprises the step of providing literal information associated with said nodes;

and comprising the further steps of;

providing input data from said input means to said control means indicative of a particular node on said K^th level to be displayed;

displaying, on a level K+M where M is a nonzero integer, descendent nodes of said particular node on said K^th level together with literal information associated therewith;

displaying antecedent nodes of said particular node on the K^th level in a skeletal format independent of any literal information; and

displaying connections between said particular node and said peer nodes, said descendent nodes, and said antecedent nodes thereof.

7. A method as recited in claim 6 comprising the further step of selecting M to equal 1.

8. A method as recited in claim 7 wherein said particular mode and said descendent nodes comprise the further step of displaying said literal information associated therewith immediately adjacent said particular node and said descendent nodes.

9. A method as recited in claim 8 wherein said step of displaying said antecedent and peer nodes comprises the further step of displaying literal information associated therewith in a display area remote from said antecedent and peer nodes.

10. A method as recited in claim 6 wherein said step of providing input data indicative of a particular node includes the step of providing an input signal for redrawing an existing prior display of a previously defined particular node, its peers, antecedents and descendents, and said steps of displaying antecedent, peer and descendent nodes comprise the step of replacing said prior display of said previously defined particularly node, its peers, antecedents and descendents and the connections therebetween with a display of a newly defined particular node, its antecedents, peers and descendents and connections therebetween.

11. A method for displaying a decision making algorithm on a computer activated display having an input means, a processing means and a display means, comprising the steps of:

(a) providing input data from said input means to said processing means representative of a target goal to be attained;

(b) providing input data from said input means to said processing means representative of factors significant in attaining the target;

(c) providing input data from said input means to said processing means representative of pairwise comparison of significance of each of the factors in attaining the target;

(d) assigning to each of said factors a numerical value based on pairwise comparisons of the significance thereof in accordance with a computation performed on the results of said pairwise comparisons;

(e) providing input data from said input means to said processing means representative of subfactors significant in each of said factors;

(f) for each factor, providing input data from said input means to said processing means representative of results of pairwise comparisons of significance of each of the subfactors for said factor;

(g) assigning to each of said subfactors a numerical value representative of a local significance thereof to an antecedent factor thereof to which it is significant in accordance with a computation performed on the results of said pairwise comparisons;

(h) repeating steps (e), (f) and (g) for sub-subfactors of said subfactors until all factors and subfactors of interest are accounted for;

(i) displaying on said display means a tree structure including a root, a plurality of nodes and branches connecting said nodes representing said target, factors, subfactors, subsubfactors and the like, and descendency relations between nodes on different levels, respectively.

12. A method as recited in claim 11 wherein said secondary step of assigning comprises the further step of assigning for display with said subfactors or the like represented in said display by a node a numerical value representative of a global significance thereof for attaining the target goal in accordance with a computation based on the local significance thereof and a global significance value of a factor reprsented by an antecedent node thereof.

13. A method as recited in claim 11 wherein said displaying step comprises the step of displaying at least one of said nodes on said display means of a K^th level of a tree, along with antecedent nodes on levels K-L is a nonzero integer, and descendent nodes thereof on levels K+M, where M is a nonzero integer, together with literal information descriptive thereof.

14. A method as recited in claim 13 further comprising the step of displaying at least some nodes on said tree structure in skeletal form including only nodes, branches, and antecedent nodes thereof, independently of literal information descriptive thereof.

15. A method as recited in claim 11 wherein said first assigning step comprises the further step of displaying verbal qualitative descriptions of pairwise relationships for selection and assignment of an appropriate one of said descriptions to the relationships between each pair of factors and between each pair of subfactors.

16. A method as recited in claim 11 comprising the further step of providing different numbers of subfactors for two of said factors.

17. In a method for executing on a programmed computer a process for selecting among a plurality of alternatives to achieve a desired goal, including performing pairwise comparisons among a plurality of criteria to obtain weighting factors for each of said criteria and, for each criterion, performing pairwise comparisons among said plural alternatives to obtain numerical values associated with each of said alternatives, and, based on said comparisons for each criterion, selecting an alternative having the highest numerical value, the improvement comprising:

a method for generating an output report including the steps of

(a) generating a node grouping having a plurality of nodes and branches arranged in a tree structure including a root node, corresponding to the desired goal, connected by a branching arrangement to at least one descendent node thereof corresponding to one of said criteria, the tree structure including a plurality of peer, antecedent and descendent relationships defined by the branching arrangement among the various nodes thereof,

(b) selecting a particular node as a central node for the report,

(c) providing complete data in association with said selected central node,

(d) providing complete data in association with descendent nodes of said selected central node,

(e) providing skeletal data, less than the complete data of said selected central node and said descendent nodes thereof in association with other nodes of the tree structure, and

(f) generating said output report to display a subset of said nodes and said branching arrangement of said tree structure, and to display complete data in association with said central node and said descendent nodes thereof and skeletal data in association with the other nodes of said tree structure,

whereby the report is generated with a tree structure in a skeletal form.

18. A method as recited in claim 17 wherein said first and second providing steps comprise the further step of providing identifying data, branching data and relative value data associated with said central node and the descendent nodes of said central node.

19. A method as recited in claim 17 wherein said third providing step comprises the steps of:

selecting, as said other nodes of the tree structure, peer nodes of said central node, antecedent nodes of said central node, and peer nodes of said selected antecedent nodes.

20. A method as recited in claim 19 wherein said third providing step comprises the step of providing only said branching data in association with said other nodes of the tree structure.

21. A method as recited in claim 17 wherein said second generating step comprises the step of displaying a transient output display of said skeletal tree structure on an output display means of said programmed computer.

22. A method as recited in claim 17 wherein said second generating step comprises the step of outputting a report, including said skeletal tree structure, to an output record medium.

23. A method as recited in claim 22 wherein said outputting step comprises the step of printing said report on a print carrying medium.

24. Apparatus for displaying information in a tree structure comprising an input means, a display means, and a control means connected to said input means and to said display means, said control means being programmed:

(a) for providing input data from said input means to said control means representative of information associated with a root of the tree structure forming a 0^th node level therein;

(b) for providing input data from said input means to said control means representative of nodes on a K^th level in the tree structure;

(c) for receiving input data from said input means representative of a relationship between said nodes on said K^th level and related nodes thereto on different levels K+L where L is a nonzero integer;

(d) for repeating steps (b) and (c) until information concerning all nodes for display on the K^th level has been provided to said control means;

(e) for operating said control means to generate control data for controlling said display means to display the nodes of said K^th level and to display connections representing branches of said tree structure between said nodes and the related nodes thereof on said different levels; and

(f) for displaying said nodes of said K^th level and connections between said nodes and said related nodes.

25. A method as recited in claim 24 wherein said control means is further programmed for choosing said integer L to be a negative integer,

for receiving input data representative of a relationship between said nodes on said Kth level and antecedent nodes thereof, and

for displaying said nodes of said Kth level and connections between said nodes and said antecedent nodes thereof.

26. A method as recited in claim 24 wherein said control means is further programmed for choosing said integer L to be a positive integer,

for receiving input data representative of a relationship between said nodes on said Kth level and descendent nodes thereof, and

for displaying said nodes of said Kth level and connections between said nodes and said descendent nodes thereof.