# US 2019/0318531 A1 · Data plot processing > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0318531 A1 - Document ID: US20190318531A1 - Status: Published application - Kind: A1 - Application number: 16/453,307 - Filed: 2019-06-26 - Published: 2019-10-17 - Earliest claimed: 2012-08-15 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: THOMAS BAUDEL; ALBERTUS H. J. BROEKSEMA - Web page: https://patentgrep.com/patent/US20190318531A1 ## CPC - G06T 11/00: Two-dimensional [2D] image generation - G06F 18/213: Feature extraction, e.g. by transforming the feature space; Summarisation; Mappings, e.g. subspace methods - G06F 18/2413: based on distances to training or reference patterns - G06T 15/10: Geometric effects - G06T 19/00: Manipulating three-dimensional [3D] models or images for computer graphics - G06T 2219/004: Annotating, labelling - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## 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. ## Claims ### Claim 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; and 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. ### Claim 2 (depends on 1) The method of claim 1, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the method further comprises: determining, by one or more processors, 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, by one or more processors, the label to create a lossy label that does not describe all information found in the compressed information representation. ### Claim 3 (depends on 1) The method of claim 1, further comprising: in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merging, by one or more processors, said smaller subspace with a neighboring subspace. ### Claim 4 (depends on 3) The method of claim 3, further comprising: identifying, by one or more processors, subspaces that have a size smaller than the predetermined value; and merging, by one or more processors, the subspaces determined to have the size smaller than the predetermined value with neighboring subspaces, wherein an order of merging subspaces is based on a size of the subspaces to be merged. ### Claim 5 (depends on 4) The method of claim 4, wherein the subspaces are merged in order of ascending size. ### Claim 6 (depends on 1) The method of claim 1, further comprising: in response to a separation of two data points in the data plot being less than a predetermined value, merging, by one or more processors, the two data points into a new merged data point; and defining and displaying, by one or more processors, a merged data point subspace in the space, wherein the merged data point subspace contains the new merged data point. ### Claim 7 (depends on 1) The method of claim 1, further comprising: 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. ### Claim 8 (depends on 7) The method of claim 7, further comprising: determining, by one or more processors, if repetition exists within the information about the multiple data points contained in said each subspace and, if repetition is determined to exist, representing the repeated information with a single object in the compressed information representation, the single object indicating a number of repetitions of the repeated information. ### Claim 9 (depends on 7) The method of claim 7, further comprising: determining, by one or more processors, if information within the information about said at least one data point contained in said each subspace shares a common attribute; and in response to determining that information within the information about said at least one data point contained in said each subspace shares the common attribute, representing, by one or more processors, the information that shares the common attribute in the compressed information representation. ### Claim 10 (depends on 7) The method of claim 7, further comprising: editing, by one or more processors, the compressed information representation to be smaller in size by reducing an amount of information displayed by the compressed information representation. ### Claim 11 (depends on 7) The method of claim 7, further comprising: determining, by one or more processors, a quantity of data points contained in said each subspace; and editing, by one or more processors, the compressed information representation so that said compressed information representation represents a determined number of data points contained in said each subspace. ### Claim 12 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; and 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. ### Claim 13 (depends on 12) The computer program product of claim 12, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the method further comprises: 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. ### Claim 14 (depends on 12) The computer program product of claim 12, wherein the method further comprises: in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merging said smaller subspace with a neighboring subspace. ### Claim 15 (depends on 12) The computer program product of claim 12, wherein the method further comprises: in response to a separation of two data points in the data plot being less than a predetermined value, merging the two data points into a new merged data point. ### Claim 16 (depends on 12) The computer program product of claim 12, wherein the method further comprises: generating the compressed information representation from the information about said at least one data point contained said each subspace; determining 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 the compressed information representation to generate a new compressed information representation. ### Claim 17 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; and 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. ### Claim 18 (depends on 17) The computer system of claim 17, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the method further comprises: 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. ### Claim 19 (depends on 17) The computer system of claim 17, wherein the method further comprises: in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merging said smaller subspace with a neighboring subspace. ### Claim 20 (depends on 19) The computer system of claim 19, wherein the method further comprises: identifying subspaces that have a size smaller than the predetermined value; and merging the subspaces determined to have the size smaller than the predetermined value with neighboring subspaces, wherein an order of merging subspaces is based on a size of the subspaces to be merged.