Data plot processing
First Claim
Patent Images
1. A method comprising:
- dividing, by one or more processors, a space of a data plot into subspaces, wherein each subspace contains at least one data point of the data plot;
computing, by one or more processors, a compressed information representation for each subspace of the data plot based on information about said at least one data point contained in said each subspace;
displaying, by one or more processors, the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot;
generating, by one or more processors, a compressed information representation from the information about said at least one data point contained in said each subspace;
determining, by one or more processors, if a size of the compressed information representation fits within a computed available area for said each subspace; and
in response to the compressed information representation failing to fit within the computed available area for said each subspace, further compressing, by one or more processors, the compressed information representation to generate a new compressed information representation.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. A compressed information representation for each subspace is computed based on information about said at least one data point contained in said each subspace. The data plot is displayed with the compressed information representation for said each subspace, where each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot.
11 Citations
17 Claims
-
1. A method comprising:
-
dividing, by one or more processors, a space of a data plot into subspaces, wherein each subspace contains at least one data point of the data plot; computing, by one or more processors, a compressed information representation for each subspace of the data plot based on information about said at least one data point contained in said each subspace; displaying, by one or more processors, the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot; generating, by one or more processors, a compressed information representation from the information about said at least one data point contained in said each subspace; determining, by one or more processors, if a size of the compressed information representation fits within a computed available area for said each subspace; and in response to the compressed information representation failing to fit within the computed available area for said each subspace, further compressing, by one or more processors, the compressed information representation to generate a new compressed information representation. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer program product for processing a data plot comprising a plurality of data points for inclusion of additional information content, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
-
dividing a space of a data plot into subspaces, wherein each subspace contains at least one data point of the data plot; computing a compressed information representation for each subspace of the data plot based on information about said at least one data point contained in said each subspace, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell; displaying the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot; determining a maximum size of the label that can be fitted within a circle that is bound by the particular Voronoi cell on the display; and in response to determining that the label for the multiple data points in the particular Voronoi cell cannot be fitted within the circle, compressing the label to create a lossy label that does not describe all information found in the compressed information representation. - View Dependent Claims (12, 13, 14)
-
-
15. A computer system comprising one or more processors, one or more computer readable memories, and one or more computer readable non-transitory storage mediums, and program instructions stored on at least one of the one or more computer readable non-transitory storage mediums for execution by at least one of the one or more processors via at least one of the one or more computer readable memories, the stored program instructions executed to perform a method comprising:
-
dividing a space of a data plot into subspaces, wherein each subspace contains at least one data point of the data plot; computing a compressed information representation for each subspace of the data plot based on information about said at least one data point contained in said each subspace, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell; displaying the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed, on a display, adjacent to a corresponding group of data points from the data plot; determining a maximum size of the label that can be fitted within a circle that is bound by the particular Voronoi cell on the display; and in response to determining that the label for the multiple data points in the particular Voronoi cell cannot be fitted within the circle, compressing the label to create a lossy label that does not describe all information found in the compressed information representation. - View Dependent Claims (16, 17)
-
Specification