Tessellated data visualization system

• US 9,465,891 B1
• Filed: 04/28/2016
• Issued: 10/11/2016
• Est. Priority Date: 04/29/2015
• Status: Active Grant

• Current Assignee: Data Cocoon LLC
• Original Assignee: Data Cocoon LLC
• Inventors: Kagan, Martin, Houlding, Gregory, Kagan, Whitney Lee
• Primary Examiner(s): Crawford, Jacinta M
• Assistant Examiner(s): Wills, Diane
• Application Number:
  US15/141,728
• Publication Number:
  US 20160321378A1
• Time in Patent Office: 166 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957
• CPC Class Codes: G06F 3/04815 Interaction with a metaphor-based environment or interaction object displayed as three-dimensional, e.g. changing the user viewpoint with respect to the environment or object
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 17/20 Finite element generation, e.g. wire-frame surface description, tesselation
• CPC Class Codes: G06T 17/30 Polynomial surface description

Abstract

A data visualization system and related methods may include generating a multi-dimensional graphical object, in which a tessellated arrangement of columns represents an underlying hierarchical data set. Parent-child relationships may be represented by adjacency of columns with respect to an X-Y plane. Magnitudes of underlying values and/or expressions may be represented by Z-axis heights of the columns.

Claims

1. A method, implemented in a data processing system, the method comprising:

receiving, using a data processing system, one or more elements of a data set;

identifying, using a processor of the data processing system, a plurality of hierarchical data nodes of the data set, each of the data nodes having an associated quantitative value, and one or more relationships between the data nodes, such that identifying the data nodes includes identifying a plurality of root nodes and one or more generations of child nodes;

generating, using the data processing system, a multi-dimensional graphical object illustrating the quantitative values of the data nodes and the one or more relationships between the data nodes;

wherein generating the graphical object includes;

representing the plurality of root nodes as a circular, edge-to-edge cluster of columns, each such root node column having a tessellatable cross-sectional shape;

representing, adjacent to a first root node of the plurality of root nodes, one or more first child nodes having the first root node as a parent, the one or more first child nodes represented as respective child node columns extending single file from one unoccupied edge of the first root node; and

setting a respective height of each root node column and of each child node column, such that the respective height corresponds to the quantitative value of the data node represented by the respective column; and

transmitting the graphical object for display.

2. The method of claim 1, wherein the circular, edge-to-edge cluster of root node columns defines an X-Y plane, the respective heights of each root node column being defined along a Z axis running orthogonal to the X-Y plane.

3. The method of claim 1, wherein the root node columns and the child node columns are represented isometrically.

4. The method of claim 1, wherein generating the graphical object further includes representing, adjacent to a first node of the first child nodes, one or more second child nodes having the first node as a parent, the one or more second child nodes represented as respective columns extending single file from one unoccupied edge of the first node.

5. The method of claim 4, wherein generating the graphical object further includes representing, adjacent to a second node of the first child nodes, one or more third child nodes having the second node as a parent, the one or more third child nodes represented as respective columns extending single file from one unoccupied edge of the second node, such that the third child nodes extend from the same relative edge of the second node as the second child nodes extend from the first node.

6. The method of claim 1, wherein the first child nodes each have the same cross-sectional shape as the root node columns.

7. The method of claim 1, wherein each of the root node columns is separated from adjacent root node columns by a gap.

8. The method of claim 1, wherein the tessellatable cross-sectional shape is a hexagon.

9. The method of claim 1, wherein receiving the one or more elements of the data set includes receiving data node relationship information.

10. A data processing system for visualizing hierarchical data, the system comprising:

a processor;

a memory; and

a visualization program including a plurality of instructions stored in the memory and executable by the processor to;

receive one or more elements of a data set;

identify a plurality of hierarchical data nodes of the data set, each of the data nodes having an associated quantitative value, and one or more relationships between the data nodes, such that identifying the data nodes includes identifying a plurality of root nodes and one or more generations of child nodes;

generate a multi-dimensional graphical object illustrating the quantitative values of the data nodes and the one or more relationships between the data nodes, wherein generating the graphical object includes instructions to;

represent the plurality of root nodes as a circular, edge-to-edge cluster of columns, each such root node column having a tessellatable cross-sectional shape;

represent, adjacent to a first root node of the plurality of root nodes, one or more first child nodes having the first root node as a parent, the one or more first child nodes represented as respective child node columns extending single file from one unoccupied edge of the first root node; and

set a respective height of each root node column and of each child node column, such that the respective height corresponds to the quantitative value of the data node represented by the respective column; and

transmit the graphical object for presentation on a display.

11. The system of claim 10, further including a display having a graphical user interface (GUI), the display being in communication with the processor such that the display is configured to receive the graphical object and present the graphical object in the GUI.

12. The system of claim 10, wherein the graphical object is transmitted for presentation over a data processing network.

13. The system of claim 10, wherein the circular, edge-to-edge cluster of root node columns defines an X-Y plane, the respective heights of each root node column being defined along a Z axis running orthogonal to the X-Y plane.

14. The system of claim 10, wherein the plurality of instructions are further executable by the processor to:

represent, adjacent to a first node of the first child nodes, one or more second child nodes having the first node as a parent, the one or more second child nodes represented as respective columns extending single file from one unoccupied edge of the first node.

15. The system of claim 14, wherein the plurality of instructions are further executable by the processor to represent, adjacent to a second node of the first child nodes, one or more third child nodes having the second node as a parent, the one or more third child nodes represented as respective columns extending single file from one unoccupied edge of the second node, such that the third child nodes extend from the same relative edge of the second node as the second child nodes extend from the first node.

16. The system of claim 10, wherein the first child nodes each have the same cross-sectional shape as the root node columns.

17. A computer program product for visualizing hierarchical data, the computer program product comprising

a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer readable program code configured to cause a data processing system to generate a graphical object, the computer readable program code comprising:

at least one instruction to identify a plurality of hierarchical data nodes of a data set, each of the data nodes having an associated quantitative value, and one or more relationships between the data nodes, such that identifying the data nodes includes identifying a plurality of root nodes and one or more generations of child nodes;

at least one instruction to generate a multi-dimensional graphical object illustrating the quantitative values of the data nodes and the one or more relationships between the data nodes, wherein generating the graphical object includes instructions to;

represent the plurality of root nodes as a circular, edge-to-edge cluster of columns, each such root node column having a tessellatable cross-sectional shape;

represent, adjacent to a first root node of the plurality of root nodes, one or more first child nodes having the first root node as a parent, the one or more first child nodes represented as respective child node columns extending single file from one unoccupied edge of the first root node; and

set a respective height of each root node column and of each child node column, such that the respective height corresponds to the quantitative value of the data node represented by the respective column; and

at least one instruction to transmit the graphical object for presentation on a display.

18. The computer program product of claim 17, the computer readable program code further comprising at least one instruction to represent, adjacent to a first node of the first child nodes, one or more second child nodes having the first node as a parent, the one or more second child nodes represented as respective columns extending single file from one unoccupied edge of the first node.

19. The computer program product of claim 18, the computer readable program code further comprising at least one instruction to represent, adjacent to a second node of the first child nodes, one or more third child nodes having the second node as a parent, the one or more third child nodes represented as respective columns extending single file from one unoccupied edge of the second node, such that the third child nodes extend from the same relative edge of the second node as the second child nodes extend from the first node.

20. The computer program product of claim 17, wherein receiving the one or more elements of the data set includes receiving data node relationship information.