JP7118194B1 - Graph generation device, graph generation method, and computer program - Google Patents

Abstract

An object of the present invention is to provide a graph in which important data is less likely to be overlooked than in the past while maintaining the speed of graphing. A graph drawing device (1) includes a grouping processing unit (203) that classifies voltage values included in a table (61) into groups corresponding to measured time periods, and a maximum voltage value and a minimum voltage value from each group. and a group line segment drawing that draws a line segment connecting the maximum voltage value and the maximum voltage value selected from each group at a position corresponding to each group in the graph area. A section 206 is provided. [Selection drawing] Fig. 3

Description

The present invention relates to technology for generating graphs of data such as tables.

Spreadsheet applications have the ability to graph data. When the capability of the arithmetic unit improves, the time required for graphing (required time) is shortened. However, as memory capacity increases, the size of data that can be graphed also increases. Therefore, it is required to shorten the required time without depending on the capability of the arithmetic unit.

Conventionally, the following techniques have been proposed as techniques for shortening the required time. The graph display device includes a representative data generation unit that generates representative data representative of data for each predetermined period based on data collected from equipment arranged in the plant, and a data generator that generates the representative data. A variation information generation unit that generates variation information, a graph display unit that displays a line graph in which representative data are arranged in chronological order, and a selection detection unit that detects a selection operation on any part of the line graph. , the graph display unit displays the variation information corresponding to the representative data in the period to which the detected point belongs in a manner distinguishable from the line graph (Patent Document 1).

JP 2018-169935 A

According to the conventional technique as described in Patent Document 1, graphing can be performed faster than when all the collected data is plotted. However, according to the conventional technology, it is easy to overlook important data.

SUMMARY OF THE INVENTION In view of such problems, it is an object of the present invention to provide a graph in which important data are less likely to be overlooked than in the past while maintaining the speed of graphing.

A graph generation device according to one aspect of the present invention generates a graph representing all or part of target data having multiple sets of explanatory variables and objective variables, and a first axis representing the explanatory variables and the objective variables. A graph generating device for generating a graph in a coordinate system having a second axis, comprising: classifying means for classifying the objective variables of the plurality of sets into a plurality of sections in the direction of the first axis; and the plurality of sections A selection means for selecting one maximum value and one minimum value from the set of objective variables classified respectively; generating means for generating the graph by arranging a line connecting a value and the minimum value in the interval but not arranging a second line connecting each of two adjacent intervals among the plurality of intervals ; have

A graph generation device according to another aspect of the present invention generates a graph representing all or part of target data having a plurality of sets of explanatory variables and objective variables, with a first axis representing the explanatory variables and the objective variables. a graph generating device for generating a graph in a coordinate system having a second axis representing the plurality of sets, wherein the classification means classifies the objective variables of the plurality of sets into a plurality of intervals in the direction of the first axis; A selection means for selecting one maximum value and one minimum value from the set of objective variables classified into each of the intervals, and for each of the plurality of intervals, the selected as a first line representing the value in the interval A line that connects the maximum value and the minimum value is arranged in the section, and a second line that connects two sections that are adjacent to each other among the plurality of sections is used as the first line of the two sections. generating means for generating the graph by arranging a line connecting the last objective variable among the objective variables classified into intervals and the first objective variable among the objective variables classified into subsequent intervals ; and have

A graph generation device according to another aspect of the present invention generates a graph representing all or part of target data having a plurality of sets of explanatory variables and objective variables, with a first axis representing the explanatory variables and the objective variables. Nw subregions of Nh pixels aligned parallel to the second axis of a coordinate system having a second axis representing a generating device comprising: classifying means for classifying the objective variables of each of the plurality of sets into Nw sections in the first axis direction; Among the pixels, pixels corresponding to each of the objective variables classified into the interval are specified, and a point is placed once for each of the specified pixels, but two adjacent intervals among the Nw intervals are specified. generating means for generating said graph by not arranging lines connecting them.

According to the present invention, it is possible to provide a graph in which important data are less likely to be overlooked than in the past while maintaining the speed of graphing.

1 is a diagram showing an example of a network system including a graph drawing device; FIG. It is a figure which shows the example of the hardware constitutions of a graph drawing apparatus. It is a figure which shows the example of a functional structure of a graph drawing apparatus. FIG. 10 is a diagram showing an example of an initial state of a graph window; It is a figure which shows the example of a table. FIG. 4 is a diagram showing an example of a small area; FIG. 4 is a diagram showing an example of line segments of groups; FIG. 10 is a diagram for explaining an example of a method of drawing line segments connecting adjacent groups; FIG. FIG. 10 is a diagram for explaining an example of a method of drawing line segments connecting adjacent groups; FIG. FIG. 10 is a diagram showing a modified example of line segments connecting adjacent groups; FIG. 10 is a diagram showing an example of the state of the graph window after drawing; 4 is a flow chart for explaining an example of the overall flow of processing by a graph drawing program;

FIG. 1 is a diagram showing an example of a network system including a graph drawing device 1. As shown in FIG. FIG. 2 is a diagram showing an example of the hardware configuration of the graph drawing device 1. As shown in FIG.

A graph drawing device 1 shown in FIG. 1 is a device for graphing and displaying a table. A computer such as a personal computer, a tablet computer, or a smartphone can be used as the graph drawing device 1 . A case in which a laptop personal computer is used as the graph drawing device 1 will be described below as an example.

As shown in FIG. 2, the graph drawing device 1 includes an arithmetic unit 101, a RAM (Random Access Memory) 102, a ROM (Read Only Memory) 103, an auxiliary storage device 104, a display 105, a communication device 106, a keyboard 107, and a pointing device. It is configured by the device 108 and the like.

Arithmetic unit 101 is a processor such as a CPU (Central Processing Unit) or GPU (Graphics Processing Unit), and executes arithmetic processing according to a computer program loaded in RAM 102 .

A RAM 102 is a working memory of the arithmetic unit 101 and is loaded with various computer programs.

Various computer programs including an operating system are installed in the ROM 103 and the auxiliary storage device 104 . Especially in this embodiment, the graph drawing program 2 (see FIG. 3) is installed. These computer programs are loaded into RAM 102 as needed. A nonvolatile auxiliary storage medium such as a hard disk or an SSD (Solid State Drive) is used as the auxiliary storage device 104 .

A display 105 displays a screen for input, a calculation result by the calculation unit 101, and the like.

The communication device 106 communicates with other devices such as the cloud server 3 via a communication line such as the Internet, a public line, or a LAN (Local Area Network). A NIC (Network Interface Card), a wireless communication device, or the like is used as the communication device 106 .

A keyboard 107 and pointing device 108 are used by the operator to input information or commands to the graph drawing apparatus 1 .

The graph drawing program 2 is a program for converting each value shown in the table into a line graph and displaying it on the display 105 . Processing by the graph drawing program 2 will be described below.

FIG. 3 is a diagram showing an example of the functional configuration of the graph drawing device 1. As shown in FIG. FIG. 4 is a diagram showing an example of the initial state of the graph window 4. As shown in FIG. FIG. 5 is a diagram showing an example of the table 61. As shown in FIG. FIG. 6 is a diagram showing an example of the small area 41A. FIG. 7 is a diagram showing an example of line segments of groups. 8 and 9 are diagrams for explaining an example of a method of drawing line segments 41C connecting adjacent groups. FIG. 10 is a diagram showing a modification of the line segment 41C connecting adjacent groups. FIG. 11 is a diagram showing an example of the state of the graph window 4 after drawing.

Graph window display unit 201, table data acquisition unit 202, grouping processing unit 203, maximum/minimum value selection unit 204, and scale correspondence amount determination unit 205 shown in FIG. , a group line segment drawing unit 206, an adjacent value line segment drawing unit 207, an annotation placement unit 208, a graphing range reception unit 209, and the like are realized in the graph drawing apparatus 1. FIG.

The graph window display unit 201 causes the display 105 to display the graph window 4 . The graph window 4 is composed of a graph area 41, an annotation area 42, a button area 43, etc., as shown in FIG.

A line graph is drawn in the graph area 41 by the group line segment drawing unit 206 and the adjacent value line segment drawing unit 207, as will be described later. The graph area 41 has N _w ×N _h pixels, the lower left corner pixel of the graph area 41 has coordinates (1,1), and the upper right corner pixel has coordinates (N _w , N _h ).

As will be described later, the annotation placement unit 208 places scales of the X-axis and Y-axis, names of explanatory variables (independent variables) and objective variables (dependent variables), and the like in the annotation area 42 . When the graph drawing program 2 is activated, the graph window display unit 201 displays the graph window 4, but nothing is displayed in the graph area 41 and the annotation area 42 at this time.

In the button area 43, buttons such as a table button 43A and an end button 43B are arranged. How to use each button will be explained later.

The table data acquisition unit 202 acquires the table data 51 as follows. The worker prepares the file of the table in a predetermined directory of the auxiliary storage device 104 . This file may be a spreadsheet application format file or a CSV (Comma Separated Value) format file.

When the operator clicks the table button 43A, the table data acquisition unit 202 causes the display 105 to display a dialog box. The worker specifies the prepared file in the dialog box. Then, the table data acquisition unit 202 reads the file as the table data 51 from the auxiliary storage device 104 . A case where the file of the table 61 as shown in FIG. 5 is read as the table data 51 will be described below as an example.

A table 61 is a record of voltage values E detected by a voltmeter provided in an electric circuit of a certain machine at fixed time intervals a total of 2,000,000 times. Hereinafter, the voltage value E detected at time T _p (1≤p≤2 million) is referred to as "voltage value E _p ".

The grouping processing unit 203 divides all the two million voltage values E in the table 61 into _Nw groups in chronological order of detection time.

By the way, as shown in FIG. 6, the graph area 41 is divided into vertically long small areas 41A each having a width of 1 pixel. Then, a line segment 41B (see FIG. 7) representing the voltage value E of the k-th group is drawn in the k-th small region 41A from the left. This drawing is the reason for dividing the 2 million voltage values E into _Nw groups. Hereinafter, the k-th small area 41A from the left is described as "41A _k ", and the line segment 41B of the k-th group is described as "line segment 41B _k ".

The maximum value/minimum value selection unit 204 selects the maximum value and minimum value of the voltage value E from each of the _Nw groups.

For example, if the number of pixels N _w is 1000, each group has (2 million/N _w ), ie, 2000 voltage values E. Therefore, the maximum and minimum value selection unit 204 selects the voltage value E _{2000×(k−1)+1 belonging} to the group as the maximum and minimum values of the k-th (k=1, 2, . ∼ Select one maximum value and one minimum value from the voltage value E _2000×k .

The maximum and minimum values selected from the k-th group are hereinafter referred to as "maximum voltage value _{Ek_MAX} " and "minimum voltage value _{Ek_MIN} ", respectively.

The scale correspondence amount determination unit 205 determines the minimum scale in each of the X-axis direction and the Y-axis direction of the graph area 41, that is, the amount corresponding to one pixel. Since the X-axis is the time axis, the scale correspondence amount determination unit 205 determines the time per pixel in the X-axis direction to be M/N _w . On the other hand, the voltage per pixel in the Y-axis direction is determined as follows.

The scale corresponding amount determining unit 205 _selects the maximum value among the maximum voltage _{values E1_MAX} , _{E2_MAX , .} Pick the minimum value. As a result, one maximum value and one minimum value among all the voltage values E are selected. The selected maximum and minimum values are hereinafter referred to as "overall maximum voltage value E _MAX " and "overall minimum voltage value E _MIN ", respectively. Then, the scale correspondence amount determination unit 205 determines the voltage per pixel in the Y-axis direction to be (E _MAX −E _MIN )/N _h . For example, if N _h =800, E _MAX =60, and E _MIN =−40, then decide {60−(−40)}/800, or 0.125. Hereinafter, the voltage per pixel in the Y-axis direction is referred to as "unit voltage E _UNIT ".

The group line segment drawing unit 206 draws the line segment 41B of each group in the small area 41A corresponding to each group. The first and second endpoints of line segment 41B _k correspond to minimum voltage value E _{k_MIN} and maximum voltage value E _{k_MAX} , respectively. Thus, for example, the first and second endpoints of line segment 41B _J when k=J correspond to minimum voltage value E _{J_MIN} and maximum voltage value E _{J_MAX} , respectively. Then, as shown in FIG. 7, the image is drawn in the small area _41AJ . Since the small area _41AJ has a width of 1 pixel, the line segment _41BJ is drawn as a vertically long line with a width of 1 pixel. Similarly, when k=J−1 and when k=J+1, the line segments 41B _J−1 and 41B _J+1 , respectively, are also divided into small regions 41A _J−1 as shown in FIG. , 41A _J+1 as lines one pixel wide.

The X and Y coordinates of the point representing the voltage value E in the kth group in graph area 41 are k and {(EE _MIN )+1}/E _UNIT , respectively. Thus, the coordinates of the first and second endpoints, respectively, are (k, {(E _{k_MIN} −E _MIN )+1}/E _UNIT ) and (k, {(E _{k_MAX} −E _MIN )+1)/E _UNIT ). However, decimal places are truncated, rounded down, or rounded off. Also, according to the formula {(E−E _MIN )+1}/E _UNIT , if E=E _MAX , it does not fit in the graph area 41, so even if the coordinates of the second end point are set to N _h , good.

The adjacent value line segment drawing unit 207 draws a line segment 41C for connecting two adjacent groups. The two end points of the line segment 41C respectively correspond to the last voltage value E of the first group and the first voltage value E of the second group of the two adjacent groups.

For example, the two end points of the line segment 41CJ between the ( _J −1)th group and the Jth group are two pixels indicated by a thick frame as shown in FIG. 8(A). A line segment _41CJ then connects these two pixels as shown in FIG. 8(B). Alternatively, the two end points of the line segment 41C _J+1 between the J-th group and the (J+1)-th group are the two pixels indicated by the thick frame as shown in FIG. 9(A). A line segment 41C _J+1 then connects these two pixels as shown in FIG. 9B.

The line segment 41C may include a portion that overlaps with the line segment 41B and a portion that does not overlap. As shown in FIG. It may be represented in a lighter color than the line segment 41B.

A group of line segments 41B and 41C drawn in the graph area 41 by the above processing is a line graph 62 of the table 61 as shown in FIG.

The annotation placement unit 208 places annotations of the line graph 62 such as names (explanatory variable names and target variable names), scales, and values of the X-axis and Y-axis based on the table 61 (see FIG. 5).

By the way, the operator can instruct the graph drawing device 1 to change the size of the graph area 41 by dragging and dropping the outer frame of the graph area 41 . Then, the graph window display unit 201 changes the size of the graph area 41 according to the instruction and displays the graph window 4 again on the display 105 .

Alternatively, the operator can instruct the graph drawing device 1 to change the size of the graph window 4 by dragging and dropping the outer frame of the graph window 4 . Then, the graph window display unit 201 changes the size of the graph window 4 according to the command, and appropriately changes the size of the graph area 41 according to the new size of the graph window 4, and displays the graph window 4 on the display 105. fix.

Alternatively, the operator can specify the range to be graphed. For example, it is specified by clicking the positions corresponding to the start point and end point of the range in the graph area 41 . Hereinafter, this starting point and ending point will be referred to as "starting point time T _s " and "ending point time T _e ", respectively.

Upon receiving the operator's operation, the graphing range receiving unit 209 calculates the start point time _Ts and the end point time _Te based on the clicked position and the like. For example, if any position in each of the small areas 41A _s and 41A _e is clicked, the time corresponding to the voltage value E at the top of the _s -th group is calculated as the starting point time Ts, and the e-th The time corresponding to the last voltage value _E of the group is calculated as the end point time Te. However, s<e.

When the size of the graph area 41 is changed by the graph window display unit 201 in this way, or when the start point time _Ts and the end point time Te are calculated by the _graphing range reception unit 209, the line graph 62 becomes as follows. be redrawn.

When the start point time Ts and the end point time T _e are calculated, the table data acquisition unit 202 _{selects the voltage value E s corresponding} to the start point time T _s and the voltage value corresponding to the end point time T _e from the table 61. A partial table 63 is generated by extracting a range of voltage values E starting and ending with E _e respectively.

The grouping processing unit 203 divides all the voltage values E in the partial table 63 into current (latest) _Nw groups in chronological order of detection time. However, if the partial table 63 is not generated, that is, if only the size of the graph area 41 is changed, all the voltage values E in the latest table (table 61 in this example) are divided.

The maximum/minimum value selection unit 204 selects the maximum value and minimum value of the voltage value E from each group.

The scale correspondence amount determination unit 205 calculates the unit voltage E _UNIT (voltage per pixel) based on the current number of pixels N _h and the overall maximum voltage value E _MAX . Furthermore, based on the starting point time T _s and the ending point time T _e , the target range of graphing (period M _NEW ) is calculated, and the minimum scale in the X-axis direction (time per pixel) is calculated as M _NEW /N _w , to decide. However, if the partial table 63 is not generated, M/N _w is determined.

The group line segment drawing unit 206 draws the line segment 41B of each group in the small area 41A corresponding to each group. As described above, the coordinates of the first and second endpoints of line segment 41B _k in the k-th group are (k, {(E _{k_MIN} −E _MIN )+1}/E _UNIT ) and (k, { (E _{k_MAX -} E _MIN )+1}/E _UNIT ). However, if E _{k_MAX} =E _MAX , the coordinates of the second end point may be set to (k, N _h ) in order to fit the coordinates in the graph area 41 .

The adjacent value line segment drawing unit 207 draws a line segment 41C for connecting two adjacent groups. The method of drawing the line segment 41C is as described above with reference to FIGS. 8-10.

The annotation placement unit 208 then places annotations for the line graph 62 based on the table 61 or partial table 63 .

FIG. 12 is a flow chart for explaining an example of the overall processing flow of the graph drawing program 2. As shown in FIG.

Next, the overall processing flow of the graph drawing device 1 will be described with reference to flowcharts. Based on the graph drawing program 2, the graph drawing device 1 executes processing according to the procedure shown in FIG.

When the graph drawing program 2 is activated, the graph drawing device 1 displays the graph window 4 (see FIG. 4) (#11 in FIG. 12). Then, the file specified by the worker is obtained as table data 51 (#12), and the following graphing process is performed based on the table data 51. FIG.

The graph drawing device 1 divides all the voltage values E shown in the table 61 (see FIG. 5) into _Nw groups (#13), and selects the maximum and minimum values from each group (#14). Furthermore, the minimum scales in the X-axis and Y-axis directions are determined (#15).

Then, based on the processing results of steps #14 and #15, the graph drawing apparatus 1 creates line segments 41B for each group and line segments 41C for adjacent groups (see FIGS. 8 to 10), (#16, #17). Thereby, the line graph 62 is displayed.

After that, when the operator designates the size of the graph window 4 or the graph area 41 (Yes in #18), the graph drawing device 1 redisplays the graph window 4 or the graph area 41 in the designated size. (#19).

Alternatively, when the operator performs the task of designating the start point time _Ts and the end point time _Te (Yes in #20), the graph drawing device 1 _displays the range from the designated start point time _Ts to the end point time Te. A partial table 63 is generated by extracting data from the table 61 (#21).

If the size of the graph area 41 (the number of pixels _Nw or _Nh ) has changed in step #19, or if the partial table 63 has been generated in step #21 (Yes in #22), the graph drawing device 1 performs step The processes #13 to #17 are executed based on the latest numbers of pixels N _w and N _h and the latest table (table 61 or partial table 63).

Even if the number _Nv of voltage values E contained in the partial table 63 is less than the number _Nw of pixels, the same algorithm as in the other case, that is, by executing the processing of steps #13 to #17, Line graph 62 can be redrawn. However, the smaller the number _Nv , the larger the margin of the graph area 41 in the X-axis direction.

Therefore, when the number _Nv is less than the number _Nw of pixels, the graph drawing device 1 may perform the following processing in order to effectively use the graph area 41 .

In step #16, the group line segment drawing unit 206 (see FIG. 3) of the graph drawing device 1 draws the line segment _41Bk of the _k -th (k=1, 2, . . . , Nv) group to the graph area 41. Draw at the position of ((N _w /N _v )×k, E _k /E _UNIT ) inside. However, decimal places are truncated, rounded down, or rounded off. Also, in this case, since only one voltage value E belongs to one group, the maximum voltage value _{Ek_MAX} and the minimum voltage value _{Ek_MIN} are equal, so the line segment _41Bk becomes a point.

Then, in step #17, the adjacent value line segment drawing unit 207 draws a line segment 41C so as to connect the line segments 41B (points in this example) of two adjacent voltage values E. FIG.

According to this embodiment, each voltage value E in the table 61 or the partial table 63 is classified into groups and plotted for each group, so that the line graph 62 can be generated while maintaining the conventional speed of graphing. be able to. Moreover, since the line segment 41B connecting the maximum value and the minimum value is drawn for each group, it is possible to make it more difficult to overlook important data than before.

In the present embodiment, the case of graphing a table having only one objective variable, such as the table 61 in FIG. 5, has been described as an example. torque) can also be graphed. In this case, the grouping processing unit 203, the maximum/minimum value selection unit 204, the scale correspondence amount determination unit 205, the group line segment drawing unit 206, the adjacent value line segment drawing unit 207, and the annotation placement unit 208 shown in FIG. , each of the above processes should be executed for each objective variable.

In this embodiment, the graph drawing device 1 draws both the line segments 41B and 41C, but may draw only the line segment 41B. As a result, the range of voltage values E for each group can be expressed more clearly.

Alternatively, the graph drawing device 1 may draw a scatter diagram of the voltage values E in each group instead of drawing the line segments 41B of each group. A method of drawing a scatter diagram will be described below by taking as an example a case of drawing a scatter diagram of the R-th group in which 2000 voltage values E _R — 1 to E _R — 2000 are classified.

The graph drawing device 1 places a point representing the first voltage value E in the R-th group, that is, the voltage value E _{R_1} , in the graph area 41 (R, {(E _{R_1} −E _MIN )+1}/E _UNIT ). draw. However, the decimal point of the coordinates shall be rounded down. The same applies hereinafter.

The graphing device 1 determines that the Y coordinate of the point representing the second voltage value E, ie, the voltage value E _{R_2} , {(E _{R_2} −E _MIN )+1}/E _UNIT , is equal to any previous voltage value E (that is, here, if it is also different from the Y coordinate of the point of the voltage value E _R — 1), the point representing the voltage value E _{R — 2} is drawn at (R, {(E _{R — 2} −E _MIN )+1}/E _UNIT ), and the same If so, do not draw. Similarly, the Y _coordinate of the point representing the t- _th ( _{t =} 3, 4, . (t- ₁ ) If it is different from the Y-coordinate of any previous voltage value _{E R_1} , _{E R_2} , . _MIN )+1}/E _UNIT ), and if it is the same as either, do not draw.

When drawing a scatter diagram instead of the line segment 41B, the graph drawing device 1 does not draw the line segment 41C.

With such a method, a point is drawn at most once for the same pixel. That is, points are not drawn multiple times for the same pixel. Therefore, the load on the arithmetic unit 101 due to image processing can be reduced more than before.

In this embodiment, the line segments 41B and 41C are arranged such that the point corresponding to the overall minimum voltage value E _MIN is arranged at the lower end of the graph area 41 and the point corresponding to the overall maximum voltage value E _MAX is arranged at the upper end. Drawn. However, the line segments 41B and 41C may be drawn such that margins are formed near the upper and lower ends of the graph area 41. FIG. For example, if the overall minimum voltage value E _MIN and the overall maximum voltage value E _MAX are -30 and 70, respectively, the unit voltage E The line segments 41B and 41C may be drawn by setting _UNIT or the like.

When the voltage value E takes only values equal to or greater than 0, the unit voltage E _UNIT and the like are set so that the lower end of the graph area 41 corresponds to 0 regardless of the overall minimum voltage value E _MIN , and the line segment 41B is set. , 41C may be drawn.

In this embodiment, the voltage values E shown in the table 61 or the partial table 63 are grouped by equally dividing them into the number of pixels _Nw , but grouping may be performed as follows. If the voltmeter records the voltage value E irregularly, the period M or M _NEW is divided into time slots of fixed length (e.g., 30 minutes, 2 hours, or 1 day) with the number of pixels _Nw . , each voltage value E may be classified into the time zone to which the detected time belongs. Alternatively, the period _M or M _NEW is divided into time periods of a certain concept (e.g., one month, one quarter, or one year) that may differ in length, and each voltage value E may be classified into the time zone to which the detected time belongs.

In the present embodiment, an example of graphing a table whose explanatory variable is time has been described. The drawing device 1 can be used.

The graph drawing program 2 may be incorporated into a spreadsheet application as a standard function or an add-in so that a line graph is drawn when a predetermined command is entered with a table selected.

In the present embodiment, the graph drawing device 1 draws the line graph 62 by executing the graph drawing program 2. However, if a program corresponding to the graph drawing program 2 is provided in the cloud server 3 (see FIG. 1) may transmit the table data 51 to the cloud server 3 and cause the cloud server 3 to create the line graph 62 . Then, the image data of the line graph 62 may be received from the cloud server 3 and displayed on the display 105 .

In addition, the configuration of the whole or each part of the graph drawing device 1, the contents of the processing, the order of the processing, the configuration of the data, the configuration of the window, the setting of the minimum scale of the line graph 62, etc., can be appropriately changed in line with the spirit of the present invention. be able to.

1 graph drawing device (graph generation device)
203 Grouping processing unit (classifying means)
204 maximum value minimum value selection unit (selection means)
206 group line segment drawing unit (generating means)
207 Adjacent value line segment drawing unit (generating means)
41 graph area (area)
41B line segment (first line)
41C line segment (second line)
61 table 62 line graph (graph)
63 partial tables

Claims (12)

A graph that generates a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables a generator,
Classification means for classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
selecting means for selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals;
For each of the plurality of sections, a line connecting the selected maximum value and the minimum value is arranged in the section as a first line representing the value in the section, but two adjacent two lines of the plurality of sections are arranged. generating means for generating the graph by not arranging a second line connecting each of the two intervals ;
A graph generation device characterized by comprising: A graph that generates a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables a generator,
Classification means for classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
selecting means for selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals;
For each of the plurality of intervals, a line connecting the selected maximum value and the minimum value is arranged in the interval as a first line representing the value in the interval; As a second line connecting two adjacent intervals, the final objective variable among the objective variables classified into the earlier interval of the two intervals and the objective variable classified into the latter interval generating means for generating said graph by arranging a line connecting the first objective variable of
A graph generation device characterized by comprising: wherein, when an operation is performed to select a partial set out of the plurality of sets, the classification means reclassifies the objective variable of each of the partial sets into the plurality of intervals;
The selection means reselects one maximum value and one minimum value from the set of objective variables reclassified into each of the plurality of intervals,
For each of the plurality of sections, the generating means rearranges, as the first line, a line connecting the reselected maximum value and the minimum value in the section, and further, reclassifies the reclassified generating the graph by rearranging the second line based on a set of target variables;
3. The graph generation device according to claim 2 . When the number of pixels in the first axis direction is changed, the classification means reclassifies the objective variables of each of the plurality of sets, using the same number of sections as the number of pixels after the change as the plurality of sections. ,
The selection means selects one maximum value and one minimum value from the reclassified set of objective variables for each of the same number of sections,
For each of the same number of sections, the generating means rearranges, as the first line, a line connecting the reselected maximum value and the minimum value in the section, and further, for each of the same number of sections A line connecting the last objective variable classified into the earlier interval and the first objective variable classified into the latter interval of the two adjacent intervals. regenerating the graph by repositioning as the second line;
3. The graph generation device according to claim 2 . the number of the plurality of intervals is equal to the number of pixels along the first axis in the region from which the graph is generated;
5. The graph generation device according to any one of claims 1 to 4 . A graph representing all or part of target data having a plurality of sets of explanatory variables and objective variables, in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables, A graph generating device for generating Nw small regions each composed of Nh pixels aligned parallel to two axes in a region aligned parallel to the first axis,
Classification means for classifying the objective variables of each of the plurality of sets into Nw sections in the first axial direction;
For each of the Nw sections, a pixel corresponding to each of the objective variables classified into the section is specified from among the Nh pixels in the section, and a point is drawn once for each of the specified pixels. generating means for generating the graph by arranging but not arranging lines connecting two adjacent sections among the Nw sections ;
A graph generation device characterized by comprising: A graph that generates a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables A method of generating,
classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
Selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals,
For each of the plurality of sections, a line connecting the selected maximum value and the minimum value is arranged in the section as a first line representing the value in the section, but two adjacent ones of the plurality of sections are arranged. generating said graph by not placing a second line connecting each interval ;
A graph generation method characterized by: A graph that generates a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables A method of generating,
classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
Selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals,
For each of the plurality of sections, a line connecting the selected maximum value and the minimum value is arranged in the section as a first line representing the value in the section, and the plurality of sections are arranged next to each other. As a second line connecting two matching intervals, the final objective variable among the objective variables classified in the earlier interval of the two intervals and the last objective variable classified in the latter interval generating said graph by placing a line connecting the first target variable ;
A graph generation method characterized by: A graph representing all or part of target data having a plurality of sets of explanatory variables and objective variables, in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables, A graph generation method in which Nw small regions each composed of Nh pixels aligned in parallel with two axes are generated in a region aligned in parallel with the first axis,
classifying the objective variables of each of the plurality of sets into Nw sections in the first axial direction;
For each of the Nw sections, a pixel corresponding to each of the objective variables classified into the section is specified from among the Nh pixels in the section, and a point is drawn once for each of the specified pixels. generating the graph by placing but not placing a line connecting each two adjacent ones of the Nw segments ;
A graph generation method characterized by comprising: To generate a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables A computer program for use in a computer of
on said computer;
executing a process of classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
executing a process of selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals;
For each of the plurality of sections, a line connecting the selected maximum value and the minimum value is arranged in the section as a first line representing the value in the section, but two adjacent ones of the plurality of sections are arranged. causing the process of generating the graph to be performed by not arranging a second line connecting each interval ;
A computer program characterized by: To generate a graph representing all or part of target data having multiple sets of explanatory variables and objective variables in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables A computer program for use in a computer of
on said computer;
executing a process of classifying the objective variables of each of the plurality of sets into a plurality of intervals in the first axial direction;
executing a process of selecting one maximum value and one minimum value from the set of objective variables classified into each of the plurality of intervals;
For each of the plurality of sections, a line connecting the selected maximum value and the minimum value is arranged in the section as a first line representing the value in the section, and the plurality of sections are arranged adjacent to each other. As a second line connecting two matching intervals, the last objective variable classified into the earlier interval of the two intervals and the last objective variable classified into the latter interval Execute the process of generating the graph by arranging a line connecting the first objective variable ;
A computer program characterized by: A graph representing all or part of target data having a plurality of sets of explanatory variables and objective variables, in a coordinate system having a first axis representing the explanatory variables and a second axis representing the objective variables, 1. A computer program for use in a computer to generate Nw subregions of Nh pixels aligned parallel to two axes in a region aligned parallel to the first axis, comprising:
on said computer;
executing a process of classifying the objective variables of each of the plurality of sets into Nw sections in the first axial direction;
For each of the Nw sections, a pixel corresponding to each of the objective variables classified into the section is specified from among the Nh pixels in the section, and a point is drawn once for each of the specified pixels. executing the process of generating the graph by arranging but not arranging lines connecting two adjacent sections among the Nw sections ;
A computer program characterized by:

Images