JPH1131185A - Graph processor and storage medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a graph processor which has a function that automatically produces plural graphs in each different item and a storage medium when various graphs are produced based on a tabulation table having plural items. SOLUTION: A CPU 2 stores character data, numeric data, formats, etc., of a tabulation table in table data memory 4b in an RAM 4, further divides data that are designated as a graphed range in the tabulation table into three forms such as 'item data', 'element data' and 'numeric data' and stores them in a graph data memory 4c in the RAM 4. Further, when a 'graph class' that specifies the class of a graph to be produced, 'division information' that specifies whether to divide a graph or not and 'division number information' which specifies the number into which a graph is divided are inputted from an input device 3, these information are stored in a graph division information memory 4d. Also, graph data of graphed range which are stored in the memory 4c is divided into plural graph data through analysis and stored in the memory 4c.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graph processing apparatus and a storage medium that automatically generate a plurality of graphs for each item based on a table generated on an application such as a spreadsheet.

[0002]

2. Description of the Related Art Conventionally, a graph has been automatically created based on a tally table created on so-called spreadsheet software (software using a tally table arranged vertically and horizontally). For example, consider creating a graph based on a tabulation table 50 as shown in FIG.

In FIG. 9, 1, 2, 3, and 4 indicate the row numbers of the tabulation table 50, and A, B, C, and D indicate the column numbers of the tabulation table 50. The row number and the column number can be used to represent the coordinates of each cell (a cell for inputting an item or a numerical value) in the summary table 50. Total Table 50
A2, "Tokyo branch", A3 "Osaka branch",
Item data of “Nagoya branch” is input to A4, element data of “calculator” to B1, element of “clock” to C1, and element data of “video” to D1. Numerical data input in the range of B2: D4 (indicating a rectangular area with B2 being the upper left corner and D4 being the lower right corner) in the table is, for example, sales data.

In order to create a graph based on the tabulation table 50, first, a range to be graphed in the tabulation table 50 is designated. Here, it is assumed that A1: D4 is designated and the entire range of the tally table 50 is graphed.

Next, a graph type (bar graph, pie graph, line graph, etc.) is designated. Here, it is assumed that a 3D bar graph (a bar graph in a three-dimensional display) is specified.

[0006] Further, it is specified whether to use the item data or the element data as a graph item. Here, the item data is specified as a graph item. That is, the item data is 3
As the X axis of the D bar graph, the element data is used as a legend of the 3D bar graph. Finally, the display position and the display area of the created graph are designated, and the creation procedure ends.

FIG. 10 shows an example of a graph created by the above procedure. For each branch, a 3D bar graph 300 showing sales of calculators, clocks, and videos was semi-automatically created by the above procedure.

[0008]

However, depending on the purpose of use of the created graph, it is not a graph in which three items are arranged on the same axis as in the 3D bar graph 300, but each item as shown in FIG. (Here, each branch)
It is effective to create three graphs (3D bar graphs 301, 302, and 303) in which each graph is independent. In particular, when the number of elements is very large and the X axis is too long, it is difficult to intuitively grasp data with a graph such as the 3D bar graph 300, and the graph shown in FIG. And 303) are remarkable.

By the way, according to the graph creating function of the conventional application such as a spreadsheet, the 3D bar graph 301,
In order to create three independent graphs such as 302 and 303, it was necessary to specify a range to be graphed each time each graph was created.

That is, first, A1: D2 in the summary table 50
Is designated as a range to be graphed, and the 3D bar graph 301 is created by the above-described procedure. Next, tabulation table 50
A3: D3 and B1: D1 in the graph are designated as ranges to be graphed, and the 3D bar graph 302 is obtained by the above-described procedure.
Create And finally, A4: D in the summary table 50
4, and B1: Designating D1 as a range to be graphed,
The 3D bar graph 303 is created by the procedure described above. At this time, the operation of designating the graphing range is required three times, and the designation of the graph display position and the display area are also required three times, and the work of adjusting the balance of the display position and the display area of the three graphs is required. It was very time-consuming.

[0011] Further, when a 3D pie chart (stereoscopically displayed pie chart) is specified as the graph type, the above-mentioned complicated operation cannot be avoided. When a 3D bar graph is designated as the graph type, a graph such as the 3D bar graph 300 shown in FIG. 10 in which a plurality of items are arranged on the same axis can be created by a single operation. . However, when a 3D pie chart is designated as the graph type, a plurality of items cannot be arranged on one graph due to the nature of the 3D pie chart, and A1: D4 in the total table 50 is graphed. Even if it is specified as a range, a graph created based on the data of the first row (Tokyo branch) of the numerical data of the aggregation table 50, such as the 3D pie chart 100 shown in FIG. , And the second and subsequent lines of the numerical data were not graphed.

Therefore, when creating a graph in which a plurality of items cannot be represented on one graph due to the nature of a graph such as a 3D pie chart, based on a summary table having a plurality of items such as a summary table 50, The problem that the graphing process needs to be performed a number of times in accordance with the number of items to be graphed also complicates the work of the user and is a cause of reducing the work efficiency.

[0013] Recently, some word processors have a graph creation function, and some other applications have a graph creation function. The same applies to not only when creating a graph with an electronic device but also in an electronic device, application, or the like having a graph creating function.

It is an object of the present invention to provide a graph processing apparatus having a function of automatically creating a plurality of graphs for each item when creating various graphs based on a summary table having a plurality of items. The purpose is to provide a storage medium.

[0015]

According to the first aspect of the present invention,
Table data storage means for storing table data composed of item data, element data, numerical data, and the like; and, based on the configuration of the table data stored in the table data storage means, the table data is stored in a plurality of table data Division means for dividing into areas, graph creation means for analyzing table data in the plurality of table data areas divided by the division means to create a plurality of desired graphs corresponding to each table data area, An output unit for outputting table data stored in the table data storage unit, a plurality of graphs created by the graph creation unit, and the like.

According to the graph processing apparatus of the present invention, the table data storage means stores the item data, the element data,
Storing table data composed of numerical data and the like, dividing the table data into a plurality of table data areas based on the configuration of the table data stored in the table data storage unit, and creating a graph; Means for analyzing each of the table data in the plurality of table data areas divided by the dividing means to create a plurality of desired graphs corresponding to each table data area; and outputting means for the table data storage means And outputs a plurality of graphs created by the graph creating means.

Therefore, when performing an operation such as creating a graph for each item based on table data having a plurality of items, it is not necessary to perform a graph creation operation as many times as the number of divisions as in the related art. With this operation, a plurality of graphs can be created at the same time, the complexity of creating the graphs is eliminated, and the work efficiency of the user can be improved.

According to a second aspect of the present invention, there is provided a storage medium storing a computer-executable program, comprising item data, element data, numerical data, and the like.
A computer-executable program code for dividing the table data into a plurality of table data areas based on a configuration of the table data stored in the table data storage means; A computer-executable program code for analyzing each of the table data and creating a plurality of desired graphs corresponding to each table data area, table data stored in the table data storage means, And a computer-executable program code for outputting a plurality of graphs or the like.

According to the storage medium of the second aspect of the present invention,
For a computer that executes each of the stored programs, the table data is composed of item data, element data, numerical data, and the like. The table data in each of the divided table data areas is analyzed to create a plurality of desired graphs corresponding to each of the table data areas. The data, the plurality of created graphs, and the like are output.

Therefore, when performing a work such as creating a graph for each item based on table data having a plurality of items by a computer, it is not necessary to perform a graph creation operation as many times as the number of divisions as in the related art. A program capable of simultaneously creating a plurality of graphs by a series of operations can be executed on a computer, so that the complexity of creating a graph can be eliminated and the user's work efficiency can be improved.

According to a third aspect of the present invention, in the storage medium according to the second aspect, when the created table data is output, the plurality of created graphs are individually arranged near an output area of the table data. And a computer-executable program code for creating a graph output area for output to a computer.

According to the storage medium of the third aspect of the present invention, in the storage medium of the second aspect, when the created table data is further output, the created table data is placed near an output area of the table data. A graph output area for individually outputting a plurality of graphs.

Therefore, a graph output area can be created by automatically inserting a blank area without designating the graph output area on the user side when the graph is created. The complexity is eliminated, and the work efficiency of the user can be improved.

According to a fourth aspect of the present invention, there is provided the storage medium according to the second or third aspect, wherein the graph does not allow a plurality of table data configurations to be represented on the same graph. When the data is a graph, the program further includes a computer-executable program code for dividing the table data into a plurality of table data areas in a unit that can be expressed.

According to the storage medium of the fourth aspect of the present invention, in the storage medium according to the second or third aspect, the graph further represents a configuration of a plurality of table data on the same graph. When the type of graph is not possible, the table data is divided into a plurality of table data areas in expressible units.

Therefore, when performing an operation such as creating a graph for each item based on table data having a plurality of items, a plurality of items are placed on the same graph due to restrictions on the characteristics of the graph, such as a pie chart. When creating a graph that cannot be displayed at the same time, there is no need to perform the graph creation operation as many times as the number of items as in the past, and a series of operations can handle multiple items at the same time A graph can be created, complexity of graph creation can be eliminated, and user work efficiency can be improved.

According to a fifth aspect of the present invention, in the storage medium according to the second, third or fourth aspect, when the table data area is divided, the table data area is divided based on item data or element data constituting the table data. It is characterized by further including a computer-executable program code for changing a dividing direction of the table data area.

According to the storage medium of the fifth aspect of the present invention, in the storage medium of the second, third or fourth aspect, when the table data area is further divided, item data constituting the table data or The division direction of the table data area is changed based on the element data.

Therefore, when performing operations such as creating a graph for each item based on table data having a plurality of items, if the table data has a plurality of elements, the items and elements are exchanged to convert the plurality of graphs. It is also possible to create the graph, and the complexity of graph creation is eliminated, and the work efficiency of the user can be improved.

[0030]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a graph processing apparatus 1 according to the present invention will be described below in detail with reference to FIGS. 1 to 8 and FIGS. First, the configuration of the present embodiment will be described. FIG. 1 is a block diagram illustrating a main configuration of a graph processing apparatus 1 according to the present embodiment. In FIG. 1, a graph processing device 1 includes a CPU 2, an input device 3, and R
It comprises an AM 4, a display device 5, a printing device 6, a storage device 7, and a storage medium 8, and each unit is connected by a bus 9.

CPU (Central Processing Unit) 2
Is the graph processing device 1 stored in the storage device 7
An application program designated from among various application programs corresponding to the above, various instructions or data input from the input device 3 are stored in the work memory 4a in the RAM 4, and stored in the RAM 4 in accordance with the input instructions and the input data. Various processes are executed in accordance with the application program, and the processing results are stored in the RAM 4.
Stored in the work memory 4a in the display device 5
To be displayed. Then, the processing result stored in the work memory 4a is stored in a storage destination in the storage device 7 which is instructed to be input from the input device 3.

The CPU 2 stores the character data, numerical data, format, and the like of the tabulation table created by the various processes in the table data memory 4b in the RAM 4, and is further designated as a graphing range in the tabulation table. The data is divided into three forms of “item data”, “element data”, and “numerical data” and stored in the graph data memory 4c in the RAM 4. Then, "graph type" for specifying the type of graph to be created (bar graph, pie chart, line graph, etc.), "division information" for specifying whether to divide the graph, and "partition information for specifying the number of graphs to be divided" When the "division number information" is input from the input device 3, the information is stored in the graph division information memory 4d and analyzed, and the graph data of the graphing range stored in the graph data memory 4c is converted into a plurality of graph data. The data is divided into graph data and stored in the graph data memory 4c.

Further, the CPU 2 generates vector data by calculating coordinates of graph drawing elements (lines, points, characters, etc.) based on the plurality of graph data divided and stored in the graph data memory 4c. The display device 5 displays a graph generated according to the contents of the vector data.

The input device 3 includes a keyboard having cursor keys, numeric input keys, various function keys, and the like, and a mouse as a pointing device. The input device 3 outputs to the CPU 2 a signal indicating a key pressed by the keyboard. And outputs an operation signal from the mouse to the CPU 2. The input of items, numerical data, and the like for each cell of the summary table is performed using a keyboard, and the graphing range is specified using a keyboard or a mouse. Other input devices may be used as needed.

A RAM (Random Access Memory) 4 includes a work memory 4a for storing a designated application program, input instructions, input data, processing results, and the like.
A table data memory 4b for storing character data, numerical data, formats, and the like input to the tabulation table, and converting the data to be graphed in the tabulation table into three forms of "item data", "element data", and "numeric data". The graph data memory 4c for storing divided data and the type of graph to be created (bar graph, pie graph,
Graph division information memory 4d composed of “graph type” for specifying a line graph, etc., “division information” for specifying whether or not to divide the graph, and “division number information” for specifying the number of graph divisions. And

The data of the tabulation table such as the tabulation table 50 shown in FIG. 9 is coded and stored in the table data memory 4b, and the entire tabulation table 50 (A1: D4) is designated as a graphing range. To illustrate the case, the graph data memory 4c stores graph data as shown in FIG. 2 and FIG.

In FIG. 2, graph data 10 includes item data 10a, element data 10b, and numerical data 10a.
It is composed of three types of tables c.

In the item data 10a, an “item name” representing the item input in the column A of the totaling table 50 is associated with “item No.” which is a number for identifying the item. This is the table to be generated. Element data 10
b is a table generated by associating the “element name” representing the element input in the first row of the tally table 50 with the “element No.” which is a number for identifying the element. is there. The numerical data 10c is a totaling table 5 for all combinations of the "item No." and the "element No."
This is a table in which numerical data in 0 are generated in association with each other.

FIG. 3 shows that "division" is designated as "division information" stored in the graph division information memory 4d.
If “match with the number of item data” is specified as “division number information”, the C is used to create three graphs according to the number of items input in the A-th column of the summary table 50.
FIG. 9 is a diagram showing graph data created by division by PU2.

In FIG. 3, the graph data 11 is
In the item data 10 a of the graph data 10, data in which “item No.” is “1”, “item name”
This is graph data corresponding to “Tokyo branch”, and includes three types of tables: item data 11a, element data 11b, and numerical data 11c.

The item data 11a is the item data 10
a, “Item No.” is “1”, data “Item name” “Tokyo branch” is extracted, “Item No.” is newly set to “1”, and “Item name” is “Tokyo branch”. It is a table generated in association with. Element data 11b
Is a table generated with the same contents as the element data 10b because each element is essential data for each item stored in the item data 10a. The numerical data 11c is obtained by extracting data in which the “item No.” is “1” from the numerical data 10c, and “element No.” and “numeric data” of the extracted data.
Is a table generated as it is as the data stored in the numerical data 10c, and “Item No.” is newly associated with “1”.

In FIG. 3, the graph data 12 is defined by the item data 10a in the graph data 10.
“Item No.” is data of “2”, “Item name” is graph data corresponding to “Osaka branch”, and item data 1
2a, element data 12b, and numerical data 12c.

The item data 12a is the item data 10
The data in which “item No.” is “2”, “item name” “Osaka branch” are extracted from “a”, “item No.” is newly set to “1”, and “item name” is “Osaka branch”. It is a table generated in association with. Element data 12b
Is the same as the element data 11b.
This table is generated with the same contents as 0b. The numerical data 12c is obtained from the numerical data 10c by “item No.”
Is “2”, and “element No.” and “numerical data” of the extracted data are numerical data 1
0c, and “Item No.”
Is a table newly generated and associated with “1”.

In FIG. 3, the graph data 13 corresponds to the item data 10a in the graph data 10.
"Item No." is data of "3", which is graph data corresponding to "item name""Nagoyabranch", and includes item data 13a, element data 13b, and numerical data 13c.
It is composed of a form table.

The item data 13a is the item data 10
a, the item name “Nagoya branch” is extracted from the data whose “item No.” is “3”, and a new “item No.”
Is a table generated by associating “1” with “item name” as “Nagoya branch”. Element data 13
b is a table generated to have the same contents as the element data 10b, similarly to the element data 11b. The numerical data 13c is obtained from the numerical data 10c by referring to “Item N”.
o. Is extracted as "3", and the "element No." and "numerical data" of the extracted data remain the data stored in the numerical data 10c, and "item N"
o. Is a table newly generated and associated with “1”.

The display device 5 is a CRT (Cathode Ray Tub).
e) It is constituted by a liquid crystal display device or the like, and displays display data input from the CPU 2.

The printing device 6 prints a tally table, a graph, and the like created by various application programs corresponding to the graph processing device 1.

The storage device 7 has a storage medium 8 in which programs, data and the like are stored in advance, and this storage medium 8 is constituted by a magnetic or optical recording medium or a semiconductor memory. The storage medium 8 is fixedly provided in the storage device 7 or is detachably mounted. The storage medium 8 includes various application programs, menu display programs, and print processing programs corresponding to the graph processing device 1. And data processed by each processing program.

The program, graph data, and the like stored in the storage medium 8 may be configured to be received and stored from another device connected via a communication line or the like. Alternatively, a storage device having the storage medium 8 may be provided on another device connected to the storage device 8 and the program, graph data, and the like stored in the storage medium 8 may be used via a communication line.

Next, the operation of the graph processing apparatus 1 according to this embodiment will be described. First, based on the flowchart shown in FIG. 4, the operation of the graph processing apparatus 1 when creating a graph based on the tabulation table 50 shown in FIG. 9 will be described in detail.

According to various input instructions from the input device 3,
When the tabulation table 50 is created, and the character data, numerical data, format, and the like input to the tabulation table 50 are stored in the table data memory 4b, first, in response to an input instruction from the input device 3, for example, A1: D4 Is selected and designated as a graphing range (step S1), the CPU
2 divides the data in the tabulation table of the graphing range into three forms of “item data”, “element data”, and “numerical data”, codes them, and stores them in the graph data memory 4c. According to this example, the graph data 10 composed of the item data 10a, the element data 10b, and the numerical data 10c shown in FIG. 2 is generated, coded, and stored in the graph data memory 4c. .

Next, according to an input instruction from the input device 3,
For example, when a 3D pie chart is designated as a graph type (bar graph, pie graph, line graph, etc.) (step S
2), the CPU 2 codes and stores the information “3D pie chart” in the “graph type” in the graph division information memory 4d, and further specifies the “division information” and “division number information” by using an input device. The information is coded by the CPU 2 and stored in the graph division information memory 4d.

If it is determined in step S3 that the information stored in the "division information" is "non-division", a normal graph creation process is performed (step S4). If the information stored in the “division information” is “division” in step S3, the CPU 2
Referring to the "division number information", if the "division number information" is "matching the number of item data", the graph data 1
0, the item data 10a is referred to.
The graph data corresponding to each “item No.” is created. In this example, since the number of item data is "3", three graph data (see FIG. 3) of the graph data 11, the graph data 12, and the graph data 13 are created (step S5). .

That is, the CPU 2 extracts the data whose “item No.” is “1”, “item name” and “Tokyo branch” from the item data 10a shown in FIG. Is set to “1” and the “item name” is associated with “Tokyo branch” to generate the item data 11a shown in FIG.
Since each element is essential data for each item stored in the item data 10a, element data 11b shown in FIG. 3 is generated as data having the same contents as the element data 10b, The data whose “item No.” is “1” is extracted from the data 10c, and the “element No.” and “numerical data” of the extracted data remain unchanged from the data stored in the numerical data 10c. The “item No.” is newly associated with “1” to generate the numerical data 11c shown in FIG.

Similarly, the CPU 2 sets the item data 10
The data in which “item No.” is “2”, “item name” “Osaka branch” are extracted from “a”, “item No.” is newly set to “1”, and “item name” is “Osaka branch”. The item data 12a shown in FIG. 3 is generated, and the element data 12b shown in FIG. 3 is generated as data having the same contents as the element data 10b, similarly to the element data 11b. "Item No." is "2"
Is extracted, and “element N” of the extracted data is extracted.
o. "And" Numerical data "remain the data stored in the numerical data 10c, and" Item No. "is newly associated with" 1 ", and the numerical data 12 shown in FIG.
Generate c.

Further, the CPU 2 sets the item data 10
a, the item name “Nagoya branch” is extracted from the data whose “item No.” is “3”, and a new “item No.”
Is set to “1” and the “item name” is associated with “Nagoya branch” to generate the item data 13a shown in FIG. 3, and, like the element data 11b, as the data having the same contents as the element data 10b, The element data 13b shown in FIG. 3 is generated, and data in which the “item No.” is “3” is extracted from the numerical data 10c, and the “element No.” and “numeric data” of the extracted data are , Numerical data 1
0c, and “Item No.”
Generates the numerical data 13c shown in FIG. 3 in association with "1".

In step S3, when the "division information" is "division" and the "division number information" is, for example, "2"("not equal to the number of item data"), in this example, For example, "item N" of item data 10a
o. , "1" and "2" as the first divided graph data, and the data whose "Item No." is "3" as the second divided graph data.
The graph data is appropriately divided according to the content of the “division number information”.

For each of a plurality of (here, three) graph data created in step S5,
The CPU 2 calculates the coordinates of the graph drawing elements (lines, points, characters, etc.) and creates vector data corresponding to the “3D pie graph” specified as the “graph type” (step S).
6) A blank area for displaying a graph created according to the contents of the vector data is inserted below the tally table 50 (step S7).

Further, the CPU 2 sets the blank area as
According to the "division number information" stored in the graph division information memory 4d, division is performed (here, into three) (step S
8) For each divided area, for example, in order from the left divided area, it is specified as an area to output a graph corresponding to the graph data 11, the graph data 12, and the graph data 13 (step S9).

With respect to the area specified in step S9, the CPU 2 divides each of the divided graph data (graph data 11, 12, 13) according to the contents of the vector data created in step S6. A 3D pie chart (three in this case) is created (step S10), and each graph is pasted and displayed in a corresponding output area (step S11).

In step S11, a plurality (here, 3) displayed by pasting in the output area below the totaling table 50 is displayed.
FIG. 5 shows an example of the 3D pie chart.

In FIG. 5, a 3D pie chart 101
Is a graph created on the basis of the graph data 11, and is displayed at the top of the output area with respect to the "item name" and "Tokyo branch" in which the "item No." of the item data 11a is "1". “Sales data (Tokyo branch)” is displayed as the graph title. Also, the element data 11b
"Element No." of "1", "2", "3" corresponding to "1", "Calculator", "Clock", and "Video" are output as legends using pattern classification and color classification. It is displayed slightly below the graph title in the area. Then, the value of the “numerical data” corresponding to each “element No.” of the numerical data 11c is displayed as a percentage using the pattern classification and the color classification displayed in the legend, and the 3D is displayed substantially at the center of the output area.
It is displayed as a pie chart.

Similarly, the 3D pie charts 102 and 103 are generated as a graph title, a legend, and a percentage display. Conventionally, the 3D pie chart created by a series of operations is only one graph such as the 3D pie chart 100 shown in FIG. 12, but the 3D pie charts 101, 102, and 103 illustrated in FIG. Two graphs could be created simultaneously in a series of operations.

When the graph shown in FIG. 5 is displayed in step S11, the guidance display is continued.
A message such as "OK?" Is displayed, and the user is asked whether the created graph is appropriate (step S12). Step S1
In step 3, the user inputs “OK” to the guidance display in step S12 using the input device 3.
If the operation is to instruct, the series of graph creation processing ends.

For example, instead of the sales data for each branch as shown in FIG.
In step S13, the user inputs the guidance display in step S12 using the input device 3 instead of the operation of instructing "OK" instead of instructing "OK". When an operation for instructing the setting is performed, the graph creation area created in steps S7 and S8 is deleted (step S14), and subsequently, the created multiple graphs are also erased (step S15).

Then, the item data and the element data in the graphing range (A1: D4) of the tabulation table 50 shown in FIG. 9 are replaced (step S16), and the process returns to the step S5 to create the graph data 20 shown in FIG. I do. That is, as shown in FIG. 6, the graph data 20 having the same configuration as the graph data 10 and including three types of tables of item data 20a, element data 20b, and numerical data 20c is created.

Specifically, the “element name” representing the element input in the first row of the summary table 50 is regarded as an item, and is associated with “item No.” which is a number for identifying the item. Then, the item data 20a is generated, the “item name” representing the item input in the column A of the summary table 50 is regarded as an element, and “element N” which is a number for identifying the element is used.
o. , Respectively, to generate element data 20b. For all combinations of the "item No." and the "element No." The data 20c is generated.

Next, the process proceeds to step S 6, where “item N” is entered in the item data 20 a of the graph data 20.
o. "Is" 1 ", graph data corresponding to" item name "and" calculator ", and is graph data 21 (FIG. 3) composed of three types of tables: item data 21a, element data 21b, and numerical data 21c. 7) is generated.

The item data 21a, the element data 21b, and the numerical data 21c are created by the same operations as those for creating the item data 11a, the element data 11b, and the graph data 11C.

Similarly, in step S6, in the item data 20a of the graph data 20,
"Item No." is data with "2", graph data corresponding to "item name" and "clock", and item data 22
a, element data 22b, and numerical data 22c are generated.

The item data 22a, the element data 22b, and the numerical data 22c are created by the same operations as those for creating the item data 12a, the element data 12b, and the graph data 12C.

Similarly, in step S6, in the item data 20a of the graph data 20,
“Item No.” is “3”, graph data corresponding to “item name” “video”, and item data 23
a, element data 23b, and numerical data 23c are generated as graph data 23 (FIG. 7).

The item data 23a, the element data 23b, and the numerical data 23c are created by the same operations as those for creating the item data 13a, the element data 13b, and the graph data 13C.

Thereafter, steps S7 to S7 are performed in the same manner as in the above-described operation.
By repeating the operation of S11, 3D pie charts 201, 202, and 203 for each field as shown in FIG. 8 are created. The subsequent operation is in accordance with the above description.

Each graph shown in the description of the present embodiment is merely an example, and the graph title, legend, percentage display, and the like may be in other positions and forms.
Further, other display elements may be added.
A graph created semi-automatically by a series of operations may be arbitrarily editable by a user.

In addition, the setting contents of the graph division information memory 4d in the RAM 4, the graph creation procedure according to the flowchart shown in FIG. 4, and the like can be appropriately changed without departing from the spirit of the present invention.

As described above, in the graph processing apparatus 1 of the present embodiment, the CPU 2 stores the character data, numerical data, format, and the like of the tabulation table created by the various processes in the table data memory in the RAM 4. 4b, and further designates the data specified as the graphing range in the summary table as “item data”, “element data”, and “numeric data”.
The graph is divided into forms, stored in the graph data memory 4c in the RAM 4, and the type of graph to be created (bar graph, pie graph, line graph, etc.) is specified, and whether to divide the graph is specified. When "division information" to be input and "division number information" specifying the number of divisions of the graph are input from the input device 3, the information is stored in the graph division information memory 4d, and analyzed, The graph data in the graphing range stored in the graph data memory 4c is divided into a plurality of graph data, and the graph data is stored in the graph data memory 4c.
It was stored in.

The CPU 2 calculates the coordinates of the graph drawing elements (lines, points, characters, etc.) for each of a plurality of (here, three) graph data, and sets the graph designated as the “graph type”. Is created, a blank area for displaying a graph created according to the contents of the vector data is inserted below the summary table, and the blank area is stored in the graph division information memory 4d. Dividing according to the "division number information", and as an area for outputting a graph corresponding to each divided area, for each divided graph data, a plurality of graphs according to the contents of the created vector data. Was created, and each graph was pasted and displayed in the corresponding output area.

Therefore, according to the graph processing apparatus 1 of the present embodiment, when a graph for each item is created based on a tabulation table having a plurality of items, the number of times of graph creation according to the number of items is different from that of the related art. There is no need to perform any operations, a series of actions,
A plurality of graphs can be created at the same time, and when the summary table has a plurality of elements, it is also possible to create a plurality of graphs by exchanging items and elements. Work efficiency can be improved.

Further, according to the graph processing apparatus 1 of the present embodiment, when a graph is created, a blank area is automatically inserted even if the user does not designate a graph display area, and the graph display area is automatically inserted. Can be created, the complexity of creating the graph display area can be eliminated, and the work efficiency of the user can be improved.

Further, the graph processing apparatus 1 according to the present embodiment
According to the above, when creating a graph for each item based on a total table having a plurality of items, it is possible to simultaneously display a plurality of items on one graph due to restrictions on the characteristics of the graph, such as a pie chart. When creating a graph that is absolutely impossible, there is no need to perform the graph creation operation according to the number of items as in the past, and it is possible to create a graph corresponding to multiple items at the same time with a series of operations, The complexity of creating a graph is eliminated, and the work efficiency of the user can be improved.

[0082]

According to the graph processing apparatus of the first aspect of the present invention, when performing an operation such as creating a graph for each item based on table data having a plurality of items, the number of divisions is reduced as in the prior art. A plurality of graphs can be created simultaneously by a series of operations without the need to perform the graph creation operation a corresponding number of times, and the complexity of creating the graphs can be eliminated, and the work efficiency of the user can be improved.

According to the storage medium of the second aspect of the present invention,
When performing operations such as creating a graph for each item based on table data having a plurality of items by a computer, there is no need to perform a graph creation operation as many times as the number of divisions as in the related art. In addition, a computer capable of simultaneously creating a plurality of graphs can be executed by a computer, so that the complexity of graph creation can be eliminated, and the work efficiency of the user can be improved.

According to the storage medium of the third aspect of the present invention,
When creating a graph, a graph output area can be created by automatically inserting a blank area, etc., without having to specify the graph output area on the user side, eliminating the complexity of creating a graph output area. , Can improve the user's work efficiency.

According to the storage medium of the invention described in claim 4,
When performing a task such as creating a graph for each item based on table data having a plurality of items, a plurality of items and the like are simultaneously displayed on the same graph due to restrictions on the nature of the graph, such as a pie chart. Even when creating a graph where it is impossible to do so, there is no need to perform the graph creation operation according to the number of items as in the past, and it is possible to create a graph corresponding to multiple items at the same time with a series of operations In addition, the complexity of creating a graph can be eliminated, and the work efficiency of the user can be improved.

According to the storage medium of the fifth aspect of the present invention,
When performing work such as creating a graph for each item based on table data with multiple items, if the table data has multiple elements, it is possible to create multiple graphs by exchanging items and elements Therefore, the complexity of creating a graph can be eliminated, and the work efficiency of the user can be improved.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a main configuration of a graph processing apparatus 1 according to an embodiment.

FIG. 2 is a diagram showing a configuration of graph data 10 stored in a graph data memory 4c by dividing total table data of a total table 50 shown in FIG. 9 into three forms.

FIG. 3 is a diagram showing the configuration of graph data 11, 12, and 13 stored in a graph data memory 4c by dividing the graph data 10 shown in FIG. 2 for each item.

FIG. 4 is a flowchart illustrating an operation of the graph processing apparatus 1 when a graph is created based on the tabulation table 50 illustrated in FIG. 9;

5 is graph data 11, 12, and 13 shown in FIG.
FIG. 5 is a diagram showing 3D pie charts 101, 102, and 103 created according to the flowchart shown in FIG.

FIG. 6 is a diagram showing a configuration of graph data 20 stored in the graph data memory 4c by exchanging item data and element data of the total table data of the total table 50 shown in FIG. 9 and dividing the data into three forms.

FIG. 7 is a diagram showing a configuration of graph data 21, 22, and 23 stored in a graph data memory 4c by dividing the graph data 20 shown in FIG. 6 for each item.

FIG. 8 is graph data 21, 22, and 23 shown in FIG.
FIG. 5 is a diagram showing 3D pie charts 201, 202, and 203 created based on the flowchart shown in FIG.

FIG. 9 is a diagram showing an example of a tally table created on so-called spreadsheet software.

FIG. 10 is a diagram showing a 3D bar graph 300 created by a conventional graph processing function using A1: D4 of the aggregation table 50 shown in FIG. 9 as a graphing range.

11 is a graph obtained by specifying a graphing range three times by a conventional graph processing function and dividing the 3D bar graph 300 shown in FIG. 10 into three for each item.
FIG.

FIG. 12 is a diagram showing a 3D pie chart 100 created by a conventional graph processing function using A1: D4 of the tabulation table 50 shown in FIG. 9 as a graphing range.

[Explanation of symbols]

 Reference Signs List 1 graph processing device 2 CPU 3 input device 4 RAM 5 display device 6 printing device 7 storage device 8 storage medium 9 bus

Claims (5)

[Claims] 1. Table data storage means for storing table data composed of item data, element data, numerical data and the like, and table data based on the configuration of the table data stored in the table data storage means. Dividing means into a plurality of table data areas; analyzing the table data in the plurality of table data areas divided by the dividing means to create a plurality of desired graphs corresponding to each table data area A graph processing apparatus comprising: a graph creation unit; and an output unit that outputs table data stored in the table data storage unit, a plurality of graphs created by the graph creation unit, and the like. 2. A storage medium storing a computer-executable program, comprising: item data, element data, numerical data, and the like, based on the configuration of table data stored in table data storage means. A computer-executable program code for dividing the table data into a plurality of table data areas; and analyzing the table data in the plurality of divided table data areas, respectively, Computer-executable program code for creating a plurality of graphs, and computer-executable program code for outputting table data stored in the table data storage unit, the created plurality of graphs, and the like A storage medium storing a program including: 3. A computer for generating a graph output area for individually outputting the plurality of generated graphs in the vicinity of the output area of the table data when outputting the generated table data. 3. The storage medium according to claim 2, further comprising: an executable program code. 4. When the created graph is a type of graph in which the configuration of a plurality of table data cannot be represented on the same graph, a plurality of units of the unit capable of expressing the table data are provided. 4. The storage medium according to claim 2, further comprising a computer-executable program code for dividing the data into table data areas. 5. A computer-executable program code for changing a dividing direction of the table data area based on item data or element data constituting the table data when dividing the table data area. 5. The storage medium according to claim 2, further comprising: