JP5128384B2 - Coloring method and program for line drawing - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To eliminate any painting overflow or painting remnant in coloring line drawing. <P>SOLUTION: This coloring method includes: a step (S402) for setting a boundary point on a first boundary between a region already painted out and a painting remnant region in a line drawing; a step (S403) for tracing the first boundary starting from the boundary point on the first boundary to two directions, and determining a point when the baseline of the line drawing is reached as a start point; a step (S404) for tracing a second boundary between the baseline and the painting remnant region starting from the start point with the first and second orbit points, and for recording the orbit, and for calculating and recording a distance between the first orbit point and the second orbit point; steps (S405, S406, S408) for ending the orbit recording step; a step (S407) for creating a painting stop line; and a step (S409) for coloring the line drawing. <P>COPYRIGHT: (C)2010,JPO&amp;INPIT

Description

  The present invention relates to a coloring method and program for line drawing. Specifically, the present invention relates to a coloring method and a program capable of performing coloring so that there is no overflow or unfilled color when coloring a line drawing.

  It is common practice to color a line drawing, which is a picture drawn with only one color line (base line), such as comics, animations, and illustrations. FIG. 1 shows a line drawing 1 as an example of the line drawing. Coloring black-and-white line drawings such as comics produced in Japan is often done overseas.

  When coloring a line drawing, a coloring tool called a fill tool for filling a continuous same-color area with a specified color is generally applied to a line drawing area. The “same color” here does not have to mean exactly the same color, and a similar color having a certain range can be considered as “same color”. However, in the line drawing, there is a case where the base line is not connected like the portion 21 shown in FIG. Therefore, when the conventional fill tool is applied to color the hair 2 portion of the line drawing 1, the hair 2 portion and the face 7 portion are recognized as a continuous same color region, and not only the hair 2 but also the face 7. There is a problem that the part is filled up. Similarly, since the base line is not connected in the portion 22 shown in FIG. 1 and the hair 2 portion is connected to the background 8, there is a problem that not only the hair 2 but also the background 8 is filled. . These problems are called “filling” and are one of the problems to be solved.

  Even in such a case, a method of applying only the hair 2 is known. In this method, first, the black area of the line drawing is expanded outward by a few pixels. This is to fill the above-described gap portion. Then, the continuous white area is filled with the above-described fill tool. Then, the expanded portion is restored (reduced), and the filled region is expanded outward by the same number of pixels. A line drawing 1 including the hair 3 colored by such a conventional method is shown in FIG.

  However, this method has drawbacks, and unpainted areas are produced in areas where the area becomes narrower, such as the tips of the hair shown by the portions 31 and 32 in FIG. This is because the portion of the line drawing obtained by extending the black region by several pixels does not necessarily overlap with the portion obtained by extending the region painted by the fill tool by several pixels. This non-overlapping portion results in unpainted areas. Further, as indicated by the portion 33, unpainted portions are also generated in portions where there is a gap in the line drawing. That is, although this method can prevent overfilling, there is a problem that unpainted parts are produced.

  An object of the present invention is to provide a method and software tool for eliminating overflow and unfilled areas when coloring a line drawing.

  In order to solve the above-described problem, the coloring method for a line drawing according to the present invention has a boundary between an already filled area and an unpainted area between the first baseline and the second baseline in the line drawing. A boundary point setting step for defining a boundary point on the first boundary, and tracing the first boundary from the boundary point on the first boundary in two directions to the first and second baselines of the line drawing. A starting point determination step for determining points when the first and second starting points are reached, respectively, and a boundary between the first and second baselines and the unpainted area starting from the first and second starting points The first and second trajectory points follow the second boundary, and the trajectory recording step for recording the trajectory, and the distance for each combination of the series of first trajectory points and the series of second trajectory points are calculated. And record distance calculation And the first end condition in which the distance between the first trajectory point and the second trajectory point is zero, or the second end condition in which the distance exceeds a certain value is satisfied. When the trajectory recording ending step for ending the trajectory recording step for the point and when the trajectory recording step is completed due to the second ending condition, a solid line is applied to the portion of the recorded distance that is the minimum distance And a coloring step of painting a region surrounded by the deadline and the first and second base lines with a certain color.

  In another embodiment, the priority order of the first end condition may be higher than the priority order of the second end condition.

  In another embodiment, the priority order of the second end condition may be higher than the priority order of the first end condition.

  In order to solve the above problem, a computer program for coloring a line drawing according to the present invention includes an image reading means for reading a line drawing into a memory, and an already filled portion sandwiched between the first baseline and the second baseline in the line drawing. When there is a boundary between the area and the unpainted area, a boundary point setting means for determining a boundary point on the first boundary and storing the boundary point in the memory; and on the first boundary from the boundary point on the first boundary , Respectively, in two directions, starting point determining means for determining the points when the first and second baselines of the line drawing are reached as the first and second starting points, respectively, and storing them in the memory; and Starting from the second starting point, the first and second trajectory points follow the second boundary, which is the boundary between the first and second base lines and the unpainted area, and the trajectory is stored in the memory. Trajectory recorder to save A distance recording means for calculating a distance for each combination of a series of first locus points and a series of second locus points and storing the distance in the memory; and a distance between the first locus points and the second locus points. When the first end condition that becomes zero or the second end condition in which the distance exceeds a certain value is satisfied, and the trajectory determination unit that determines whether the second end condition is satisfied, If the paint line creation means for creating a paint line at the minimum distance among the distances stored in the memory and the first end condition or the second end condition are satisfied, The computer realizes a trajectory recording end instructing unit for instructing the trajectory recording unit to end the trajectory point recording, and a painting unit for painting a region surrounded by the paint stop line and the first and second base lines with a certain color. Make

  In another embodiment, the trajectory determination unit can determine the first end condition in preference to the second end condition.

  In another embodiment, the trajectory determination unit can determine the second end condition in preference to the first end condition.

  ADVANTAGE OF THE INVENTION According to this invention, the coloring method and computer program suitable for the colored line drawing containing the unpainted part can be provided. By this method or computer program, it is possible to efficiently produce a colored line drawing without any overfilling or unpainted area.

  Next, one mode for carrying out the line drawing coloring method according to the present invention will be described with reference to the drawings.

  First, FIG. 3A is an enlarged view of a portion 32 in the line drawing 1 of FIG. This portion 32 includes two base lines 321a and 321b of the line drawing, an area 322 already painted by a conventional method, and unpainted areas 323 and 324.

  FIG. 4 is a flowchart of the line drawing coloring method according to the present invention. The flow of applying the line drawing coloring method according to the present invention to the portion 32 will be described below. First, starting from step S401, one boundary point is set on the boundary between the region 322 already painted in step S402 and the unpainted regions 323 and 324. Both of these two boundaries are also called the first boundary. The installed boundary points are indicated by point X and point Y in FIG. 3B. The boundary point X and the point Y may be any points as long as they are on the boundary between the already painted region 322 and the unpainted region 323.

Next, in step S403, the boundary point X is traced in two directions along the boundary (first boundary) between the already painted region 322 and the unpainted region 323, and reaches the base lines 321a and 321b of the line drawing. The points at this time are defined as a first start point A and a second start point B. FIG. 3C shows the first start point A and the second start point B.
Similarly, the boundary point Y is traced in two directions along the boundary between the already painted region 322 and the unpainted region 323, and the point when the line drawing base lines 321a and 321b are reached is the first start point. A point C and a second starting point D are determined.

In step S404, starting from each pair of the first start point A and the second start point B or the first start point C and the second start point D determined in step S403, the base lines 321a and 321b of the line drawing and the unpainted areas are left. The boundary between the areas 323 and 324 is traced, and the locus is recorded. The boundary between the base line 321a and the unpainted area 323 and the boundary between the base line 321b and the unpainted area 324 are also referred to as a second boundary. In this example, the second boundary is composed of four boundaries. Here, a point that follows the locus from the first start point A is defined as a first locus point P. Similarly, points that follow the locus from the second start point B, the first start point C, and the second start point D are defined as a second locus point Q, a first locus point R, and a second locus point S, respectively. These trajectory points P to S are shown in FIG. 3D.
In step S404, simultaneously with the recording of the locus, the distance between the first locus point P and the second locus point Q is calculated and the value is recorded. The distance is similarly calculated and recorded for the first locus point R and the second locus point S. The calculated distance is used as an end condition for recording the locus as will be described later.

Next, the condition for ending the recording of the locus will be described. In step S405, it is determined whether the distance between the first locus point and the second locus point is zero. This is called the first end condition. If the first end condition is satisfied, the process proceeds to step S408, and the recording of the locus of the locus point is ended.
In FIG. 3E, since the distance between the first locus point P and the second locus point Q is zero, the recording of the locus of the first locus point P and the second locus point Q is ended.

If it is determined in step S405 that the distance between the first trajectory point and the second trajectory point is not zero, the process proceeds to step S406, and it is determined whether the distance calculated in step S404 exceeds a certain value. This is called the second end condition. The “constant value” in the second end condition can be arbitrarily determined. If the second end condition is satisfied, the process proceeds to step S407, and a paint line L is created at the smallest part of the distance between the locus points. In step S408, the recording of the locus point is ended.
As for FIG. 3E, since the distance between the first locus point R and the second locus point S never becomes zero, the first end condition is not satisfied. Then, as the recording of the trajectory proceeds, the distance between the first trajectory point R and the second trajectory point S exceeds a certain value. That is, since the second end condition is satisfied, as shown in FIG. 3F, a paint line L is created at a portion where the distance between the first locus point R and the second locus point S is minimum. In step S408, the recording of the locus of the first locus point R and the second locus point S is terminated.

  The priority of the first end condition described above can be higher than the second end condition. Considering the shape of the unpainted portion by the conventional method, the distance between the trajectory points before the condition that the distance between the first trajectory point and the second trajectory point becomes zero (first end condition) is satisfied. This is because the condition that the distance of (2) exceeds a certain value (second end condition) is usually not satisfied.

  In this way, until the distance between the first locus point and the second locus point becomes zero (step S405), or the distance between the first locus point and the second locus point exceeds a certain value (step S406), Step S404 is repeated.

  Next, in step S409, the area surrounded by the fill line L created in step S407 and the first base line 321a and the second base line 321b of the line drawing is filled.

  Finally, the procedure ends at step S410. The portion 41 filled in this way is shown in FIG. 3G.

  As described above, the unpainted areas 323 and 324 shown in FIG. 3A are filled. When the method according to the present invention is applied to other unpainted areas in FIG. 2, the line drawing 1 including the colored hair 4 without the unpainted areas as shown in FIG. 5 is finally obtained. Here, the hair 4 includes a portion 41.

  Next, an embodiment of a computer program for coloring a line drawing according to the present invention will be described with reference to the drawings.

  FIG. 6 shows a computer system 6 that executes a computer program according to the present invention. As shown in FIG. 6, the computer system 6 includes input means 611 such as a mouse and a keyboard, display means 612 such as a display, and storage means such as a memory 613. The computer system 6 includes an image reading unit 621, a boundary point detecting unit 622, a starting point determining unit 623, a trajectory recording unit 624, a trajectory determining unit 625, a paint line creating unit 626, and a trajectory recording end instruction. Means 627 and paint means 628 are further provided.

  FIG. 7 shows a flowchart of processing of a computer program for coloring a line drawing according to the present invention. Hereinafter, the flow of applying the computer program for coloring the line drawing according to the present invention to the portion 32 shown in FIG. 3A will be described.

  First, starting from step S701, in step S702, the image reading means 621 reads the line drawing 1 colored by the conventional method shown in FIG.

  In step S703, the boundary point setting unit 622 scans the line drawing 1 stored in the memory 613, and the boundary point is located on the boundary between the already painted area 322 and the unpainted areas 323 and 324 shown in FIG. 3B. Are installed one by one. Both of these two boundaries are also called the first boundary. The installed boundary points are indicated by points X and Y in FIG. 3B. The boundary points X and Y may be any points as long as they are on the boundary between the already painted region 322 and the unpainted region 323.

In step S704, the start point determination means 623 follows the boundary point X in two directions along the boundary (first boundary) between the already painted area 322 and the unpainted area 323, and draws a line drawing. The points when the base lines 321a and 321b are reached are determined as the first start point A and the second start point B, and are stored in the memory 613. FIG. 3C shows the first start point A and the second start point B.
Similarly, for the boundary point Y, the start point determining means 623 follows the boundary (first boundary) between the already painted region 322 and the unpainted region 323 in each of two directions, and the line drawing base line 321a. , 321b, the first start point C and the second start point D are determined and stored in the memory 613.

In step S705, the trajectory recording means 624 starts with each pair of the first start point A and the second start point B, or the first start point C and the second start point D determined in step S704. Trace the boundaries between 321a and 321b and the unpainted areas 323 and 324, and store the trajectory in the memory 613. The boundary between the base line 321a and the unpainted area 323 and the boundary between the base line 321b and the unpainted area 324 are also referred to as a second boundary. In this example, the second boundary is composed of four boundaries. At this time, a point that follows the locus from the first start point A is defined as a first locus point P. Similarly, points that follow the locus from the second start point B, the first start point C, and the second start point D are defined as a second locus point Q, a first locus point R, and a second locus point S, respectively. These trajectory points P to S are as shown in FIG. 3D.
In step S <b> 705, the locus recording unit 624 further calculates the distance between the locus points P and Q, and stores the value in the memory 613. Similarly, the distances for the locus points R and S are calculated and stored in the memory 613. The calculated distance is used as an end condition for recording the track by the track determination unit 625 described later.

In step S706, the trajectory determination unit 625 determines whether the distance between the first trajectory point and the second trajectory point is zero. This is called the first end condition. When the first end condition is satisfied, the process proceeds to step S709, and the trajectory recording unit 624 receives the instruction from the trajectory recording end instructing unit 627 and ends the recording of the trajectory of the trajectory point.
3E, since the distance between the first locus point P and the second locus point Q is zero, the locus recording means 624 receives the instruction from the locus recording end instruction means 627 and receives the first locus point P and the first locus point P. Recording of the locus of the two locus points Q is finished.

If it is determined in step S706 that the distance between the first trajectory point and the second trajectory point is not zero, the process proceeds to step S707 to determine whether the distance calculated in step S705 exceeds a certain value. 625 determines. This is called the second end condition. The “constant value” in the second end condition can be arbitrarily determined. When the second end condition is satisfied, the process proceeds to step S708, where the paint line creation unit 626 applies a straight line portion corresponding to the minimum distance among the distances between the locus points stored in the memory 613. A deadline L is created. In step S709, the trajectory recording end instruction unit 627 instructs the trajectory recording unit 624 to end the recording of the trajectory, and the trajectory recording unit 624 ends the recording of the trajectory.
As for FIG. 3E, the distance between the first locus point R and the second locus point S is never zero, that is, the first end condition is not satisfied. As the recording of the trajectory proceeds, the distance between the trajectory points R and S exceeds a certain value. That is, in step S707, the trajectory determination unit 625 determines that the second end condition is satisfied. Therefore, as shown in FIG. 3F, in step S708, the paint line creating means 626 creates a paint line L at a portion where the distance between the locus point R and the point S is minimum. In step S709, the trajectory recording end instruction unit 627 instructs the trajectory recording unit 624 to end the recording of the trajectory, and the trajectory recording unit 624 ends the recording of the trajectory points R and S.

  As described above, the trajectory determination unit 625 uses the first end condition and the second end condition. Here, the priority of the first end condition may be higher than the priority of the second end condition. This is because, considering the shape of the unpainted portion by the conventional method, the locus point before the condition that the distance between the first locus point and the second locus point is zero (first end condition) is satisfied. This is because the condition that the distance between them exceeds a certain value (second end condition) is usually not satisfied.

  Next, in step S710, the painting unit 628 paints the area surrounded by the deadline L and the base line of the line drawing.

  Finally, the procedure ends at step S711. The portion 41 filled in this way is shown in FIG. 3G.

  As described above, the unpainted areas 323 and 324 shown in FIG. 3A are filled. When the computer program according to the present invention is applied to the other unpainted areas in FIG. 2, the line drawing 1 including the colored hair 4 without any unpainted areas as shown in FIG. 5 is finally obtained. Here, the hair 4 includes a portion 41.

  According to the method according to the present invention and the computer program according to the present invention, it is possible to color a line drawing without any overflow or unpainted color, and to efficiently produce a colored line drawing.

It is a top view which shows an example of a line drawing. It is a top view which shows an example of the line drawing colored by the conventional method. It is explanatory drawing which shows the process in which the unpainted area | region is filled with the coloring method which concerns on this invention. It is a flowchart which shows an example of the procedure of the coloring method which concerns on this invention. It is a top view of the line drawing colored by the coloring method which concerns on this invention. It is a block diagram of the computer system 6 which executes the computer program concerning this invention. It is a flowchart which shows an example of the process sequence of the computer program which concerns on this invention.

Explanation of symbols

1 Line drawing 2 Hair 21, 22 Base line not connected 3 Colored hair 31, 32, 33 Unpainted portion 321a, 321b Line drawing base 322 Already painted area 323, 324 Unpainted area 4 The hair 41 colored by the method according to the present invention 41 The portion of the hair colored by the method according to the present invention 6 Computer system 611 Input means 612 Display means 613 Memory 621 Image reading means 622 Boundary point detection means 623 Start point determination means 624 locus Recording means 625 Trajectory determination means 626 Painted line creation means 627 Trajectory recording end instruction means 628 Filling means 7 Face 8 Background A to D of line drawing 1 Start points P to S Trajectory points X and Y Boundary points

Claims (6)

Coloring for line drawing by a computer functioning as a boundary point setting means, a start point determining means, a trajectory recording means, a trajectory determining means, a trajectory recording end instructing means, a painted line creating means, and a filling means A method,
When the boundary point setting means has a boundary between an already painted area and an unpainted area sandwiched between the first base line and the second base line in the line drawing, a boundary point that defines a boundary point on the first boundary Installation steps;
The starting point determination means follows the first boundary on the first boundary from the boundary point on the first boundary in each of two directions, and each of the points when the first and second baselines of the line drawing are reached is first. And a starting point determination step defined as a second starting point;
The trajectory recording means starts from the first and second start points, and the first and second trajectory points follow a second boundary which is a boundary between the first and second base lines and the unpainted area. A trajectory recording step for recording the trajectory,
A distance calculating step in which the trajectory recording means calculates and records a distance for each combination of a series of first trajectory points and a series of second trajectory points;
The trajectory determination means determines that either a first end condition where the distance between the first trajectory point and the second trajectory point is zero or a second end condition where the distance exceeds a certain value is satisfied . In this case, the trajectory recording unit receives an instruction from the trajectory recording end instructing unit, and ends the trajectory recording step for the trajectory point.
When the trajectory recording step is terminated due to the second end condition, the painted line creating means creates a painted line at a portion of the recorded distance that is the minimum distance; and
A coloring method for a line drawing, wherein the filling means includes a coloring step of filling a region surrounded by the deadline and the first and second base lines with a certain color.   The coloring method according to claim 1, wherein the priority order of the first end condition is higher than the priority order of the second end condition.   The coloring method according to claim 1, wherein the priority order of the second end condition is higher than the priority order of the first end condition. Image reading means for reading a line drawing into memory;
When there is a boundary between an already painted area and an unpainted area sandwiched between the first base line and the second base line in the line drawing, a boundary point on the first boundary is determined and stored in the memory Installation means;
The points when the first and second baselines of the line drawing are reached are determined as the first and second starting points, respectively, by tracing the first boundary in two directions from the boundary point on the first boundary. Starting point determining means for storing in the memory,
Starting from the first and second starting points, the first and second trajectory points follow the second boundary, which is the boundary between the first and second baselines and the unpainted area, respectively, Trajectory recording means for storing in the memory, the trajectory recording means for calculating a distance for each combination of a series of first trajectory points and a series of second trajectory points and storing the distance in the memory;
A trajectory determination means for determining whether either a first end condition where the distance between the first trajectory point and the second trajectory point is zero or a second end condition where the distance exceeds a certain value is satisfied;
If the second end condition is satisfied, a paint line creating means for creating a paint line at a portion that is the minimum distance among the distances stored in the memory;
A trajectory recording end instruction means for instructing the trajectory recording means to end recording of the trajectory point when the first end condition or the second end condition is satisfied;
Painting means for painting a region surrounded by the paint-stop line and the first and second base lines with a certain color;
Cause a computer to function as a computer program for the color of the line drawing.   The computer program according to claim 4, wherein the trajectory determination unit determines the first end condition in preference to the second end condition.   The computer program according to claim 4, wherein the trajectory determination unit determines the second end condition in preference to the first end condition.