Data visualization system and method
A data visualization system comprising: a data retrieval module arranged to retrieve data from a data storage module in communication with the data visualization system, wherein the retrieved data includes data sets for representation in a tree map; a tree map generation module arranged to generate a tree map based on the retrieved data, wherein the tree map generation module is further arranged to: i) sort the retrieved data sets according to the size of the data sets; ii) define an area for generating multiple rectangles, each rectangle representing one of the data sets, wherein the area is defined to allow the data sets to be spatially arranged within the area; iii) accumulate data points for data within the data sets to generate a rectangle that has dimensions that fall within pre-defined parameters; iv) generate a rectangle for each data set; and v) orientate the rectangle such that its orientation is only changed if the rectangle does not fit in the available area.
1. A data visualization system including a processor, the data visualization system further comprising:
a data retrieval module arranged to retrieve data from a data storage module in communication with the data visualization system, wherein the retrieved data includes data sets for representation in a tree map;
a tree map generation module arranged to generate a tree map based on the retrieved data, wherein the tree map generation module is further arranged to:
i) sort the retrieved data sets according to the size of the data sets;
ii) define an area for generating multiple rectangles, each rectangle representing one of the data sets, wherein the area is defined to allow the data sets to be spatially arranged within the area;
iii) generate a rectangle for each data set; and
iv) orientate the rectangle while maintaining the area of the rectangle such that its orientation is only changed if the rectangle does not fit in the available area.
2. The system of claim 1 , wherein the tree map generation module is further arranged to determine a total number of data points for all data sets being represented in the tree map.
3. The system of claim 1 , wherein the tree map generation module is further arranged to determine a number of set data points for each data set being represented in the tree map.
4. The system of claim 1 , wherein the tree map generation module is further arranged to arrange or sort data within each data set into data elements in a hierarchical order.
5. The system of claim 1 , wherein the tree map generation module is further arranged to determine a number of data element data points for each data element at each hierarchical level in the hierarchical order within each data set.
6. The system of claim 1 , wherein the tree map generation module is further arranged to define a bounding rectangle based on the total number of data points in all data sets, wherein the bounding rectangle is defined as having a determined size that accommodates the total number of data points and a determined ratio that falls within a pre-defined width:length ratio for bounding rectangles.
7. The system of claim 1 , wherein the tree map generation module is further arranged to define a first data set rectangle based on all data points in a first data set, wherein the first data set rectangle is defined as having a determined size that accommodates the total number of data points in the first data set and a determined ratio that falls within a pre-defined width:length ratio for data set rectangles.
8. The system of claim 1 , wherein the tree map generation module is further arranged to define a first data rectangle based on the data element data points for a first data element that is at the highest hierarchical level, wherein the first data rectangle is defined as having a determined size that accommodates the total number of data element data points for the first data element and a determined ratio that falls within a pre-defined width:length ratio for data rectangles.
9. The system of claim 1 , wherein the tree map generation module is further arranged to define a subsequent data rectangle based on data element data points for a subsequent data element that is one hierarchical level below the hierarchical level of the previously defined data rectangle, wherein the subsequent data rectangle is defined as having a determined size that accommodates the total number of data element data points for the subsequent data element and a determined ratio that falls within a pre-defined width: length ratio for data rectangles.
10. The system of claim 1 , wherein the orientation of the first or subsequent data rectangles is determined by whether the first or subsequent data rectangle fits within space available within the data set rectangle.
11. The system of claim 10 , wherein a first orientation associated with the previous data rectangle is maintained in the subsequent rectangle if the subsequent rectangle fits within the space available using the first orientation.
12. The system of claim 10 , wherein a second orientation opposite to a first orientation associated with the previous data rectangle is used in the subsequent rectangle if the subsequent rectangle does not fit within the space available using the first orientation.
13. The system of claim 1 , wherein the tree map generation module is further arranged to position the first data rectangle in the data set rectangle so that it is positioned such that two perpendicular sides of the data rectangle are aligned with two perpendicular sides of the data set rectangle.
14. The system of claim 1 , wherein the tree map generation module is further arranged to position the subsequent data rectangle in space that remains in the data set rectangle after placement of the previous data rectangle so that two perpendicular sides of the subsequent data rectangle are aligned with two perpendicular sides of the remaining space.
15. The system of claim 1 , wherein the tree map generation module is further arranged to position the first and subsequent data rectangles in the data set rectangle so that space that remains in the data set rectangle after placement has a rectangular shape.
16. A data visualization computer implemented method comprising the steps of a processor:
retrieving data from a data storage module in communication with a data visualization system, wherein the retrieved data includes data sets for representation in a tree map;
generating a tree map based on the retrieved data, wherein the tree map generation further comprises the steps of:
i) sorting the retrieved data sets according to the size of the data sets;
ii) defining an area for generating multiple rectangles, each rectangle representing one of the data sets, wherein the area is defined to allow the data sets to be spatially arranged within the area;
iii) generating a rectangle for each data set; and
iv) orientating the rectangle while maintaining the area of the rectangle such that its orientation is only changed if the rectangle does not fit in the available area.
17. The method of claim 16 , further comprising the step of determining a total number of data points for all data sets being represented in the tree map.
18. The method of claim 16 , further comprising the step of determining a number of set data points for each data set being represented in the tree map.
19. The method of claim 16 , further comprising the step of arranging or sorting data within each data set into data elements in a hierarchical order.
20. The method of claim 16 , further comprising the step of determining a number of data element data points for each data element at each hierarchical level hi the hierarchical order within each data set.
21. The method of claim 16 , further comprising the step of defining a bounding rectangle based on the total number of data points in all data sets, wherein the bounding rectangle is defined as having a determined size that accommodates the total number of data points and a determined ratio that falls within a pre-defined width:length ratio for bounding rectangles.
22. The method of claim 16 , further comprising the step of defining a first data set rectangle based on all data points in a first data set, wherein the first data set rectangle is defined as having a determined size that accommodates the total number of data points in the first data set and a determined ratio that falls within a pre-defined width:length ratio for data set rectangles.
23. The method of claim 16 , further comprising the step of defining a first data rectangle based on the data element data points for a first data element that is at the highest hierarchical level, wherein the first data rectangle is defined as having a determined size that accommodates the total number of data element data points for the first data element and a determined ratio that falls within a pre-defined width:length ratio for data rectangles.
24. The method of claim 16 , further comprising the step of defining a subsequent data rectangle based on data element data points for a subsequent data element that is one hierarchical level below the hierarchical level of the previously defined data rectangle, wherein the subsequent data rectangle is defined as having a determined size that accommodates the total number of data element data points for the subsequent data element and a determined ratio that falls within a pre-defined width: length ratio for data rectangles.
25. The method of claim 16 , wherein the orientation of the first or subsequent data rectangles is determined by whether the first or subsequent data rectangle fits within space available within the data set rectangle.
26. The method of claim 25 , wherein a first orientation associated with the previous data rectangle is maintained in the subsequent rectangle if the subsequent rectangle fits within the space available using the first orientation.
27. The method of claim 25 , wherein a second orientation opposite to a first orientation associated with the previous data rectangle is used in the subsequent rectangle if the subsequent rectangle does not fit within the space available using the first orientation.
28. The method of claim 16 , further comprising the step of positioning the first data rectangle in the data set rectangle so that it is positioned such that two perpendicular sides of the data rectangle are aligned with two perpendicular sides of the data set rectangle.
29. The method of claim 16 , further comprising the step of positioning the subsequent data rectangle in space that remains in the data set rectangle after placement of the previous data rectangle so that two perpendicular sides of the subsequent data rectangle are aligned with two perpendicular sides of the remaining space.
30. The method of claim 16 , further comprising the step of positioning the first and subsequent data rectangles in the data set rectangle so that space that remains in the data set rectangle after placement has a rectangular shape.