Method and apparatus for graphically representing information stored in electronic media

• US 5,987,469 A
• Filed: 05/13/1997
• Issued: 11/16/1999
• Est. Priority Date: 05/14/1996
• Status: Expired due to Fees

• Current Assignee: Micro Logic Corp.
• Original Assignee: Micro Logic Corp.
• Inventors: Lewis, Nancy J., Lewis, James D., Librach, Eran, Reznik, Bogdan N., Bonnet, Bryce H.
• Primary Examiner(s): Lintz, Paul R.
• Assistant Examiner(s): MILLS, JOHN G
• Application Number:
  US08/855,553
• Time in Patent Office: 917 Days
• Field of Search: 707/100, 707/200, 707/104
• US Class Current: 1/1
• CPC Class Codes: G06F 16/168 Details of user interfaces specifically adapted to file systems, e.g. browsing and visualisation, 2d or 3d GUIs query results presentation G06F16/156
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A method and apparatus is provided for displaying nested rectangles which graphically illustrate the directories and files located in a storage medium such a computer hard disk drive or the nodes of a tree data structure. The sizes of the rectangles are proportional to the size of the directory or file they represent, and the rectangles are nested in a recursive manner in accordance with the branch structure of the directories and files on the storage media. Preferably, the dimensions of the rectangles are chosen to maximize the number of rectangles, especially those capable of displaying the names of the directories and files. Yet further, the invention preferably assigns colors to the rectangles based upon certain criteria and suppresses directories or files from being shown if their rectangles will be too small to be accurately perceived.

Claims

1. A computer implemented method of displaying information stored in a tree data structure stored in a computer storage medium, comprising:

(a) providing a tree data structure comprising nodes, said data structure having a relationship whereby any one node may contain one or more other nodes, each said node having a numerical quantity associated with a node, whereby said numerical quantity associated with said node is proportional to the amount of space occupied on said computer storage medium,

(b) providing a parent node in said data structure,

(c) providing a child node in said data structure, said child node being contained in said parent node,

(d) displaying said parent node on an output medium as a parent shape having a height, width and area, the area of said parent shape being proportional to the numerical quantity associated with said parent node,

(e) displaying said child node on an output medium as a child shape having a height, width and area, the area of said child shape being proportional to the numerical quantity associated with said child node, and

(f) said height of said child shape being less than said height of said parent shape and said width of said child shape being less than said width of said parent shape.

2. The method of claim 1 wherein said nodes represent directories and files stored on a computer storage medium and said numerical quantity associated with a node is proportional to the amount of space occupied by the associated directory or file on said computer storage medium.

3. The method of claim 1 wherein said nodes represent links to sites on a network.

4. The method of claim 3 wherein said network is the World Wide Web, said nodes represent web pages containing links to other web pages, the numerical quantities of nodes without children are equal to one another, and the numerical quantity of nodes with children is equal to the sum of the numerical quantities of the nodes contained by the node with children.

5. A computer implemented method of displaying information stored in a tree data structure stored in a computer storage medium, comprising:

(a) providing a tree data structure comprising nodes, said data structure having a relationship whereby any one node may contain one or more other nodes, each said node having a numerical quantity associated with a node, whereby said numerical quantity associated with said node is proportional to the amount of space occupied on said computer storage medium,

(b) providing a parent node in said data structure,

(c) providing a child node in said data structure, said child node being contained in said parent node,

(d) displaying said parent node on an output medium as a parent shape having a height, width and area, the area of said parent shape being proportional to the numerical quantity associated with said parent node,

(e) assigning a portion of said parent shape, at least a portion of said assigned portion for displaying a shape associated with said child node,

(f) determining whether the width of said assigned portion is greater than a first predetermined amount and less than a second predetermined amount,

(g) if said width of said assigned portion is less than a first predetermined amount or greater than a second predetermined amount, then displaying said child node on an output medium using a binary display method, and

(h) said binary display method comprising displaying said child node as a child shape within said assigned portion, said child shape having a height, width and area, the area of said child shape being proportional to the numerical quantity associated with said child node and said height of said child shape being less than said height of said parent shape and said width of said child shape being less than said width of said parent shape.

6. The method of claim 5 wherein said medium is a computer storage medium, said nodes represent directories or files, and said numerical quantity associated with a node is proportional to the amount of space occupied by the associated directory or file on said computer storage medium.

7. The method of claim 5 wherein the width of said assigned portion is about equal to the width of said parent shape and the height of said assigned portion is less than the height of said parent shape.

8. The method of claim 7 wherein if said width of said assigned portion is greater than said first predetermined amount and less than said second predetermined amount, then said method further comprises displaying said child node on an output medium using a booking display method, said booking display method comprising displaying said child node on an output medium as a child shape having a height, width and area equal to the height, width and area of said assigned portion.

9. The method of claim 8 wherein said step of determining whether the width of said assigned portion is greater than said first predetermined amount and less than said second predetermined amount comprises

(a) providing a text shape having a width,

(b) computing an expanded shape having a width larger than the width of said text shape,

(c) determining whether the width of said text shape is less than the width of said assigned portion,

(d) determining whether the width of said expanded shape is greater than the width of said assigned portion.

10. The method of claim 9 wherein the width of said expanded shape is about 1.5 times the width of said text shape.

11. The method of claim 5 wherein, if the width of said assigned portion is less than a first predetermined amount or greater than a second predetermined amount, then said binary method further comprises dividing said assigned portion into a first group shape and a second group shape each having a width, height and area, such that said width of said group shapes is less than said width of said assigned portion and said height of said groups shapes is about equal to said height of said assigned portion and displaying said child shape in one of said group shapes.

12. The method of claim 11 wherein said data structure further comprises a secondary node contained in said parent node but not contained in said child node, and further comprising displaying a shape associated with said secondary node in said second group shape.

13. The method of claim 12 further comprising

providing additional nodes contained in said parent node but not contained in said child node or secondary node,

allocating each of said child, secondary and additional nodes into a first group or second group such that the smallest numerical quantity associated with a node in said first group is greater than the largest numerical quantity associated with a node in said second group, and

displaying said nodes of said first group as shapes in said first group rectangle and displaying said nodes of said second group as shapes in said second group rectangle.

14. The method of claims 5, 6, 8 and 13 wherein said shape is rectangular.

15. The method of claim 5 wherein said child shape is only displayed if said height and width of said child is greater than a minimum amount.

16. The method of claim 5 further comprising displaying text describing said parent node in said parent shape and displaying text describing said child node in said child shape.

17. The method of claim 16 wherein said text describes the name of a directory or file associated with said node.

18. The method of claim 16 wherein said text describing said parent node is displayed vertically within said parent shape.

19. The method of claim 16 wherein said text describing said parent node is displayed horizontally within said parent shape.

20. The method of claim 5 wherein said output medium is a computer screen.

21. The method of claim 20 wherein said height represents a vertical distance on said output medium.

22. The method of claim 20 wherein said height represents a horizontal distance on said output medium.

24. The method of claim 5 wherein said steps of displaying further comprises displaying said shapes as colors dependent upon an attribute of the node.

25. The method of claim 24 wherein said color of a shape associated with a particular node is dependent upon how many nodes contain said particular node.

23. The method of claim S wherein substantially all of said nodes of said structure are displayed as shapes by recursively repeating said steps of said method as if each node containing other nodes is said parent node.

26. A computer implemented method of displaying parent directories or files and child directories or files contained on a storage medium, whereby said child directories are contained within said parent directories, said method comprising:

(a) providing a computer screen having a resolution for displaying information stored in a tree data structure;

(b) displaying said parent directories in said tree data structure as rectangles, the area of each rectangle being proportional to the amount of space on the storage medium occupied by the associated parent directory;

(c) displaying said child directories in said tree data structure as rectangles, the area of each rectangle being proportional to the amount of space on the storage medium occupied by the associated child directory, and displaying the rectangles of said child directories within said rectangles of the parent directories which contain the child directories, and

(d) calculating the height and width of said rectangles so as to maximize the number of rectangles which can be displayed on said computer screen.