Displaying arbitrary relationships in a tree-map visualization
View Patent ↗A treemap visualization system can include a treemap configured to visualize a set of nodes. The treemap visualization system also can include an event handler programmed to process a proximity event associated with a specific portion of the treemap. The event handler can process the proximity event by visually coupling selected nodes which are inter-related to a node associated with the proximity event. The system further can include logic for displaying a direction for each inter-relationship between the selected nodes and the node associated with the proximity event. In this regard, the proximity event can include a mouse-over event, a mouse-click event, and a keyboard selection event.
1. A method, within a treemap visualization hardware system, for presenting inter-related nodes in a treemap, the treemap comprising hierarchical information to a rectangular 2-D display in a space-filling manner in which the entirely of a designated display space is utilized, the method comprising the steps of:
detecting, by the treemap visualization hardware system, a proximity event about a representation for a node in the treemap;
determining through said representation at least one inter-related node; and,
highlighting said nodes and drawing a linkage in said treemap between said nodes.
2. The method of claim 1 , further comprising the steps of:
determining a directionality for said inter-related node; and,
visually indicating said directionality in said treemap.
3. The method of claim 2 , wherein said step of visually indicating comprises the step of drawing said linkage with arrowheads to indicate said directionality.
4. The method of claim 1 , wherein said detecting step comprises the step of receiving a mouse-over event in an event handler for the treemap.
5. The method of claim 1 , wherein said detecting step comprises the step of receiving a mouse-over event in an event handler for said representation about which said proximity event is detected.
6. The method of claim 1 , wherein said detecting step comprises the step of receiving a mouse-click event in an event handler for the treemap.
7. The method of claim 1 , wherein said detecting step comprises the step of receiving a mouse-click event in an event handler for said representation about which said proximity event is detected.
8. The method of claim 1 , further comprising the step of repeating said detecting, determining, highlighting and drawings steps for a selected group of nodes determined to be inter-related to said node for which a proximity event has been detected.
9. The method of claim 8 , wherein said repeating step is limited to those nodes which are within a specified number of generations from said node for which said proximity event has been detected.
10. The method of claim 8 , wherein said repeating step is performed for all inter related nodes if a number of inter-relationships falls below a pre-specified threshold value.
11. A treemap, the treemap comprising hierarchical information to a rectangular 2-D display in a space-filling manner in which the entirely of a designated display space is utilized, visualization hardware system comprising:
a treemap configured to visualize a set of nodes; and a processor including an event handler programmed to process a proximity event associated with a specific portion of said treemap by visually coupling selected nodes which are interrelated to a node associated with said proximity event.
12. The system of claim 11 , further comprising logic for displaying a direction for each inter-relationship between said selected nodes and said node associated with said proximity event.
13. The system of claim 11 , wherein said proximity event is selected from the group consisting of a mouse-over event, a mouse-click event, and a keyboard selection event.
14. A machine readable storage having stored thereon a computer program for presenting inter-related nodes in a treemap, the treemap comprising hierarchical information to a rectangular 2-D display in a space-filling manner in which the entirely of a designated display space is utilized, the computer program comprising a routine set of instructions for causing the machine to perform the steps of:
detecting a proximity event about a representation for a node in the treemap;
determining through said representation at least one inter-related node; and, highlighting said nodes and drawing a linkage in said treemap between said nodes.
15. The machine readable storage of claim 14 , further comprising the steps of:
determining a directionality for said inter-related node; and,
visually indicating said directionality in said treemap.
16. The machine readable storage of claim 15 , wherein said step of visually indicating comprises the step of drawing said linkage with arrowheads to indicate said directionality.
17. The machine readable storage of claim 14 , wherein said detecting step comprises the step of receiving a mouse-over event in an event handler for the treemap.
18. The machine readable storage of claim 14 , wherein said detecting step comprises the step of receiving a mouse-over event in an event handler for said representation about which said proximity event is detected.
19. The machine readable storage of claim 14 , wherein said detecting step comprises the step of receiving a mouse-click event in an event handler for the treemap.
20. The machine readable storage of claim 14 , wherein said detecting step comprises the step of receiving a mouse-click event in an event handler for said representation about which said proximity event is detected.
21. The machine readable storage of claim 14 , further comprising the step of repeating said detecting, determining, highlighting and drawings steps for a selected group of nodes determined to be inter-related to said node for which a proximity event has been detected.
22. The machine readable storage of claim 21 , wherein said repeating step is limited to those nodes which are within a specified number of generations from said node for which said proximity event has been detected.
23. The machine readable storage of claim 21 , wherein said repeating step is performed for all inter-related nodes if a number of inter-relationships falls below a pre-specified threshold value.