JPH04309189A - Graph generating system - Google Patents

Abstract

PURPOSE:To display data editting them in a scale so as to easily recognize the fluctuation of values by displaying the data exceeding a rate set by a user as a void graph. CONSTITUTION:At a graph preparing device 3, a graph data input means 4 possesses data for graph output from an input device 1, a graph image generating means 5 prepares a graph image and a graph output means 6 outputs the graph image to an output device 2. At a central blanking symbol control device 7, a control part 8 controls the flow of the graph output. A data transforming means 9 transforms the data into the void data as needed and holds the data in an internal storage device 10. A central blanking symbol adding means 11 adds a void symbol to the void data in the internal storage device 10.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graph generation system, and more particularly to a graph generation system that outputs a graph using an electronic computer.

0002

2. Description of the Related Art FIG. 6 is a diagram showing an example of a comparison between a conventional graph and a hollow graph.

As shown in FIG. 6, input data 601 is
The number of shipments of six types of televisions at store A,
This is the data obtained by calculating the total. Then, when the conventional graph 602 produced by the conventional graph generation system is outputted as a graph of the input data 601, the graph display scale is set to '0' to match the total value of the maximum data.
' to '140'. For this reason, the fluctuations in the number of each television TV displayed on the graph become small, making it difficult to recognize them visually.If the user consciously adjusts the scale to the data of each television TV, the total must be displayed on a graph with a different scale.

0004

[Problems to be Solved by the Invention] In the case of the above-mentioned conventional graph generation system, in the case of data for which a total is required as shown in FIG. 6, the difference between each data value and the total value becomes larger as the number of data increases. As a result, fluctuations in each data cannot be recognized. In this way, when there is data with a large value among data with small values and little variation, conventional graph generation systems cannot visually recognize the variation in the data with small values. The problem is that the only way to do this is to unconsciously adjust the scale to large data and display it, or extract only data with large values and create a graph with a different scale.

The purpose of the present invention is to solve such problems as shown in FIG.
An object of the present invention is to provide a graph generation system that solves the problem using a hollow graph 603 shown in FIG.

[0006]

[Means for Solving the Problems] The graph generation system of the present invention includes an input device through which a user inputs source data for outputting a graph, an output device through which the graph is output, and a Graph data input means for controlling data input to obtain data necessary for graph output; graph image generation means for creating a graph image based on data converted to generate a hollow graph; The graph creation device includes a graph output means for controlling the output of a graph image to the device, a control section for controlling the flow of work related to graph output, and a control section for determining the occurrence of hollow processing from the data. a data conversion means that optimizes data and scale; an internal storage device that stores information regarding the data that has undergone the hollowing process; and a hollowed-out symbol in a graph image based on the information stored in the internal storage device. By providing a hollow symbol control device with a hollow symbol adding means for adding a hollow symbol, and when a data group to be displayed on a graph has a peculiar value, a graph of data with a peculiar value is displayed with a hollow symbol. It is configured.

[0007]

Embodiments Hereinafter, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of the graph generation system of the present invention that outputs a hollow graph. As shown in FIG. and an output device 2 that outputs a graph, a graph creation device 3, and a hollow symbol control device 7.

In this embodiment, upon receiving an instruction to output a graph from the user, the control section 8 of the hollow graph control device 7 performs the following operations.
The graph data input means 4 is called to extract only the data to be graphed from the data input by the user from the input device 1, and control is returned to the control unit 8. Then, the control unit 8 passes the extracted data to the data conversion means 9, checks the validity of the data and checks the occurrence of hollow processing, and if the hollow processing is necessary, changes the information with that information. The data is written to the internal storage device 10.

Next, the control section 8 passes the input data as is to the graph image generating means 5 if no hollow processing has occurred, and if hollow processing has occurred,
The graph image generating means 5 replaces the input data with the data changed based on the information in the internal storage device 10.
give it to Then, the graph image generation means 5 generates a graph image using a code for outputting a graph on the output device 2 based on the replaced data.

Next, if hollow processing has occurred, the control section 8 calls the hollow symbol adding means 11, adds the hollow symbol and its data value to the graph image, and outputs the graph image by adding the hollow symbol and its data value. Call 6. If no hollow processing has occurred, the graph output means 6 is called without calling the hollow symbol adding means 11. Then, the graph output means 6 actually outputs the graph to the output device 2 based on the graph image.

FIG. 2 is a flowchart showing an example of the operation of the control section in FIG. As shown in FIG. 2, the control unit first obtains data for outputting a graph using a graph data input means (STEP-201), and sorts the data in descending order (STEP-202). Based on this data, the data for which the hollowing process has occurred in the hollowing check process (STEP-203) is extracted and written to the internal storage device. Then, the flow of the process changes depending on whether or not hollow processing occurs (STEP-204), and if hollow processing occurs, only the data conversion means (STEP-205) and graph image generation means (STEP-208) Execute. Then, since the creation of the graph image to be output has been completed, the graph output means (STEP-209) is executed and the process ends.

FIG. 3 is a flowchart showing an example of the operation of the data conversion means in FIG. As shown in FIG. 3, the data conversion means reads the data to be hollowed out on the internal storage device (STEP-301), and processes the data to match the maximum scale of the data without hollowing out. Do it (STEP-302). Then, it is determined whether or not the data for which the hollowing process occurred still remains (STEP
-303), STEP-302 to STE until it runs out
Repeat the process of P-303. Note that when the processing of all the data that has undergone the hollowing process is completed, the data is written to the internal storage device (STEP-304) and the process ends.

FIG. 4 is a flow chart showing an example of the operation of the hollow symbol adding means shown in FIG. As shown in FIG. 4, the hollow symbol adding means performs a process (STEP-401) of adding a hollow symbol to a portion of the graph image created by the graph image generating means where hollow processing has occurred. .

FIG. 5 is a flowchart illustrating an example of the operation of the hollow check process shown in FIG. As shown in FIG. 5, the hollow check process reads the first data A(1), which is the largest data sorted in descending order (STEP-
501), then the comparison with the largest data, that is, the ratio
P-502). Next, read the second data A(2) (STEP-503), find the quotient with the first data A(1), and set it as the ratio Y of the second data A(2) (S
TEP-504). Then, subtract the ratio Y of the second data A (2) from the maximum ratio X to find the difference Z in the data ratio.
is calculated (STEP-505), and compared with the ratio M for performing hollow processing specified by the user (STEP-506).
), the first data A(1) is written to the internal storage device only when it is large (STEP-507). Then, replace the maximum ratio X, A (1) with the second ratio Y, A (2) (STEP-508), and read the next data (STEP-508).
EP-503). In this way, by repeating the processes from STEP-503 to STEP-508 until there is no more data, all the information about the data that has been hollowed out can be saved in the internal storage device.

[0016]

[Effects of the Invention] As explained above, the graph generation system of the present invention can generate data that exceeds the ratio set by the user.
Since the data and scale are processed and displayed as a hollow graph, it has the advantage that fluctuations in values are organized and displayed on a scale that is most easily recognized.

Moreover, the graph generation system of the present invention has the following features:
Since the data is recognized and the hollow display is automatically divided, the user can display an optimized graph without being aware of the data values.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of a graph generation system of the present invention.

FIG. 2 is a flowchart showing an example of the operation of the control section in FIG. 1;

FIG. 3 is a flowchart showing an example of the operation of the data conversion means in FIG. 1;

FIG. 4 is a flowchart showing an example of the operation of the hollow symbol adding means in FIG. 1;

FIG. 5 is a flowchart showing an example of the operation of the hollow check process shown in FIG. 2;

FIG. 6 is a diagram illustrating an example of a comparison between a conventional graph and a hollow graph.

[Explanation of symbols]

1 Input device 2 Output device 3 Graphing device 4 Graph data input means 5 Graph image generation means 6 Graph output means 7 Hollow symbol control device 8 Control section 9 Data conversion means 10 Internal storage device 11. Adding hollow symbols

Claims (1)

[Claims] [Claim 1] An input device for a user to input source data for outputting a graph, an output device for outputting the graph, and data necessary for outputting the graph by controlling data input to the input device. a graph data input means for obtaining a graph image, a graph image generation means for generating a graph image based on the data converted to generate the hollow graph, and a graph output for controlling output of the graph image to the output device. a control section for controlling the flow of work related to graph output; and a data conversion means for determining the occurrence of hollowing out from the data and optimizing the data and scale if it has occurred. ,
A hollow symbol includes an internal storage device that stores information regarding data that has undergone hollow processing, and a hollow symbol adding means that adds a hollow symbol to a graph image based on the information stored in the internal storage device. A graph generation system for a control device, characterized in that when a group of data to be displayed on a graph has a peculiar value, a graph of the data of the peculiar value is displayed with a hollow part.