JP4718398B2 - Image data arrangement apparatus, image data arrangement method, and program - Google Patents

Description

  The present invention relates to image data arrangement control of an image data arrangement apparatus capable of arranging image data in an image arrangement area divided in a grid pattern in a first direction and a second direction.

  Conventionally, an image is printed on a sheet having an image arrangement area divided into a grid pattern, and the sheet is cut to distribute various images to a plurality of people. However, at this time, the images to be distributed to the same person are not printed at a single location, so it is not possible to cut and distribute the sheets in the vertical direction, and the sheets must be cut and distributed separately. There wasn't.

  For example, Mr. A (Image 1, Image 2, Image 3, Image 6, Image 9, Image 10), Mr. B (Image 3, Image 6, Image 8), and Mr. C (Image 1, Image 2, Image 8) 5, image 6, image 8, image 9, image 10) and image (image 1, image 2, image 3, image 4, image 5) are distributed to Mr. D in the conventional technique, FIG. Printing is performed with a layout as shown in (-1) and (c-1).

  When printing is performed with the layout described above, the user must perform complicated cutting such as (b-2) and (c-2).

Japanese Patent Application Laid-Open No. 2004-151620 discloses a technique that makes it possible to specify an image and a size to be printed, even when there are a plurality of users, and facilitate sheet cutting work.
JP 2003-61016 A

  However, in Patent Document 1, it is not possible to specify the number of prints for each image for each user so that the sheet can be easily cut. For this reason, when a desired number of images are distributed to each user, there is no other way than to separate the completed sticker sheets and select and distribute them, which is very complicated.

  Further, in the conventional technique, the seal layout in the seal division position is a fixed layout or a method of automatically arranging in a fixed direction. For this reason, in order to realize a layout that cuts the combination desired by the user in a straight line and in one direction and reduces the number of times of cutting as much as possible, the layout must be manually performed.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to automatically store image data in an image arrangement area so that a user can cut a combination in a straight line and in one direction. In order to provide a layout mechanism (without manual layout operation by the user).

The present invention provides an image data arrangement apparatus capable of arranging image data in an image arrangement area divided in a grid pattern in the first direction and the second direction, and arrangement of images that can be arranged in the first direction in the image arrangement area Setting means for setting the number, designation means for designating a plurality of sets of one or a plurality of image data designated from a plurality of image data, and an image in the image arrangement area for each set designated by the designation means Image arrangement control means for controlling the arrangement of the image data in the first direction, wherein the image arrangement control means assigns a set of images whose image data number is a multiple of the arrangement number to the image arrangement area for each set. performing a first arrangement control to place control earlier, the first image number image data after the placement control image is disposed an image of the set is not a multiple of the arrangement number by the first arrangement controlled And performing a second arrangement control to place controls on the remaining image arrangement region except for the depositing area.

  According to the present invention, each set designated by the user can be automatically laid out in one direction and in a straight line as much as possible (without manual layout operation by the user). Therefore, even when various images are distributed to a plurality of people, there is an effect that it is not necessary to perform complicated cutting.

  DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, preferred embodiments of a multiple image printing optimum arrangement system according to the invention will be described with reference to the drawings. Note that the print sheet used in the present embodiment has an image print area divided in a grid pattern in the vertical and horizontal directions on the print sheet.

[First Embodiment]
FIG. 1 is a block diagram showing an example of the configuration of a multiple image printing optimum arrangement system showing the first embodiment of the present invention.

  In FIG. 1, reference numeral 1 denotes a display for displaying a print setting screen (FIG. 4) and a print layout screen (FIG. 5) of this system. Reference numeral 2 denotes a printer for printing a layout created by this system. An input device 3 is a pointing device such as a keyboard and a mouse.

  Reference numeral 10 denotes a personal computer (PC) main body as an optimum arrangement for printing multiple images.

  In the PC 10, reference numeral 17 denotes a display I / F, which controls display on the display 1. Reference numeral 18 denotes an external I / F for connecting the printer 2. Reference numeral 11 denotes an input I / F, which controls input from the input device 3.

  In the PC 10, reference numeral 12 denotes a CPU, which loads a program (not shown) stored in a ROM or hard disk (HD) 19 (not shown) onto the RAM 13 and executes it, thereby executing a data storage unit 14, a layout creation unit 15, The layout storage unit 16 and the like are realized to control the entire system.

  The data storage unit 14 stores data on the number of vertical sheets of sticker sheets set on a print setting screen shown in FIG. 4 to be described later, and also stores image information and number information set for each print set on the print setting screen in the database 24. , 25, and then the data in the database 24 is distributed to the databases 20, 21, and 22.

  The layout creating unit 15 creates print layout data in which image data is optimally laid out based on the selected image information distributed to the database 25 and the print set information distributed to the databases 20, 21, and 22.

  The layout storage unit 16 stores the print layout data created by the layout creation unit 15 and controls display on the display 1 as a print layout screen shown in FIG. Further, the layout storage unit 16 controls the printer 2 to execute printing in the print layout when a print instruction is given after the user confirms the print layout screen.

  The data storage unit 14, the layout creation unit 15, and the layout storage unit 16 are realized by the CPU 12 loading a program (not shown) stored in the hard disk (HD) 19 onto the RAM 13 and executing it.

  The above databases 20 to 25 are held in the HD 19. Here, the databases 20 to 25 will be described with reference to FIG.

  FIG. 2 is a diagram showing data images of the databases 20 to 25 shown in FIG.

  In FIG. 2, reference numeral 25 denotes a selected image database. In the print setting screen shown in FIG. 4, the image name and the number of image data selected by the user for each print set are linked to the set ID assigned to each set. It is for storing. The set ID is a number assigned in the order in which the set is set.

  Reference numeral 24 denotes a print set database for storing the total number of image data selected by the user for each print set in the print setting screen shown in FIG. 4 in association with the set ID assigned to each set. is there.

  20 is a multiple database of the number of vertical sheets. Of the print set information stored in the print set database 24, the number of images that is a multiple of the number of sheets that can be arranged vertically on the sticker paper (the data on the number of vertical sheets of the sticker paper) is the total number of images. Print set information (set ID, total number of sheets) to be stored. For example, if the vertical number of sticker sheets is “5”, print set information such as “5” sheets, “10” sheets, “15” sheets, etc. is stored.

  Reference numeral 21 denotes a vertical number <image number database, which stores print set information in which the total number of images larger than the number of sheets that can be arranged vertically on the sticker paper among the print set information stored in the print set database 24 is stored. Is. For example, if the vertical number of sticker sheets is “5”, the total number is “6”, “7”, “8”, “9”, “11”, “12”, “13”. Print set information such as “14”, “14”, “16”,...

  Reference numeral 22 denotes a database for less than the number of sheets, which is used to store print set information in which the total number of images less than the number that can be arranged vertically on the sticker paper is stored among the print set information stored in the print set database 24. is there. For example, if the vertical number of sticker sheets is “5”, print set information of “1”, “2”, “3”, and “4” is stored.

  A blank information database 23 stores blank information generated in the process of arranging images. Note that the blank information is a portion that has become a blank when the print layout is determined in the vertical direction.

  Hereinafter, with reference to FIGS. 3 to 20, the multiple image printing optimum arrangement processing in the multiple image printing optimum arrangement system of the present invention will be described.

  FIG. 3 is a flowchart showing an example of a first control processing procedure in the multiple image printing optimum arrangement system of the present invention, and shows the overall flow of the system. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, s1 to s7 indicate steps.

  First, when an application activation instruction is input, in step s1, the CPU 12 activates the application. In step s 2, the CPU 12 displays the print setting screen of FIG. 4 on the display 1 and accepts input of image settings from the input device 3. Here, the print setting screen will be described.

  FIG. 4 is a diagram showing an example of a print setting screen in the multiple image printing optimum arrangement system of the present invention.

  In FIG. 4, f6 is an input area for setting the vertical number of stickers. f1 is an input area for setting the number of prints of each image. Reference numeral f2 denotes a “set creation” button. By pressing this button, a print set is added to the list box f3. At this time, if it is desired to create a plurality of the same sets, it is possible to set a plurality of sets having the same contents by setting the number of sets in the set number input area f5 and instructing to press the “create set” button f2. is there.

  Reference numeral f7 denotes a radio button for selecting "vertical cutting priority layout" for performing layout in consideration of cutting vertically and "paper saving layout" for performing layout as much as possible to save paper.

  f4 is a “print layout” button, and when this button is pressed, a layout result is displayed. The setting contents on the print setting screen are stored in the data storage unit 14.

  The description returns to the flowchart of FIG.

  In step s2, when the image setting on the print setting screen is input and the “print layout” button f4 is clicked, the CPU 12 acquires the information set on the print setting screen and stores it in the RAM 13, The process proceeds to step s3.

  In step s3, the CPU 12 determines the presence / absence of set printing setting based on the information acquired in step s2, and executes the image data rearrangement process in step s4 when it is determined that set printing is present. Print layout data is generated, and the process proceeds to step s5. Details of the image data rearrangement process are shown in FIG.

  On the other hand, if the CPU 12 determines in step s3 that there is no set printing, the process proceeds directly to step s5.

  Next, in step s5, the CPU 12 displays a print layout screen as shown in FIG. 5 on the display 1 based on the print layout data generated in step s4, and presents the rearranged print layout to the user. The printer waits for a print instruction from the user. Here, the print layout screen will be described.

  FIG. 5 is a diagram showing an example of a print layout screen in the multiple image printing optimum arrangement system of the present invention.

  In FIG. 5, g1 is a print layout, a boundary line is displayed for each print set, and it is possible to confirm how it is arranged. By instructing to press the “previous page” button 87 and the “next page” button g8, the previous page and the next page can be displayed.

  g6 is a “return” button. By pressing this button, it is possible to return to the image selection screen (FIG. 4) again. g4 is a list box, which displays a list of print sets set on the image selection screen (FIG. 4).

  g5 is a “print” button, and printing with the print layout displayed in g1 can be executed by depressing this button.

  The description returns to the flowchart of FIG.

  If the CPU 12 determines in step s6 that the “print” button g5 has been pressed to give a print instruction, the process proceeds to step s7.

  In step s7, the layout storage unit 16 (executed by the CPU 12) executes the printing process with the print layout stored in the layout storage unit 16, and ends the process.

  FIG. 6 is a flowchart showing an example of a second control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image data rearrangement processing in step s4 of FIG. The process of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 18 onto the RAM 13 and executing it. In the figure, t1 to t4 indicate steps, t1 to t3 correspond to the processing of the data storage unit 14, and t4 corresponds to the processing of the layout creation unit 15.

  First, in step t1, the data storage unit 14 acquires the vertical number of sticker sheets.

  Next, in step t2, the data storage unit 14 sorts the image information (such as a combination of images to be printed) and the number information set for each print set on the print setting screen into the databases 24 and 25.

  Next, in step t3, the data storage unit 14 performs a data distribution process for distributing (grouping) the print set information stored in the database 24 to the databases 20-22. Details of this data distribution processing are shown in FIG.

  Next, in step t4, the layout creating unit 15 executes image arrangement processing based on the data distributed in step t3 to generate print layout data. Details of this image arrangement processing are shown in FIG. Then, the process ends.

  7A, 7B, and 7C are schematic diagrams for explaining an image in which the data storage unit 14 distributes setting data such as a combination of images to be printed in the databases 24 and 25 and data such as the number of sheets. In addition, the information of the sets 6-14 is abbreviate | omitted in the figure.

  FIG. 7A shows a list of images and sets set by the user on the print setting screen (FIG. 4).

  The user selects image 0001, image 0002, image 0004, and image 0008 as set 1, image 0001, image 0002, image 0004, and image 0008 are selected as set 2, and set 15 as shown in FIG. 6, as a process of step t2 in FIG. 6, the data storage unit 14 calculates the total number of sets for each set in the database 24, and stores the total number and set ID for the number of sets (FIG. 7B). (B)).

  At this time, the data storage unit 14 stores the image data and the number of sheets corresponding to each set ID in the database 25 as shown in FIG. 7C (c).

  FIG. 8 is a flowchart showing an example of the third control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the data distribution processing in step t3 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, u1 to u8 indicate steps, and correspond to the processing of the data storage unit 14.

  First, in step u1, the data storage unit 14 acquires one piece of data from the database 24, and the “total number” of the data is greater than or equal to the number of sheets that can be printed in the vertical direction of the sticker sheet (hereinafter referred to as “n”). If it is determined that the value is less than “n”, the data storage unit 14 stores the data in the database 22 in step u5. Then, the process proceeds to step u6.

  On the other hand, when it is determined in step u1 that the “total number of pieces” of the data is “n” or more, the data storage unit 14 advances the processing to step u2.

  In step u2, the data storage unit 14 determines whether the “total number” of the data is a multiple of “n”. If the data storage unit 14 determines that the data is not a multiple of “n”, the data storage unit 14 The storage unit 14 stores the data in the database 21. Then, the process proceeds to step u6.

  On the other hand, if it is determined in step u2 that the “total number” of the data is a multiple of “n”, the data storage unit 14 proceeds to step u3 and stores the data in the database 20. Then, the process proceeds to step u6.

  In step u6, the data storage unit 14 determines whether all the data in the database 24 is stored in any one of the databases 20, 21, and 22. If it is determined that all the data is not yet stored, the data storage unit 14 performs step u7. The process proceeds to the next data, and the process returns to step u1.

  On the other hand, if the data storage unit 14 determines in step u6 that all the data in the database 24 is stored in any of the databases 20, 21, and 22, the process proceeds to step u8.

  In step u8, the data storage unit 14 sorts the data stored in the databases 21 and 22 in descending order of the number of sheets, and ends the process.

  As described above, the data in the database 24 includes the first group in which the “total number” is a multiple of the number “n” that can be printed in the vertical direction of the sticker sheet, and the second group in which the “total number” is greater than “n”. Groups can be grouped into a third group with a “total number” of less than “n”.

  Here, an image of allocating data from the database 24 to the databases 20, 21, and 22 will be described with reference to FIG. 7B.

  As the processing of steps u1 and u2 in FIG. 8, the data stored in the database 24 is distributed to the databases 20, 21, and 22 as shown in (d), (e), and (f) of FIG. It is done.

  Here, in the databases 21 and 22, the images are rearranged in the descending order of the number of images as shown in (g) and (h) of FIG. 7B for later layout creation (step u8 of FIG. 8).

  When displaying an image, image data is acquired from the database 25 using the set IDs of the databases 20, 21, and 22 as keys.

  Hereinafter, the image data arrangement process in step t4 in FIG. 6 will be described with reference to FIGS.

  In this embodiment, the image layout (layout) takes into account (1) cutting in a straight line and in the vertical direction, (2) reducing the number of times of cutting, and (3) not generating unnecessary blanks as much as possible. Has been decided.

  FIG. 9 is a flowchart showing an example of the fourth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image data arrangement processing in step t4 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, v1 to v7 denote steps, which correspond to the processing of the layout creation unit 15.

  First, in step v <b> 1, the layout creating unit 15 determines a layout of data whose “total number” stored in the database 20 is a multiple of “n”. Details of this processing are shown in FIG.

  Next, in step v2, if there is data stored in the database 21 that is a multiple of “n” by adding up the “total number” of the two data, the layout creation unit 15 prints the data. Determine the layout. Details of this processing are shown in FIG.

  Next, in step v3, the layout creating unit 15 determines whether all print layouts (image arrangements) of the data stored in the database 21 in step v2 have been determined.

  If it is determined in step v3 that all the print layouts (image arrangements) of the data stored in the database 21 have been determined, the layout creating unit 15 proceeds to step v4 to store the data in the database 22 The print layout is determined and the process is terminated. Details of the process of v4 are shown in FIG.

  On the other hand, if it is determined in step v3 that there is data stored in the database 21 for which the print layout (image layout) has not yet been determined, the layout creating unit 15 advances the processing to step v5.

  In step v5, the layout creation unit 15 determines the print layout of the data in the database 21 and the database 22 if there is a data that is a multiple of n by adding up the “total number” of the two data. Details of this processing are shown in FIG.

  Next, in step v6, the layout creating unit 15 determines the print layout of the data in the database 22 (FIG. 15) and proceeds to step v7.

  In step v7, the layout creating unit 15 determines a print layout for the data for which the print layout has not been determined in steps v2 and v5. Then, the process ends. Details of the process of step v7 are shown in FIG.

  Hereinafter, with reference to FIGS. 10 and 11, the image arrangement processing in the database 20 in step v1 of FIG. 9 will be described.

  FIG. 10 is a flowchart showing an example of the fifth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image arrangement processing in the database 20 in step v1 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, a1 to a5 indicate steps, and correspond to the processing of the layout creating unit 15.

  First, in step a1, the layout creating unit 15 determines whether data is stored in the database 20, and if it is determined that no data is stored, the process ends.

  On the other hand, if it is determined in step a1 that one or more data is stored in the database 20, the layout creating unit 15 advances the processing to step a2.

  In step a <b> 2, the layout creating unit 15 searches the beginning of data in the database 20. In step a3, the layout creating unit 15 determines the layout of the image of the data retrieved in step a2 by “method A” shown in FIG. 11 and generates print layout data so as to be arranged (hereinafter simply referred to as “layout”). Notation). Details of “Method A” will be described with reference to FIG.

  FIG. 11 is a schematic diagram illustrating an example of “method A” which is one of the layout methods of the present embodiment. In the figure, [X (a, b, c, d, e),...] Indicates data information in the database. “X” indicates the number of images in the data. Furthermore, “a”, “b”, “c”, “d”, and “e” indicate image names. In addition, “the number of sheets that can be arranged vertically” is illustrated by taking “5 sheets” as an example.

  “Method A” is a layout method selected when the “total number of data” is a multiple of n.

  First, by arranging data with the “total number” of multiples of the number that can be arranged in the vertical direction of the sticker paper, at the time of distribution, the number of parts that can be cut linearly and in the vertical direction is increased, and the number of times of cutting is further reduced. Is realized.

  For example, when there is one data in the database 20 and the “total number” is five, the image is displayed as a reference start position (in FIG. 11, for example, upper left as shown in FIG. 11A). To 1), 2, 3,...

  When there are a plurality of data in the database 20, for example, when there are two data and the "total number of sheets" is 5 and 20, respectively, the database 20 stores the data as shown in FIG. Arrange in the order of registration.

  Note that the arrangement order of the images is as shown in FIG.

  Hereinafter, the description returns to the flowchart of FIG.

  When the processing of step a3 in FIG. 10 is completed, the layout creating unit 15 determines whether there is data (next data) for which the print layout is not determined in the database 20, and if it is determined that there is, the step In a5, it moves to the next data, and returns to the processing in step a3.

  On the other hand, if it is determined in step a3 that there is no data (next data) for which the print layout has not been determined in the database 20, the process is terminated.

  Hereinafter, with reference to FIGS. 12 and 13, an image arrangement process will be described in which the total number of images is a multiple of n among the data in the database 21 in step v <b> 2 of FIG. 9.

  FIG. 12 is a flowchart showing an example of a fifth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and the total number of images among the data in the database 21 in step v2 of FIG. 9 is a multiple of n. This corresponds to the image arrangement process. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, b1 to b8 indicate steps, which correspond to the processing of the layout creating unit 15.

  First, in step b1, the layout creating unit 15 determines whether data is stored in the database 21, and if it is determined that no data is stored, the process ends.

  On the other hand, if it is determined in step b1 that one or more data is stored in the database 21, the layout creating unit 15 advances the process to step b2.

In step b2, the layout creation unit 15 searches the beginning of data in the database 21. Then, in step b3, the layout creation unit 15, "total number" of the data retrieved in step b2, the vertical total of n (sticker sheet and "total number" of the data retrieved in step b 8 to be described later Search for data holding “total number of sheets” that is a multiple of the number of sheets that can be printed in the direction).

  Next, in step b4, the layout creating unit 15 determines whether or not a pair of data holding the “total number of sheets” in which the total number is a multiple of n is retrieved in step b3, and the paired data is retrieved. If it is determined (exists), the process proceeds to step b5.

  In step b5, the layout creating unit 15 determines and arranges the layout by “method B1”. Here, the details of “Method B1” will be described with reference to FIG.

  FIG. 13 is a schematic diagram illustrating an example of “method B1” and “method B2” which are one of the layout methods of the present embodiment. In the figure, [X (a, b, c, d, e),...] Indicates data information in the database. “X” indicates the number of images in the data. Furthermore, “a”, “b”, “c”, “d”, and “e” indicate image names. In addition, “the number of sheets that can be arranged vertically” is illustrated by taking “5 sheets” as an example.

  “Method B1” is a layout method that is selected when the data in the database 21 is a multiple of the number “n” that can be arranged in the vertical direction of the sticker sheet when the “total number” is added. .

  Since all of the data arranged in the above-mentioned “Method A” has a “total number” that is a multiple of n, the start position when the image is arranged in “Method B1” is always a new column or row. .

  Therefore, by arranging the two “total number” that is a multiple of n, the number of steps becomes as small as possible, and the next image to be arranged In contrast, the arrangement is such that it can be cut in a straight line and the number of cuts is reduced.

For example, there are a plurality of data in the database 21, one data therein holds 11 sheets of "total number", in the step b 3 in FIG. 12 by summing thereto for "total number" , a search data to be a multiple of 5 (holding the nine "total number"), as shown in FIG. 13, continue to first place the image of the first data, then in step b 3 Arrange the searched images.

  Details of “Method B2” will be described later.

  Returning to the flowchart of FIG.

  When the process of step b5 in FIG. 12 ends, the layout creation unit 15 advances the process to step b7.

  On the other hand, if it is determined in step b4 that the paired data holding the “total number” in which the total number is a multiple of n in step b3 has not been searched, the layout creating unit 15 performs the process in step b6. Proceed.

  In step b6, the layout creating unit 15 sets a flag for determining that the layout is performed by the “method B2” or “method E” in the RAM 13 for each data (here, no arrangement is performed). Then, the process proceeds to step b7. The details of “Method B2” and “Method E” will be described later.

  Next, in step b7, the layout creating unit 15 determines whether there is data in which the print layout and the print layout method have not been determined in the database 21, and if it is determined that the data exists, the next data is determined in step b8. To return to step b3.

  On the other hand, if it is determined in step b7 that there is no data in which the print layout and the print layout method have not been determined in the database 21, the layout creating unit 15 ends the process as it is.

  Hereinafter, with reference to FIG. 14, an image arrangement process in which the total number of images in the data in the database 21 and the data in the database 22 in step v5 in FIG.

  FIG. 14 is a flowchart showing an example of a seventh control processing procedure in the optimal arrangement system for printing multiple images according to the present invention. The total number of images is n in the data in the database 21 and the data in the database 22 in step v5 in FIG. Corresponds to the image arrangement processing of multiples. The process of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 18 onto the RAM 13 and executing it. In the figure, c1 to c7 indicate steps, which correspond to the processing of the layout creating unit 15.

  First, in step c1, the layout creating unit 15 searches for the top data in the database 21 whose print layout has not yet been determined.

  In step c2, the layout creating unit 15 adds up the “total number” of the data detected in step c1 and the data retrieved in step c7 described later, so that “total number” is n (the vertical direction of the sticker sheet). The database 22 is searched for data that is a multiple of the number of sheets that can be printed on the database 22.

  Next, in step c3, the layout creating unit 15 determines whether there is data whose total number of images is a multiple of n. If it is determined that the data exists, in step c4, the layout creating unit 15 The print layouts of the data searched in step c1 and step c7 and the image of the data searched in step c2 are determined by “Method B2” and arranged. Here, the details of “method B2” will be described with reference to FIG.

  “Method B2” could not retrieve the paired data at step b4 in FIG. 12, but has the data in the database 22 (“total number of sheets” less than the vertical number of sticker sheets) at step c2 in FIG. This is the layout method that is selected when a pair can be searched from.

For example, there is data holding nine “total number of sheets” for which layout has not yet been determined in the database 21, and by adding this “total number of sheets” in step c 2 of FIG. when you search for data (to hold a single "total number"), as shown in "method B2" in FIG. 1 3, continue to first place the image of the first data, then 8 step The image searched in c2 is arranged.

  Returning to the flowchart of FIG.

  When the process of step c4 in FIG. 14 ends, the layout creating unit 15 advances the process to step c6.

  On the other hand, if it is determined in step c3 that there is no data in which the total number of images is a multiple of n, the layout creating unit 15 advances the process to step c5.

  In step c5, the layout creating unit 15 determines to print layout the image of the data retrieved in steps c1 and c7 by the “method E” print layout method, and sets a flag in the database 21. (No placement here). Then, the process proceeds to step c6. Details of “Method E” will be described later.

  In step c6, the layout creating unit 15 determines whether there is data for which the print layout and the print layout method have not been determined in the database 21. Then, the process returns to step c2.

  On the other hand, if it is determined in step c6 that there is no data for which the print layout and the print layout method have not been determined in the database 21, the processing is terminated as it is.

  Hereinafter, with reference to FIGS. 15 to 18, the image arrangement processing in the database 22 in step v4 or v6 in FIG. 9 will be described.

  FIG. 15 is a flowchart showing an example of an eighth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image arrangement processing in the database 22 in step v4 or v6 in FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, d1 to d17 indicate steps, which correspond to the processing of the layout creating unit 15.

  First, in step d1, the layout creation unit 15 determines whether data is stored in the database 22, and if it is determined that no data is stored, the process ends.

  On the other hand, if it is determined in step d1 that one or more data is stored in the database 22, the layout creating unit 15 advances the processing to step d2.

  In step d2, the layout creating unit 15 determines whether the layout method setting is “paper saving layout”. If it is determined that the “paper saving layout” is not selected, the layout creating unit 15 advances the process to step d11.

  In step d11, the layout creating unit 15 determines whether or not “data exists only in the database 22 and the number of remaining rows of sticker sheets is equal to or greater than the number of data”. If it is determined that “there is data only in the database 22 and the number of remaining columns of the sticker paper is equal to or greater than the number of data”, the layout creating unit 15 proceeds to the processing in step d12 and stores the data in the columns From the head of “No.”, the process proceeds to step d8. Details of “Method D” are shown in FIG.

  On the other hand, if it is determined in step d11 that “there is data only in the database 22 and the number of remaining columns of the sticker sheet is not less than the number of data”, the layout creating unit 15 advances the process to step d3. .

  On the other hand, if it is determined in step d2 that the layout method setting is “paper saving layout”, the layout creating unit 15 advances the process to step d3.

  In step d3, the layout creating unit 15 determines and arranges the print layout of the top data among the data whose print layout has not been determined in the database 22 by “Method C”. Details are shown in FIGS. 16A (a) and 16 (b) described later.

  Then, in step d4, the layout creating unit 15 calculates how many sheets can be arranged vertically from the “total number of data” arranged in step d3 and the number of images that can be arranged vertically on the sticker sheet.

  In step d5, the layout creating unit 15 searches and determines whether data holding the number of images equal to or less than the calculated number of vertically arranged images exists in the database 22. If it is determined that there is data that holds images equal to or less than the calculated number of images, the layout creating unit 15 determines and arranges the layout of the searched image by “method C” in step d6. Details are shown in FIGS. 16A (a) and 16 (b) described later.

  In step d7, the layout creating unit 15 determines whether the number of sheets that can be printed in the vertical direction is “0” from the number of images of the data arranged in step d6. If it is determined that “0” has been reached, the layout creating unit 15 does not use blank information to determine the print layout in a straight line as much as possible. The blank information is discarded, and the process proceeds to step d9. Details are shown in FIG. 16B (d) described later.

  In step d <b> 9, the layout creating unit 15 determines whether there is data whose arrangement has not been determined in the database 22. If it is determined that it exists, the layout creating unit 15 moves to the next data in step d10 and returns the process to step d2.

  On the other hand, if it is determined in step d7 that the number of sheets that can be printed in the vertical direction is not “0”, the layout creating unit 15 returns the process to step d5.

  On the other hand, if it is determined in step d5 that there is no data in the database 22 that holds the number of images equal to or less than the calculated number that can be arranged vertically, the layout creation unit 15 returns the process to step d13.

  In step d 13, the layout creating unit 15 records the number of blanks newly blank this time in the “blank information” currently held in the database 23. Details are shown in FIG. 16A (c) described later. Details of the image stored in the database 23 are shown in FIG.

  Next, in step d14, the layout creating unit 15 searches the database 22 to determine whether there is data having an image number equal to or less than the total number of blanks added in step d13. If the layout creation unit 15 determines that it exists, the layout creation unit 15 sorts the blank information in the database 23 in step d15. Details are shown in FIGS. 17 (4) and 17 (5) described later.

  Thereafter, in step d16, the layout creating unit 15 determines and arranges the print layout of the data retrieved in step d14 by “Method C”. Details are shown in FIG. 16C (f) described later.

  In step d17, the layout creating unit 15 discards the blank information currently stored in the database 23 and shifts the processing to step d9. Details are shown in FIG. 16C (f) (6) described later. Note that once the print layout is determined using blanks, the next image is the top of a new column in order to discard the blank information and determine the print layout in a straight line and vertical direction as much as possible. It is trying to arrange from.

  On the other hand, if it is determined in step d14 that data having the number of images equal to or less than the total number of blanks added in step d13 does not exist in the database 22, the layout creating unit 15 shifts the processing to step d9.

  If it is determined in step d9 that there is no data whose arrangement has not been determined in the database 22, the layout creating unit 15 ends the process as it is.

  Here, the details of “Method C” will be described with reference to FIG.

  FIG. 16A to FIG. 16C are schematic views showing an example of “method C” which is one of the layout methods of the present embodiment. In the figure, [X (a, b, c, d, e),...] Indicates data information in the database. “X” indicates the number of images in the data. Furthermore, “a”, “b”, “c”, “d”, and “e” indicate image names. In addition, “the number of sheets that can be arranged vertically” is illustrated by taking “5 sheets” as an example.

  “Method C” is a data layout method of the database 22. Here, the description will be made with an example of “the number of sheets that can be arranged vertically on the sticker sheet is five”.

  For example, FIG. 16A (a) shows an example in which the flow proceeds in the order of steps d5 and d6 in FIG.

  There are a plurality of data whose layout has not been determined in the database 22, and the total number of images (the number of images: 3) that holds the most images among them is the same as the vertical number of sticker sheets. When there is data that holds the number of images (number of images: 2), layout is performed as shown in FIG.

  Next, when two data images are arranged in FIG. 15, there is an example in which there is data that can still arrange images in the vertical direction and that holds the number of images equivalent to the number of images that can be arranged in the vertical direction. FIG. 16A (b).

  There are multiple data whose layout has not been determined in the database 22, and the images are arranged in the order of data having the largest number of images (number of images: 2) and data having the next largest number of images (number of images: 2). When there is data (the number of images: 1) that holds the number of images equivalent to the number calculated in step d4 in FIG. 15, the layout is performed as shown in FIG. 16A (b). .

  Next, an arrangement method using blank information will be described below using an example.

In “Method C”, as long as the images are arranged in the vertical direction and there is still a place to enter, there is no data to hold the number of images that can be entered in the vertical direction. In step d13 of FIG. the number calculated in step 15 d 4 Add the number blank information. In the stage of layout, when it is considered that there are more blank information portions than the number of data images, the blank portion is detected and layout is performed in step d16 in FIG.

  When placing an image in the blank information portion, it is placed in the horizontal direction from the lower left of the blank. For example, when there are four blank information as shown in FIG. 16C (f) (5), the blank information is used in the order of 1, 2, 3, 4 in the figure. At this time, if the number of data images to be arranged is within three, it is possible to cut along a straight line. This is realized because the data are arranged in descending order. If there are four, place them on the next level up. Once the image is arranged in the blank information portion, the blank information is set to zero in step d17 of FIG. In the figure, the shaded portion is blank information.

  As in the example shown in FIG. 16A (c), since all the data is the number of two images, it is impossible to arrange them exactly in the vertical direction (FIGS. 16A (c) (2), (3), (Four)). For this reason, in the process of arranging data several times, if the total value of the portion that has become blank information becomes less than the number of images of data, images are arranged using blanks (FIG. 16A ( c) (5)). With this arrangement, it is possible to cut straight lines and less frequently without wasting paper.

  As shown in FIG. 16B (d), when a blank is interrupted during processing, the blank is not used (FIG. 16B (d) (3)). Note that this does not mean that the paper is wasted because it occurs when the user requests the number of images less than the number of images that can be printed on the sticker paper.

  In FIG. 16B (e), in the process of arranging the data several times, the case where the total value of the portion that has become blank information becomes less than the number of images of the data cannot be arranged in the horizontal direction. Show. As in FIG. 16A (c), the layout is performed using blank information, but since all cannot be printed in the horizontal direction, the next blank is also used. This is to prevent generation of more blanks than the number of blanks that will surely occur depending on the total number of images specified by the user.

  FIG. 16C (f) shows an example of an image placement method for blank information when the total value of the portion that has become blank information becomes less than or equal to the number of data images in the process of arranging data several times. ing.

  At this time, by arranging from the bottom as shown in FIG. 16C (f) (6) and leaving a blank at the upper level, a blank that will surely be generated depending on the total number of images specified by the user. In addition to several sheets, a layout that can be cut in a straight line without generating blank spaces that waste paper is realized.

  FIG. 17 is a schematic diagram for explaining the flow of storing blank information in the database 23.

  The database 23 holds three pieces of information: blank ID, vertical (blank vertical position), and horizontal (blank horizontal position).

  A procedure for storing data determined to be blank in FIG. 16C (f) in the database 23 will be described as an example.

  At the stage of FIG. 17A, data is not yet stored in the database 23 as shown in FIG.

  In FIG. 17 (2), when blank information is created, each data is stored in the database 23 as blank ID 1, vertical 5 and horizontal C, as shown in FIG. 17B.

  When the layout is determined as shown in FIGS. 17 (3) and 17 (4) and blank information is generated, data is stored in the database 23 as shown in FIGS. 17 (c) and 17 (d). Data in the database 23 is rearranged in descending order using vertical values as keys when blank information occurs and new data is stored in the database 23 (FIG. 17 (4)).

  When there is continuous blank information, data is arranged in order from the left end of the blank information. The data stored in the database 23 is discarded when the image is laid out blank.

  Here, the details of “Method D” will be described with reference to FIG.

  FIG. 18 is a schematic diagram showing an example of “method D” which is one of the layout methods of the present embodiment. In the figure, [X (a, b, c, d, e),...] Indicates data information in the database. “X” indicates the number of images in the data. Furthermore, “a”, “b”, “c”, “d”, and “e” indicate image names. In addition, “the number of sheets that can be arranged vertically” is illustrated by taking “5 sheets” as an example.

  “Method D” is a layout method in which data exists only in the database 22 and the remaining number of sticker sheets is greater than or equal to the number of data when the vertical cutting priority layout method is set.

  In the image, as shown in FIG. 18, data is arranged in one column, and the next data is arranged in the next column. This allows the user to easily cut the seal.

  Hereinafter, with reference to FIG. 19, the image arrangement processing for data whose image arrangement is not determined in the database 21 in step v7 of FIG. 9 will be described.

  FIG. 19 is a flowchart showing an example of the ninth control processing procedure in the multiple-image printing optimum arrangement system of the present invention. An image for data whose image arrangement is not determined in the database 21 in step v7 of FIG. Corresponds to the placement process. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. Further, in the figure, e1 to e4 indicate steps, and correspond to the processing of the layout creating unit 15.

  First, in step e1, the layout creating unit 15 searches the head data of the database 21 for which the print layout has not yet been determined.

  Next, in step e2, the layout creating unit 15 determines and arranges the print layout of the image of the data retrieved in step e1 by “Method E”. Details of “Method E” will be described with reference to FIG.

  FIG. 20 is a schematic diagram showing an example of “method E” which is one of the layout methods of the present embodiment.

  “Method E” is a layout method for data in the database 21 whose print layout has not yet been determined.

  As shown in FIG. 20A, the images are arranged after the data holding the number of images less than the number of sticker sheets in the vertical direction. The arrangement order of the images is as shown in FIG.

  Returning to the flowchart of FIG.

  When the process of step e2 is completed, the layout creation unit 15 searches in the database 21 for whether there is a print layout that has not yet been determined in step e3, and if it is determined that it exists, in step e4, Move to the next data and return to step e2.

  On the other hand, if it is determined in step e3 that there is no data whose print layout has not been determined in the database 21, the layout creating unit 15 ends the process.

  In the present embodiment, the configuration for controlling the layout to cut in the vertical direction has been described. However, the layout may be controlled to cut in the horizontal direction. That is, the layout processing may be performed by reversing the “vertical” and “horizontal” of each control.

  As described above, in the present embodiment, (1) cutting in a straight line and one direction (for example, the vertical direction), (2) reducing the number of times of cutting, (3) not generating unnecessary blanks as much as possible, Can be determined in consideration of the layout.

  Specifically, it is as shown in FIG.

  FIG. 21 is a schematic diagram comparing the conventional layout and the layout of the present invention.

  Conventionally, layouts with a large number of cuts, such as (a-1), (b-2), and (c-2), are used as (a-2) and (b-3) in the present invention. The layout can be cut linearly and vertically and the number of cuts is reduced.

  Further, the layout creating unit 15 may be configured to draw a line or number a set. As a result, the user can visually determine the cut portion.

  Furthermore, the layout creating unit 15 may be configured to allow the user to specify the printing order in the set and to print the images in the set in the printing order specified by the user.

  Therefore, considering each set specified by the user in one direction and a straight line as much as possible and cutting the number of times less frequently and automatically so as not to generate a useless blank as much as possible (manual layout operation by the user) (Without) can be laid out. Therefore, even when various images are distributed to a plurality of people, there is an effect that it is not necessary to perform complicated cutting.

[Second Embodiment]
The configuration of the second embodiment of the present invention will be described below.

  In this embodiment as well, as in the first embodiment described above, the image layout (layout) is (1) cutting in a straight line and in the vertical direction, (2) reducing the number of cuttings, and (3) wasting as much as possible. The decision is made in consideration of the fact that no blanks are generated.

〔System configuration〕
FIG. 22 is a block diagram showing an example of the configuration of the multiple image printing optimum arrangement system showing the second embodiment of the present invention. The same components as those in the first embodiment shown in FIG. It is.

  The data storage unit 27 stores the data of the number of sticker sheets set on the print setting screen shown in FIG. 4 and the image information and the number information set for each print set on the print setting screen in the database 25, 26.

  The layout creating unit 28 creates print print layout data in which image data is optimally laid out based on the selected image information distributed to the database 25 and the print set information distributed to the database 26.

  The layout storage unit 16 stores the print print layout data created by the layout creation unit 28, and controls display on the display 1 as the print layout screen shown in FIG. Further, the layout storage unit 16 controls the printer 2 to execute printing in the print layout when a print instruction is given after the user confirms the print layout screen.

  The data storage unit 27, the layout creation unit 28, and the layout storage unit 16 are realized by the CPU 12 loading a program (not shown) stored in the hard disk (HD) 19 onto the RAM 13 and executing it.

  The above-mentioned databases 23, 25, and 26 are held in the HD 19. Here, the database 26 will be described with reference to FIG.

  FIG. 23 is a diagram showing a data image and an image arrangement result image of the database 26 shown in FIG.

  In FIG. 23, (a) and (b) show data images of the database 26.

  In (a) and (b), the database 26 is a print set database in this embodiment, and the total number of image data selected by the user for each print set on the print setting screen shown in FIG. This is for storing in association with the set ID assigned.

  The print set database 26 also stores an arrangement flag indicating whether or not each set of images has been arranged. Note that (a) corresponds to the state before image placement, and is “0” indicating a state in which all sets of placement flags are not placed. Further, (b) corresponds to a state in which an image is being arranged, and the arrangement flags of some sets are changed to “1” indicating the arrangement state.

  Note that (c) corresponds to the image arrangement result image actually arranged by the image arrangement processing of the present embodiment based on the print set database 26 shown in (a) and (b).

[Image data sorting process]
Hereinafter, with reference to FIG. 24 to FIG. 32, image data rearrangement processing in the multiple image printing optimum arrangement system showing the second embodiment of the present invention will be described.

  FIG. 24 is a flowchart showing an example of a tenth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image data rearrangement processing in step s4 shown in FIG. The process of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 18 onto the RAM 13 and executing it. In the figure, k1 to k4 indicate steps, k1 and k2 correspond to the processing of the data storage unit 27, and k3 corresponds to the processing of the layout creation unit 28.

  First, in step k1, the data storage unit 27 acquires the vertical number of sticker sheets.

  Next, in step k2, the data storage unit 27 distributes the image information (combination of images to be printed) and the number information set for each print set on the print setting screen to the databases 25 and 26.

  Next, in step k3, the layout creation unit 28 executes image arrangement processing based on the data distributed in step k2. Details of this image arrangement processing are shown in FIG. Then, the process ends.

[Image placement processing]
Hereinafter, with reference to FIGS. 25 to 32, the image arrangement processing in step k3 of FIG. 24 will be described.

  FIG. 25 is a flowchart showing an example of an eleventh control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the image arrangement processing in step k3 in FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, p1 to p6 indicate steps, and correspond to the processing of the layout creation unit 28.

  First, in step p1, the layout creating unit 28 sets the virtual image vertical number (current vertical number) c reserved in the RAM 13 to the vertical number set by the user (the number of sheets that can be printed in the vertical direction of the sticker paper (hereinafter “the number of sheets that can be printed”). n ”))).

  Next, in step p2, the layout creating unit 28 determines whether the virtual image length c is larger than half of the set length n, and the virtual image length c is larger than half of the set length n. If YES, the process proceeds to step p3.

  In step p3, the layout creating unit 28 executes a single data arrangement flow. Details of the single data arrangement flow are shown in FIG.

  Next, in step p4, the layout creating unit 28 executes a data combination arrangement flow. Details of the data combination arrangement flow are shown in FIG.

  Next, in step p5, the layout creating unit 28 subtracts 1 from the virtual image length c, and returns the process to step p2.

  If it is determined in step p2 that the virtual image length c is not larger than half of the set length n, the process proceeds to step p6.

  In step p6, the layout creating unit 28 executes the remaining data arrangement flow. Details of the remaining data arrangement flow are shown in FIG. 29 described later.

  Then, when the remaining data arrangement flow in step p6 ends, the layout creation unit 28 ends the process.

[Single data arrangement flow]
FIG. 26 is a flowchart showing an example of a twelfth control processing procedure in the multiple-image printing optimum arrangement system of the present invention, and corresponds to the single data arrangement flow in step p3 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, r1 to r10 denote steps, which correspond to the processing of the layout creation unit 28.

  First, in step r1, the layout creating unit 28 determines whether there is unplaced data in the database 26. If it is determined that there is no data, the data unit flow ends.

  On the other hand, if it is determined in step r1 that unplaced data exists in the database 26, the layout creating unit 28 advances the process to step r2.

  In step r <b> 2, the layout creating unit 28 obtains unplaced head data in the database 26 and stores it in the RAM 13.

  Next, in step r3, the layout creating unit 28 determines whether or not the data acquired in step r2 is data that holds the number of images that is a multiple of the virtual image length c. If it is determined that the data does not hold the number of images, the process proceeds directly to step r9.

  On the other hand, if it is determined in step r3 that the data acquired in step r2 is data that holds the number of images that is a multiple of the virtual image height c, the process proceeds to step r4, and the data is formed in a grid pattern. Print layout data is generated so as to be arranged in the divided image print area (hereinafter simply referred to as arrangement).

  Next, in step r5, the layout creating unit 28 sets an arrangement completion flag for the data arranged in the database 26 arranged in step r4 (changes to “1”).

  Next, in step r6, the layout creating unit 28 determines whether or not the virtual image length c is different from the length n set by the user, and c is not different from n (c is the same as n). If it is determined, the process proceeds to step r9 as it is.

  On the other hand, if it is determined in step r6 that the virtual image length c is different from the length n set by the user, the layout creation unit 28 proceeds to step r7.

  In step r7, the layout creating unit 28 registers the blank generated in the data arrangement in step r4 in the blank database 23.

  Next, in step r8, the layout creating unit 28 executes a blank arrangement flow. The details of the blank arrangement flow are shown in FIG.

  Next, in step r <b> 9, the layout creating unit 28 acquires the next unplaced data from the database 26.

  Next, in step r10, the layout creating unit 28 determines whether or not the end of the database 26 has been reached (that is, the next unarranged data could not be acquired in r9), and has not yet reached the end. If it is determined, the process returns to step r3.

  On the other hand, if it is determined in step r10 that the end of the database 26 has been reached, this single data arrangement flow is terminated.

  In this single data arrangement flow, when n is “5”, in the state of c = n (that is, “5”), the image data of the set IDs 10, 5, 15, 7, and 8 in FIG. 23, 2301, 2301, 2303, 2304, and 2305 in FIG.

  Further, in the state of c = n−1 (that is, “4”), the image data with the set ID 9 in FIG. 23A is arranged as 2310 in FIG. 23C.

  Further, in the state of c = n−2 (that is, “3”), the image data with the set ID 6 in FIG. 23A is arranged as 2311 in FIG. 23C.

[Blank placement flow]
FIG. 27 is a flowchart showing an example of the thirteenth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the blank arrangement flow in step r8 in FIG. 26 and step h9 in FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, i1 to i5 denote steps, which correspond to the processing of the layout creating unit 28.

  First, in step i 1, the layout creation unit 28 searches the data 26 that holds the number of images that can be arranged in the blank database 23 from the database 26.

  Next, in step i2, the layout creating unit 28 determines whether or not data that can be arranged in the blank in step i1 has been searched (acquired). End the flow.

  On the other hand, if it is determined in step i2 that data that can be arranged in the blank in step i1 has been searched (acquired), the process proceeds to step i3.

  Next, in step i3, the layout creating unit 28 arranges the data searched (obtained) in step i1 in the image print area.

  Next, in step i4, the layout creating unit 28 sets an arrangement completion flag for the data arranged in step i3 in the database 26 (changes to “1”).

  Next, in step i5, the layout creating unit 28 deletes the blank data in which the data is arranged in step i3 from the blank database 23, and ends this blank arrangement flow.

[Data combination arrangement flow]
FIG. 28 is a flowchart showing an example of a fourteenth control processing procedure in the multiple image printing optimum arrangement system of the present invention, and corresponds to the data combination arrangement flow in step p4 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, h1 to h11 indicate steps, which correspond to the processing of the layout creating unit 28.

  First, in step h1, the layout creating unit 28 determines whether there is unplaced data in the database 26. If it is determined that there is no data, the data unit flow ends.

  On the other hand, if it is determined in step h1 that there is unallocated data in the database 26, the layout creating unit 28 advances the process to step r2.

  In step h <b> 2, the layout creation unit 28 obtains unplaced head data in the database 26 and stores it in the RAM 13.

  Next, in step h3, the layout creation unit 28 searches the database 26 for unplaced data that holds the number of images that is a multiple of the virtual image height c in combination with the number of images of the data acquired in step h2.

  Next, in step h4, the layout creating unit 28 determines whether or not the suitable data can be acquired in step h3. If it is determined that the data cannot be acquired, the process proceeds directly to step h11.

  On the other hand, if it is determined in step h4 that suitable data has been acquired in step h3, the layout creating unit 28 proceeds to step h5 and arranges the data in the image print area.

  Next, in step h6, the layout creating unit 28 sets an arrangement completion flag for the data in the database 26 arranged in step h5 (changes to “1”).

  Next, in step h7, the layout creating unit 28 determines whether or not the virtual image length c is different from the length n set by the user, and c is not different from n (c is the same as n). If it is determined, the process proceeds to step r9 as it is.

  On the other hand, if the layout creation unit 28 determines in step r6 that the virtual image length c is different from the length n set by the user, the process proceeds to step h8.

  In step h8, the layout creating unit 28 registers the blank generated in the data arrangement in step h5 in the blank database 23.

  Next, in step h9, the layout creating unit 28 executes a blank arrangement flow. Details of the blank arrangement flow are shown in FIG.

  Next, in step h <b> 10, the layout creating unit 28 acquires the next unplaced data from the database 26.

  Next, in step h11, the layout creating unit 28 determines whether or not the end of the database 26 has been reached (that is, the next unallocated data could not be acquired in h10), and has not yet reached the end. If it is determined, the process returns to step h3.

  On the other hand, if it is determined in step h11 that the end of the database 26 has been reached, this single data arrangement flow is terminated.

  In this single data arrangement flow, when n is “5”, when c = n (that is, “5”), the image data with the set IDs 13 and 1 in FIG. It is arranged like 2306 of c). The image data with the set IDs 14 and 2 are combined and arranged as 2307 in FIG. Further, the image data of the set IDs 11 and 4 are combined and arranged as 2308 in FIG. Further, the image data with the set IDs of 12 and 3 are combined and arranged as 2309 in FIG.

[Remaining data allocation flow]
FIG. 28 is a flowchart showing an example of a fifteenth control processing procedure in the optimum multiple image printing arrangement system of the present invention, and corresponds to the remaining data arrangement flow in step p16 of FIG. Note that the processing of this flowchart is realized by the CPU 12 loading a program (not shown) stored in the HD 19 onto the RAM 13 and executing it. In the figure, j1 to j5 indicate steps, which correspond to the processing of the layout creation unit 28.

  First, in step j1, the layout creating unit 28 sets the virtual lateral number (current lateral number) r secured in the RAM 13 to “1”.

  Next, in step j2, the layout creating unit 28 determines whether or not unplaced data exists from the database 26. If it is determined that there is no unplaced data, the remaining data placement flow ends.

  On the other hand, if it is determined in step j2 that unplaced data exists from the database 26, the layout creating unit 28 proceeds to step j3.

  In step j <b> 3, the layout creating unit 28 searches for unplaced data from the database 26.

  Next, in step j4, the layout creation unit 28 acquires the number of blanks from the blank database 23.

  Next, in step j5, the layout creating unit 28 searches for data holding the number of images equal to or less than (number of blanks + (n × r)) from the unplaced data searched in step j3.

  Next, in step j6, the layout creating unit 28 determines whether or not the data retrieved in step j5 (data holding the number of images equal to (number of blanks + (n × r)) or less) has been successfully acquired. If it is determined that the acquisition has failed, the virtual transverse number r is incremented by “1” in step j8, and the process returns to step j5.

  On the other hand, if it is determined in step j6 that the data retrieved in step j5 (data holding the number of images equal to (number of blanks + (n × r)) or less) has been successfully acquired, the layout creating unit 28 The process proceeds to step j9.

  In step j7, the layout creating unit 28 determines whether the number of images of the data acquired in the search in step j5 is (number of blanks + (n × r)), and (number of blanks + (n × x). If it is determined that r)), the process proceeds to step j9.

  In step j9, the layout creating unit 28 arranges the acquired data in the image print area by the “placement method F” shown in FIG. 30 in the search in step j5.

  Next, in step j10, the layout creating unit 28 deletes all blank data (that is, used blank data) from the database 23, and proceeds to step j11. Here, the “arrangement method F” will be described with reference to FIG. 30.

  FIG. 30 is a schematic diagram for explaining an “arrangement method F” which is one of the layout methods of the present embodiment.

  As shown in FIG. 30, when the number of images of data to be arranged is “number of blanks + (n × r)” (“1+ (5 × 2) = 11” in the example of FIG. 30), all blanks are used. Arrange the data. Therefore, in the case of the arrangement method F, a new blank cannot be made.

  Returning to the flowchart of FIG.

  On the other hand, if it is determined in step j7 that the number of images of the data acquired in the search in step j5 is not (number of blanks + (n × r)), the process proceeds to step j12.

  In step j12, the layout creating unit 28 determines whether or not the number of images of the data acquired in the search in step j5 is (n × r) or less, and determines that it is (n × r) or less. If so, the process proceeds to step j13.

  In step j13, the layout creating unit 28 arranges the acquired data in the image print area by the “placement method G” shown in FIG. 31 in the search in step j5.

  Next, in step j14, the layout creating unit 28 deletes all blank data (that is, blank data not used) from the database 23.

  Next, in step j15, the layout creating unit 28 registers the blank newly created by the data arrangement in step j13 in the database 23, and proceeds to step j11. Here, the “arrangement method G” will be described with reference to FIG.

  FIG. 31 is a schematic diagram for explaining the arrangement method G of the present embodiment.

  As shown in FIG. 31, when the number of images of arranged data is “n × r” or less (“5 × 2 = 10” or less in the example of FIG. 31), a blank is not used and a new column is used. Arrange the data. Delete unused spaces. In this arrangement method, as shown in FIG. 31, since the number of images of data to be arranged is “n × r” or less, a new blank is created.

  Returning to the flowchart of FIG.

  On the other hand, if it is determined in step j12 that the number of images of the data acquired in the search in step j5 is not less than (n × r) (greater than (n × r)), the process proceeds to step j16.

  In step j16, the layout creating unit 28 arranges the acquired data in the image print area by the “method H” shown in FIG. 32 in the search in step j5.

  Next, in step j17, the layout creating unit 28 deletes all blank data (that is, used blank data and unused blank data) from the database 23, and proceeds to step j11. Here, the “arrangement method H” will be described with reference to FIG.

  FIG. 32 is a schematic diagram for explaining the “arrangement method H” of the present embodiment.

  As shown in FIG. 32, when the number of images of data to be arranged is larger than “n × r” (greater than “5 × 2 = 10” in the example of FIG. 32), a new column is created using a part of the blank. Arrange the data so that there is no new space. Delete unused spaces.

  Returning to the flowchart of FIG.

  In step j11, the layout creating unit 28 sets (changes to “1”) an arrangement completion flag for the data in the database 26 arranged in step j9, j13, or j16, and returns the process to step j1.

  In step j2, when there is no unplaced data from the database 26, the layout creation unit 28 ends the remaining data placement flow.

  In the present embodiment, the configuration for controlling the layout to cut in the vertical direction has been described. However, the layout may be controlled to cut in the horizontal direction. That is, the layout processing may be performed by reversing the “vertical” and “horizontal” of each control.

  As described above, in the present embodiment, (1) cutting in a straight line and one direction (for example, the vertical direction), (2) reducing the number of times of cutting, (3) not generating unnecessary blanks as much as possible, Can be determined in consideration of the layout.

  Also in the present embodiment, in the same manner as in the first embodiment, each set designated by the user is cut in one direction and in a straight line as much as possible, and is cut as few times as possible, and no unnecessary blank is generated as much as possible. Thus, the layout can be automatically performed (without manual layout operation by the user). Therefore, even when various images are distributed to a plurality of people, there is an effect that it is not necessary to perform complicated cutting.

  In this embodiment, in step p2 of FIG. 25, the data single arrangement flow of p3 and the data combination arrangement flow of P4 are performed only when “vertical image vertical number c is larger than“ ½ vertical number n ””. The configuration to be executed has been described. However, the determination in step p2 is not limited to “when the virtual image length c is larger than“ ½ of the vertical number n ””, but “when virtual image height c is greater than a certain value”. I just need it. However, if this “constant value” is set too small, the layout becomes horizontally long, and there is a possibility that a blank space may be formed in the upper portion. Therefore, in the first embodiment, “vertical value” is an example of “vertical value”. The configuration is “1/2 of the number n”. Therefore, changing the “constant value” is merely a design matter, and an invention in which the “constant value” is changed to other than “½ of the number of vertical sheets n” is also included in the present invention.

  Of course, while the virtual image vertical number c is larger than “0”, the p3 data single unit arrangement flow and the P4 data combination arrangement flow are executed, and when the virtual image vertical number c becomes “0”, the p6 Needless to say, the remaining data arrangement flow may be executed.

  It should be noted that the configuration and contents of the various data described above are not limited to this, and it goes without saying that the various data and configurations are configured according to the application and purpose.

  Although one embodiment has been described above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or recording medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  The configuration of a data processing program that can be read by the image data arrangement device (multiple image printing optimum arrangement device 10) according to the present invention will be described below with reference to the memory map shown in FIG.

  FIG. 33 is a diagram for explaining a memory map of a recording medium (storage medium) that stores various data processing programs that can be read by the image data arrangement apparatus (multiple image printing optimum arrangement apparatus 10) according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  3, 6, 9, 10, 12, 15, 19, 24, 25, 26, 27, 28, and 29 in this embodiment are installed from the outside. The program may be executed by the host computer. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium in which a program code of software for realizing the functions of the above-described embodiments is recorded is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus is stored in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

  In addition, all the structures which combined each embodiment mentioned above and its modification are also included in this invention.

It is a block diagram which shows an example of a structure of the multiple image printing optimal arrangement | positioning system which shows 1st Embodiment of this invention. It is a figure which shows the data image of the database shown in FIG. It is a flowchart which shows an example of the 1st control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a figure which shows an example of the print setting screen in the multiple image printing optimal arrangement | positioning system of this invention. It is a figure which shows an example of the printing layout screen in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 2nd control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. FIG. 4 is a schematic diagram for explaining an image in which setting data such as a combination of images to be printed in a database and data such as the number of sheets is distributed by a data storage unit. FIG. 4 is a schematic diagram for explaining an image in which setting data such as a combination of images to be printed in a database and data such as the number of sheets is distributed by a data storage unit. FIG. 4 is a schematic diagram for explaining an image in which setting data such as a combination of images to be printed in a database and data such as the number of sheets is distributed by a data storage unit. It is a flowchart which shows an example of the 3rd control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 4th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 5th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a schematic diagram which shows an example of "method A" which is one of the layout methods of this embodiment. It is a flowchart which shows an example of the 6th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a schematic diagram which shows an example of "method B1" and "method B2" which are one of the layout methods of this embodiment. It is a flowchart which shows an example of the 7th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 8th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a schematic diagram showing an example of “method C” which is one of the layout methods of the present embodiment. It is a schematic diagram showing an example of “method C” which is one of the layout methods of the present embodiment. It is a schematic diagram showing an example of “method C” which is one of the layout methods of the present embodiment. It is a schematic diagram explaining the flow which stores blank information in a database. It is a schematic diagram which shows an example of "method D" which is one of the layout methods of this embodiment. It is a flowchart which shows an example of the 9th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a schematic diagram which shows an example of "method E" which is one of the layout methods of this embodiment. It is the schematic diagram which compared the conventional layout and the layout of this invention. It is a block diagram which shows an example of a structure of the multiple image printing optimal arrangement | positioning system which shows 2nd Embodiment of this invention. It is a figure which shows the data image and image arrangement result image of the database 26 shown in FIG. It is a flowchart which shows an example of the 10th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 11th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 12th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 13th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 14th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a flowchart which shows an example of the 15th control processing procedure in the multiple image printing optimal arrangement | positioning system of this invention. It is a schematic diagram for explaining an “arrangement method F” which is one of the layout methods of the present embodiment. It is a schematic diagram for explaining an “arrangement method G” which is one of the layout methods of the present embodiment. It is a schematic diagram for explaining an “arrangement method H” which is one of the layout methods of the present embodiment. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read (read) with the image data arrangement apparatus (multiple image printing optimal arrangement apparatus 10) based on this invention.

Explanation of symbols

10 Multiple Image Printing Optimal Arrangement Device 12 CPU
DESCRIPTION OF SYMBOLS 14 Data memory | storage part 15 Layout creation part 16 Layout memory | storage part 20 Multiple database of the number of vertical sheets 21 Multiple of the number of vertical sheets <Image number database 22 Database less than the number of vertical sheets 23 Blank information database 24 Print set database 25 Selected image database

Claims (7)

In an image data arrangement apparatus capable of arranging image data in an image arrangement area divided in a grid pattern in the first direction and the second direction,
Setting means for setting the number of images that can be arranged in the first direction in the image arrangement region;
Designation means capable of designating a plurality of sets of one or a plurality of image data designated from a plurality of image data;
Image placement control means for performing control to place an image in the first direction in the image placement area for each set designated by the designation means;
The image placement control means first performs first placement control for controlling placement of images in a set whose image data number is a multiple of the placement number in the image placement area for each set , and after the first placement control. A second arrangement control is performed in which arrangement control is performed in which the number of image data is not a multiple of the arrangement number in the remaining image arrangement areas excluding the image arrangement area in which the image is arranged by the first arrangement control. An image data arrangement device. The second arrangement control includes:
Control is performed to arrange, for each set, images of a set of a plurality of sets in which the number of image data is not a multiple of the number of arrangements and the total number of image data is a multiple of the number of arrangements. The image data arrangement device according to claim 1. The second arrangement control is
An image of a set of a set in which the number of image data is larger than the number of arrangements and a set in which the number of image data is less than the number of arrangements and the total number of image data is a multiple of the number of arrangements is arranged for each set. And a control for arranging a set of images in which the number of image data is a set of sets larger than the number of arrangements and the total number of image data is a multiple of the number of arrangements. The image data arrangement device according to claim 1. The image arrangement control means arranges an image of a set that has not been arranged by the first arrangement process and the second arrangement control by the first arrangement process and the second arrangement process for each set. 4. The image data arrangement apparatus according to claim 1, further comprising third arrangement control for performing arrangement control on the remaining image arrangement areas excluding the image arrangement area . The third arrangement control is
When there is a set of image data number smaller than the number of image non-arranged areas in the first direction, the image of the set is controlled to be arranged in the first direction with respect to the image non-arranged area,
If there is no set of image data numbers smaller than the number of image unplaced areas in the first direction, the unplaced areas are stored in the memory as blank areas, and the number of image data is smaller than the number of blank areas. 5. The image data arrangement apparatus according to claim 4, wherein when there is a set of the image data, control is performed to arrange the images of the set in the second direction with respect to the blank area. An image data arrangement method in an image data arrangement apparatus capable of arranging image data in an image arrangement area divided in a grid pattern in a first direction and a second direction,
A setting step in which a setting unit sets the number of images that can be arranged in the first direction in the image arrangement region in accordance with a user instruction;
A designation step capable of designating a plurality of sets of one or a plurality of sets of image data designated from a plurality of pieces of image data in accordance with a user instruction;
An image arrangement processing step, wherein the image arrangement processing unit performs control to arrange an image in the first direction in the image arrangement area for each set designated in the designation step;
In the image arrangement control step, first arrangement control is first performed in which the arrangement of images in which the number of image data is a multiple of the arrangement number is arranged in the image arrangement area for each set, and after the first arrangement control. A second arrangement control is performed in which arrangement control is performed in which the number of image data is not a multiple of the arrangement number in the remaining image arrangement areas excluding the image arrangement area in which the image is arranged by the first arrangement control. Image data arrangement method. A processor of an image data arrangement device capable of arranging image data in an image arrangement area divided in a grid pattern in the first direction and the second direction;
Setting means for setting the number of images that can be arranged in the first direction in the image arrangement region;
Designation means capable of designating a plurality of sets of one or a plurality of image data designated from a plurality of image data;
A program for functioning as image placement control means for performing control to place an image in the first direction in the image placement area for each set designated by the designation means,
The image placement control means first performs first placement control for controlling placement of images in a set whose image data number is a multiple of the placement number in the image placement area for each set, and after the first placement control. A second arrangement control is performed in which arrangement control is performed in which the number of image data is not a multiple of the arrangement number in the remaining image arrangement areas excluding the image arrangement area in which the image is arranged by the first arrangement control. Program.

Images