JP2791017B2 - Area processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial applications]   The present invention is applied to a coordinate input device in an image processing apparatus.
The method relates to a method of processing a force area. (Prior art)   Conventionally, one of the methods to specify an area is to set a rectangular area diagonally
How to specify with two end points on the line, and further specify
When the area is a combination of rectangles (hereinafter referred to as uneven areas)
Then, there is a method of sequentially inputting the corner points.   In such an input method, the horizontal and vertical
Switch the image processing content with the direction change point as the boundary.
Method is used.   However, the complex combination of multiple rectangles
It was difficult to perform image processing on the area. [Problems to be solved by the invention]   Therefore, a method of performing image processing on an area with a complicated shape
As a way to have bitmap memory for editing work
Conceivable. This corresponds to the image reading area as shown in FIG.
Write the contents of the specified area to the
While referring to this bitmap memory,
Perform control. With this method, multiple images that perform different image processing
There is an advantage that the area can be easily processed. But on the other hand,
Extremely large memory capacity required for Tsutmap memory
There is a disadvantage that. As an example, an image of A4 (296 x 210)
To process a single image with a resolution of 0.5 mm x 0.5 mm in the area
Then, about 250,000 bits are needed. Also, this process is real
・ It is difficult to process in time. 〔Purpose〕   The present invention has been made in view of the above points, and has a complicated shape.
Image processing can be easily performed on the designated area
To make the area storable with a small amount of memory.
It is an object to provide an area processing method.   That is, the present invention provides a main / sub scanning method using a coordinate input device.
Rectangle specified to be surrounded by horizontal / vertical segments
Area of the image processing device that performs desired processing on a closed area different from
In the area processing method, a closed area different from the specified rectangle
Memorize the coordinates of the plurality of corners of the
Into a plurality of rectangular areas based on the coordinates of the
Divide and generate coordinates representing multiple divided rectangular areas
In the area processing method. 〔Example〕   Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings.
You.   FIG. 1-2 is an external view of a copying apparatus to which the present invention can be applied.
is there. The original reading unit 101 includes an original platen glass (not shown) and an illumination lamp.
2: 1 optical system consisting of pump and mirror, lens, CCD, etc.
The optical system photoelectrically converts the original image while performing sub-scanning, and
Output as a signal. The print unit 102 is a so-called laser
-The printer receives the electric signal from the reading unit 101 and modulates it.
Electrophotography by scanning the photoreceptor with the laser beam
Print by method. The reading unit 101 is an operation unit 103,
A coordinate input device 104 and a coordinate input pen 105
You. FIG. 1-1 shows a diagram of the coordinate input device 104 viewed from above.
Show. 106 is the effective coordinate input surface, 107 is the original 114 as the input surface
Abutment reference point for placing, 108 is to specify the area
Key is used to input a series of input coordinates.
Clear key 110 to cancel input of area designation
OK key, 111 is a trimming mode that outputs only the specified area
Mode selection key, 112 is a maskin that erases only the specified area
Key 113 selects the inside of the designated area from the outside.
Is an image separation mode selection key output in the following processing.   Examples of these operations will be described.   The operator pushes the document 114 to the reference point 107 as shown.
Touch and place, enter the area designation mode by key 108,
For example, the black circle in the area surrounded by the dotted line by the input pen 105
Enter each corner clockwise or counterclockwise and then OK
Press key 110 to complete the entry. Then, in the designated area
The contents of processing to be performed on each key are 111, 112 and 113.
To instruct.   FIG. 3 is a schematic block diagram of the copying apparatus according to the present embodiment.
You. Reference numeral 302 denotes an image reading unit. The image reading unit 302 is a CCD,
Signal amplification circuit, A / D conversion circuit, and shading correction circuit
The corrected signal is input to the image processing unit 303.   The image processing unit 303 temporarily stores the image signal in the shift memory
After that, zooming, moving, trimming / masking density conversion, etc.
Performs image processing and outputs the result as an external unit as a VIDEO signal.
It is output to the title 312. The external unit 312 is used in this embodiment.
A so-called laser printer is assumed, but electronic
Controllers and memory devices such as files and fax machines
Is also good. External unit is connected to image signal V via cable 313.
Other than IDEO, for example, a serial signal line consisting of multiple signal images
Performs serial signal by SRAL and controls the entire system
You. Preset when the external unit 312 is a laser printer
Receives the horizontal synchronizing signal BD from the
Clock for internal operation is generated by 304 and read as described above.
This is given to the unit 302 and the processing unit 303.   CPU 301 is a ROM3 that stores control programs and control data.
05, RAM 306 for storing processing data, etc., timer times
A reading unit 302, a processing unit 303, and an external unit.
Fluorescent light for document illumination, in addition to controlling communication with the printer 312
Motor driver for driving driver circuit 309 and optical system
It controls the circuit 308, the operation unit 311 and the coordinate input device 310.
You.   FIG. 4 shows a block diagram of the coordinate input device 310.   The timing circuit 402 is clocked by the built-in oscillator.
The address is generated and given to the address counter 403. Address
The counter 403 is pressed when a switch built in the pen 412 is pressed.
While you are, the cout works. During the count operation, first X
The decoder 409 operates, and the pulse voltage is sequentially applied to the X on the input surface 411.
Two-way dynamic scan on the direction electrode, and then Y deco
The pulse voltage is sequentially applied to the input surface 411 in the Y direction.
A two-cycle dynamic scan is performed on the direction electrode. Input surface 411
When the pen switch is turned on, the switches in the X and Y directions
When the can reaches the pen position, the pen
Voltage is induced in the input signal of the pen
Amplified by 4. X-direction scan first pen input
The count value is set in the X register 406 by the signal,
X register 406 according to pen input signal during second scan
And the count value are compared by the comparator 405 to find a match.
Then, a match signal is output to CPU 401. Similarly in the Y direction
Also, the Y register 408 is set during the first scan.
Are compared in the second scan time comparator 407
If a match signal is output to the CPU 401, the CPU 401
When a match signal is obtained, fetch the coordinate values from the X and Y registers
Communication to the main CPU 301 by, for example, serial communication.
I can know. Note that if the X register 406 matches the counter value,
If there is no input, it is determined that the input is invalid. The same is true for the Y direction.
You.   FIG. 5 shows the inside of the image processing unit 303, in particular, the shift memory.
FIG. The shift memory has two lines.
Minute shift memory is provided, but its control is common.
Therefore, FIG. 5 shows only one shift memory,
The control configuration will be described. The write address counter 904 is
Address counter when writing data to the shift memory 907
Then, the read address counter 905 reads from the shift memory 907
This is an address counter for reading data. Ad
The selector 906 sends a command from the CPU 301 to the I / O port 901.
Via the write address counter 904
Signal and address signal of read address counter 905
Select one of them and address shift memory 907
It is for. I / O registers 902 and 903 are write address
Counter 904 and read address counter 905, respectively.
This is a register for the CPU 301 to give a preset value.   Write address counter 904, read address count
905 are both down counters and count operation
WST and RST signals to start
Also, write clock WCLK to shift memory 907 and shift
The read clock RCLK from the memory is input.   915,916 are exclusive OR gates to determine the image area,
The signal OF is a signal for controlling the signal OF.
2.Mask the inside of the frame determined by EN counter 913 and output outside the frame
Image, and the inside of the time frame of 0 is set as the output image and the outside of the frame is masked.
You.   Reference numeral 910 denotes a density processing unit 908 output from the shift memory 907.
Output control of image data that has become a binary signal
Whether the gate and 917 output the aforementioned mask part as white
An AND gate that determines whether to output as black, BB
A black signal is output when the signal is 1 and a white signal is output when the signal is 0 according to a signal for controlling the signal.   911 VIDE the image output output by gates 910 and 917
OR gate that outputs as O
Exclusive OR gate that controls inversion, IN is a signal that controls it
When the value is 1, the image is the original image. When the value is 0, the image is inverted.
Each signal is output by CPU301 according to the mode specified by the operator.
Output.   ST counter 912 and EN counter 913
Start bit counter to output an image only to the area
And end-bit counters, which are accessed via I / O.
OPU301 presets count data for gate
You.   The flip-flop 914 counts up the ST counter 912.
Set by the counter and reset by the count-up of EN counter 913.
Set.   For example, when the OF signal is 1, the ST counter 912 counts
The output of the gate 915 when the Q of the F / F 914 becomes 1 at the tip becomes 0
Gate 910 until the EN counter 913 counts up.
Is not output and is masked. Gate 916 instead
Since the force is 1 during that time, when the BB signal is 1, gate 917 is 1
Thus, the gate 911 outputs 1 to be a black mask. Conversely OF
When = 1 and BB = 0, a white mask is applied. If OF = 0, then
The output of 915,916 is 1,0 during that time, so BB = 1
Is black outside the trimming area, and trim when OF = 0, BB = 0.
The area outside of the switching area becomes white.   Now, this embodiment uses the above-described means to make a rectangular image.
Or trimming or masking the area combining rectangles
This is effective when performing editing processing such as King.   Rectangle or rectangle combination area is main / sub scanning
Area enclosed only by segments equilibrium or perpendicular to the axis
It is important to limit editing to such areas.
Is practical enough and does not require the use of
In that it can provide editing functions at low cost
Useful.   Based on these limitations, the operator can
Enter coordinates discretely so that they surround
Are connected to the main / sub scanning axes as much as possible
Input shall be flat or vertical.   However, in practice, freehand pen input
Entering two points that are connected more horizontally and vertically is the coordinate
Since it is impossible from the practical resolution of the input device,
The operator's input coordinates are corrected in the following procedure.   FIG. 2 shows a schematic example of the area designation method according to the present embodiment.
I do. First, clear all the coordinates that have already been set
Press the clear key. 1st point P₁(PX₁, PY₁). 2nd point P_Two(PX_Two, PY_Two). This time,   | PX_Two−PX₁| And | PY_Two−PY₁Compare |   | PX_Two−PX₁| ＞ | PY_Two−PY₁| So input point P_TwoAs shown
T_Two(TX_Two, TY_Two) = (PX_Two, PY₁). 3rd point P_Three(PX_Three, PY_Three). At this time, the corrected
2 points T_TwoAnd the third point P_ThreeTo | PX_Three−TX_Two| <| PY_Three−TY_TwoBecomes |
Therefore, as shown in the figure, P_ThreeTo T_Three(TX_Three, TY_Three) = (PX_Two, PY_ThreeLike)
to correct. 4th point P_Four(PX_Four, PY_Four) Also corrected third point T_ThreeT compared to_Four
(TX_Four, TY_Four) = (PX_Four, PY_Three). Similarly, 5th point P_Five(PX_Five, PY_Five) Is T_Five(TX_Five, TY_Five) = (PX_Four, PY_Five)
To 6th point P₆(PX₆, PY₆) Is T₆(TX₆, TY₆) = (PX₆, PY_Five)
Correct to. After entering each corner of the desired area, press the OK key.
Push. 1st point P when OK key is input₁(PX₁, PY₁) And corrected
Final point T₆= (TX₆, TY₆) = (PX₆, PY_Five) To end point processing described later
The first point P₁(X₁, Y₁T)₁(TX₁, TY₁) = (PX₆, PY
₁).   The operation is performed by correcting and controlling the input coordinates in the above procedure.
The desired area can be composed of vertical segments and vertical segments.
it can.   FIG. 6 shows a detailed flowchart of the above-described correction processing.
You. First, the counter i on the RAM indicating the number of input coordinate points is cleared to 0.
Rear (601). If there is a coordinate input (602), the X component
To the area PXi, TXi on the RAM and the Y component to PYi, TYi
Set (603). If i = 0, that is, the first point (60
4) Increment counter i to wait for the input of the second point.
(615). If i ≧ 1 (604), one point before correction
Completed coordinates (TXi_-1, TYi_-1) And the input coordinates (PXi, PYi)
The absolute values α and β of the differences for each of the X and Y components are obtained (605).   The operator must make the line connecting the points as horizontal as possible
Based on the assumption that the input is vertical, α and β
The size is compared (606). If α <β, the operator is Y
Judging that you tried to input coordinates so that they are parallel to the axis
The Y coordinate PYi of the point Pi is adopted as it is as TYi, and the X coordinate PX
i is the X coordinate TXi of one point before canceling_-1As TXi
(608). Conversely, if α / β, the operator moves to the X axis.
It is determined that coordinate input has been performed so that
The X coordinate PXi is adopted as it is as TXi, and the Y coordinate PYi is
Y-cell Y-coordinate TYi just before_-1Adopt as TYi
(607). The input point Pi is corrected to Ti by the correction of 607 and 608.
The line segment Becomes parallel to the X-ray or Y-axis, then the line segment And the previous line segment Check whether are orthogonal. If i = 1, only one line segment
Since it is not generated, the counter i is set to 1 to wait for the third point input.
Increment (609,610,615). TXi if i ≧ 2
_-2= TXi, that is, the same line segment where the two line segments of interest are parallel to the Y axis
Above or not (612) or TYi_-2= TYi or note
Whether the two line segments of interest are on the same line segment parallel to the X axis
Check (611) and if NO, wait for next input
Increment i by 1 (615). If yes this
To combine two lines into one line A new sum vector (613,614). That is, the input Ti one point before_-1To
Cancel and Ti to Ti_-1And wait for Ti input again
Therefore, the counter i is not incremented, and the next coordinate is waited.
One. Increment counter i to wait for new input
After that, the latest input point Ti_-1Line segment generated by Are all the segments that have been entered so far Check how many times it crosses with (616). Details
The detailed flow will be described later.   If there is no intersection as a result of intersection detection, wait for the next coordinate input.
(617,602). Tis if they cross more than once_-1Nothing
Counter i is decremented by 1 to wait for re-input.
(617 → 619). If you only cross once
Ends the area specification because one closed area was generated
Key input or point Ti for_-1To cancel
Wait for the rear key input. If there is clear key input, cow
The counter i is decremented by one and waiting for re-input (618 → 619).
If there is an OK key input, the process proceeds to the end point process described below (62
Four).   When there is no coordinate input in step 602, clear key
If there is an input, the latest input point Ti_-1Cancel and re-enter
In order to wait for the force, the counter i is decremented by 1 (623). O
If there is a K key input (624), the process proceeds to end point processing described later (62).
Four). When the result area of the end point processing is determined, the process ends, and it is not determined
If so, wait for the coordinate input or clear key input again.   FIG. 7 shows a control flow of intersection detection, which will be described below.
You. First, clear the counter k on the RAM indicating the number of intersections to 0
(701). When i <4, only 4 points or 3 sides are included
Since the power has not been input, the detection process ends. When i5
Set i-4 to the counter j on the RAM for the cross check.
(703). Then point Ti_-1, Ti_-2, Tj, Tj_-1The coordinates of
The values A, B, C, and D are obtained using the values (704, 705, 706, 707). Value calculation
The following function F is used.   F (Tm, Tn) =-1: When TXm = TXn or TYm = TYn                   0: When TXm <TXn and TYm <TYn                   1: When TXm <TXn and TYm => Yn                   2: When TXm> TXn and TYm> TYn                   3: When TXm = TXn and TYm <TYn   Function F classifies the positional relationship between two points Tm and Tn into five cases.
The values are assigned as shown in FIG. Ie
Vector generated from two points Tm and Tn Is "-1" when is parallel to the X or Y axis, and "0" when it is to the upper right
"1" when going up left, "2" when going down left, and when going down right
This function outputs “3”.   If any one of the values A, B, C, D has "-1"Update j because they touch but do not intersect
(708 → 709). Without “−1”, like below 711-718,
The values A, B, C, and D are the values “0”, “1”, “2”, “3” in ascending order.
Or whether to take the value rotated in descending order
Find out. FIG. 9 shows an example in which YES is determined in step 711.
I can.   The example shown in Fig. 9 is now rotated by 90 ° clockwise by 90 °.
There is a positional relationship between the four points determined as “YES” in 2,713,714.
Also, referring to the example of FIG. When the positional relationship is symmetrically folded back to step 715, YES
Judgment, and then rotate 90 ° counterclockwise each time
"YES" is determined for each of 716, 717, and 718. The above eight
Intersect at step 719 when it is determined to intersect in the case
Increment the counter k by one, Crossed Is set to l. Stets
J is updated in step 709, and until j <0 in step 710,
Continue Etsuk.   In step 709, decrementing j by 2 is only 1
When you increment Because it is parallel.   FIG. 12 shows an end point processing flow, which will be described below.   First, the counter i is checked (1001), and if i <2
Since there are only two points at most, the area is not fixed
(1012) The process ends to wait for the point input again. If i3
1 decrement so that the counter i value indicates the latest input point number.
(1002).   Then start point T₀From the second point T₁Vector to The direction code Do is determined based on FIG. 10 (1003).
Point Ti to the latest point Ti_-1Vector from Direction code Di_-1Is similarly determined (1004). afterwards,
According to the end point processing type table shown in FIG.
Direction codes Do and Di_-1And coordinates TX of point To₀, TY₀And point Ti
End point processing type based on the coordinates and positional relationship of the four targets TXi and TYi
Is selected and processing is performed according to the processing contents described in Table 1.
(1005).  Examples of corrections for each type of processing described in Table 1
As shown in FIG. It was newly decided by applying the processing of Table 1.
Side ▲ ▼ is created by start point (Sp) To and end point (Ep) Ti
And the sides ▲ ▼ and side If it is at right angles, there is no need for reprocessing, but it is not
In this case, step 100 is performed again using the corrected To, Ti, and i.
Perform the following processing (1006 → 1001).   Use the above procedure to determine the coordinates of each corner that can constitute the area.
Line segment that connects each point from To to Ti in order
Do not intersect each other.
Executes in accordance with each side (1007), and intersects even one place
When you do, make the area indefinite and wait for point input again or clear key
Wait for input point cancellation by input (1008 → 1012).   In step 1009, the Y component
In the point where the minute shows the minimum value, the X component is the minimum
Is defined as the region origin (1009), and the region origin Ts is defined as
Again as a To, a dot sequence clockwise from the new To below
Follow T₁, T_Two,…, Ti and new numbers (1010)
The area is determined (1011), and the area specification ends.   The processing example of steps 1009 and 1010 is shown in FIGS. 11-1 to 11-3.
Shown in the figure.   By the way, input the corner points of the uneven area sequentially.
Method, the change point is the change point at the start of each image processing.
It is difficult to determine whether the change point is the end point or the end point. No. 16
When the uneven area shown in Fig. 1 is specified,
Information to indicate is required. However, this area is shown in FIG. 16-3.
As shown in Fig. 16-2, if you input by dividing into three rectangles
The information shown can be obtained immediately. Below, the method of dividing the rectangle
Will be described. [Rectangular division]   Enables image processing by area and processing of uneven areas
Input data into a set of data at the two diagonal ends of the rectangle.
Need to convert. Also, in terms of memory saving, the division is
It needs to be done optimally.   Fig. 17-1 One method of optimally dividing uneven areas
Is shown. When humans think like this, the vertical line or
Can be optimally divided by only one of the horizontal lines. Real truth
In the embodiment, a method of dividing the vertical line will be described.   The rectangular division processing is performed by the algorithm shown in FIGS. 18-1 to 18-4.
Execute based on the algorithm. Below are the necessary quantities for this
Shown in PBXOO (input data): The order in which the Y and X values of the input point were input
Is in. This is calculated as X in the line segment whose Y value is the minimum value.
The point with the larger value (shown in Fig. 17-2) is the origin,
Sorted around. SCD TBL: Saves the attributes (described later) of each input point when searching for paired points.
This is a work area for cutting (Fig. 19-1 and Fig. 19-
2). The paired points are two points that form the diagonal of the divided rectangle
Is shown. In this embodiment, 16 × 16 (byte) is allocated. AREA POINT CNT: Indicates the number of input points. For the end point processing
Therefore, it is always an even number.   Where the attributes of the point ・ All designated points… All input points ・ Remaining designated point: Of all designated points, also constitutes a paired point
of. Note that the remaining designated points are included in all designated points. -New candidate point: Y in the horizontal line segment forming the uneven area
All points on the value change point. -New decision point: A pair point is constructed from new candidate points.
thing. Note that a new decision point is included in a new candidate point.   The above four attributes are defined.   Further, the direction of the point is defined as follows.   The point where the current pointer is located (all designated points) is Pi, and Y of Pi is
When the coordinates are YPi,   When YPi−YPi + 1> 0, lower the direction flag (PNT DRF)
Set   When YPi−YPi + 1 <0, raise the direction flag (PNT DRF)
Set The direction is determined with reference to a direction flag.   In this embodiment, the maximum number of points that can be input is 30 points,
As a result, the number of rectangles that can be divided becomes 15. Therefore,
The maximum number of change points is set to 15 in both the X and Y directions.   Each process performed by each flow shown in FIGS. 18-1 to 18-4
Will be described. (1) SCD TBL SET1: Based on input data, all designated points,
Set the remaining designated point and new decision point in SCD TBL.   First, the pointer (i) is reset, and the pointer
(2-1). Determine the direction of a point
Set the direction flag up or down (2-2).
Pointer at the point where all specified points and direction flags
The direction is set (2-3).
Points include remaining designated points (also designated all points) and direction flags.
The direction corresponding to the setting is set (2-4). In addition,
It is determined whether there is a change point in the Y direction between the two points (−2).
5) If there are any points, set new decision points and directions.
(2-6). Finally, the pointer counter (i) is
Increase by 2 (2-7).   The above operation is repeated for the number of input points (2-8). (2) SCD TBL SET2: Set by the above SCD TBL SET1
Points that are unnecessary for rectangle division among new decision points
And downgrade.   First, the counter 1 is reset to 0 (3-1).
Set as a new decision point in SCD TBL SET1
If the directions of adjacent new points are different within the same Y value,
Demote both points from the new decision point to the new candidate points (3-
2). Then, the counter l is incremented by one (3
-3). This is repeated until the maximum value of the SCD TBL coordinates reaches 15.
Return (3-4), then clear counter l to 0 again
(3-5).   Then, when looking at the attributes of adjacent points within the same Y value, Upward and below all designated points (including remaining designated points)
There is a new candidate point for the direction. All specified points in the upward direction and next to the new candidate point in the downward direction (remaining
(Including existing points).   In these cases, the new candidate point is used as the new decision point again.
Set (3-6). Then, pointer 1 is
It repeats until 1 = 15 (3-8). (3) PAIR POINT: Pair points based on the contents of SCD TBL
Search for.   "The points that make a pair are the remaining designated points or new decision points,
Upward point and downward point at the shortest upper right diagonal distance
Form a pair This is the basic principle of pair point search.   The algorithm of FIGS. 18-3 and 18-4
In order to handle the designated input as shown in Fig. 17-3,
Expand the conditions of point search, One of the remaining designated points or the new decision point,
Make a pair. The starting point is the point on the left of the two diagonal points and the end point is the right point.
The point is located diagonally to the right of the starting point. However, with the same X value
, The upper right diagonal point has priority over the lower right diagonal point.   These two conditions are defined.   Note that Sk is a starting point Y counter, Sl is a starting point X counter,
Let Ek be the end point Y counter and El be the end point counter.   First, the counters Sk and Sl are cleared to 0 (4-1, 4-
2) Search for a point that satisfies the conditions of the start point of the two end points of the rectangular area
(4-3). What are the conditions Remaining designated point or new decision point Unused point (the starting point or
Point not registered as end point) It is to be.   Next, an end point corresponding to the found start point is searched (4-
4).   To search for the end point, first find the Y coordinate where the end point exists.
Then, find the X coordinate.   At the same X coordinate value as the position where the start point is located,
(Large Y coordinate), all specified points of the shortest distance (remaining specified points
) Or a new decision point, and use this as the criteria for the end point search.
(5-3, 5-12). If found, the position of the reference point
The X value is increased one by one from (5-4), It is an unused point. Start point and direction are reversed Remaining designated point or new decision point   A point that satisfies all of the above end point conditions is searched (5-5).
If not found, decrease the X value by one from the reference point
Similarly, find the end point (5-6, 5-7, 5-8). End condition
If a point that satisfies is found, that point is determined as the end point.
Then, the X coordinates of the start point and the end point are exchanged (5-9). Further
If not found, the Y value of the reference point is increased by 1 (5-
10), start again from the reference point search as before. Entering
Since force coordinate correction processing and end point processing are performed,
One start point always corresponds to the start point. Find start and end points
If so, set the specified flag on these two points and (5-
11) Find the next pair point.   After the above processing, the coordinate information of the uneven area is
Converted to a set of endpoints.   Next, the case where the area as shown in Fig. 20-1 is specified
This will be specifically described by way of example.   Specify the area shown in Fig. 20-1 and perform end point processing.
At the end of data sorting, the input quantities are
Become like PBXOO… 60,10,60,20,50,20,50,40,70,40,70,60,60,60,6
0,70,50,70,50,50,10,50,10,20,20,20,20,40,40,40,40,
30,30,30,30,10 AREA POINT CNT… 18   Based on this, set the SCD TBL.   Fig. 20-2 shows the area of Fig. 20-1 transformed into the coordinates of SCD TBL.
FIG.   When the SCD TBL SET1 shown in Fig. 18-1 is completed
The state of the SCD TBL is shown in Fig. 19-1 and the SC shown in Fig. 18-2.
The state of SCD TBL at the end of D TBL SET2 is shown in Chapter 19.
-2.   Based on the SCD TBL in the state shown in FIG.
Perform a search.   First, (2,0) (located on SCD TBL shown in Fig. 19-2
A point that satisfies the condition of the starting point is found at (marker).   So, if you look to the right of the starting point, there is an end point at (2,1).
Find a reference point to search for.   Next, when searching above the reference point, (5,1)
There is a point having an end point condition corresponding to the start point of. Yo
Then, these two points are registered as a pair and used.   When the start point search is started again, the second start point is set at (0,1).
You can find a point, and in the same way
We find point A.   By performing a pair point search in this way, the following
A set of such rectangular area 2 end point data is shown in Fig. 20-1.
And is divided into seven rectangular regions.   By dividing the specified area into rectangles as described above
For example, in the case of the area shown in Fig. 20-1,
Is defined by 14 points, and the storage of area data is
This helps save memory capacity and the time required for transmission.
In addition, such complex areas as trimine
This also facilitates the control of the processing.   To edit the divided area as shown in Fig. 20-1
For example, as you can see on the main scanning line at Y = 30
In two sections of X = 10-20 and X = 30-50, for example, trim
In such a case, it is necessary to perform
Counters 912,913 and gates 909,910,915,916,9
This can be achieved by holding at least two sets of 17. Now two sets of couns
912 and 913 as ST counter 1, EN counter 1 and ST counter
2, if EN counter 2 is used, the area shown in Fig. 20-1 is trimmed.
When the optical system reaches Y = 10, the ST counter 1
30, set 60 to EN counter 1, set ST counter 2, EN counter
The same value is set in data 2. Next, the optical system reaches Y = 20
When ST counter 2 is set to 10, EN counter 2 is set to 20, EN counter
Set 50 in data 1. Further, the optical system reached Y = 30
Hour ST counter 1 is 10, EN counter 1 is 70, counter 2 is
Set the same value and control the counter in the same procedure.
Then, the desired editing can be performed. (Effect)   As described above, according to the present invention, the coordinate input device
More surrounded by horizontal / vertical segments in each of the main / sub scanning directions
Multiple corners of a closed area different from the rectangle specified in
And store the coordinates of the corners based on the stored coordinates of the plurality of corners.
Then, the closed area is divided into a plurality of rectangular areas.
By generating coordinates representing a plurality of rectangular areas,
Easy image processing even for complex designated areas of right-angled polygons
Can also be done, like bitmap memory
Even if a large capacity memory is not used,
Marks can be stored.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1-1 shows a coordinate input device, FIG. 1-2 shows an external view of a copying apparatus to which the present invention can be applied, FIG. 2 shows an example of coordinate correction, 3 is a schematic block diagram of the entire apparatus, FIG. 4 is a block diagram of a coordinate input device, FIG. 5 is a processing block diagram relating to editing, FIG. 6 is a control flow chart of input coordinate correction, and FIG. 7 is intersection detection. FIG. 8 is an explanatory view of a box machine F used for intersection detection, FIG. 9 is an example of intersection, FIG. 10 is a direction code diagram of an area side, and FIGS. 11-1 to 11-3 are FIG. 12 is a diagram illustrating an example of rearrangement of input point sequences, FIG. 12 is a flowchart illustrating an end point processing control after coordinate input is completed, FIG. 13 is a diagram illustrating an end point processing type table, FIG. The figure shows an example of a pit map memory for area editing, and FIGS. 16-1 to 16-3 are rectangular. FIG. 17-1 to FIG. 17-3 are conceptual diagrams of rectangular division, FIG. 18-1 to FIG. 18-4 are flowcharts of rectangular division processing, FIG. FIG. 19-2 is a diagram showing a schedule table (SCD TBL) used for rectangular division, FIG. 20-1 is a diagram for explaining rectangular division, and FIG. 20-2 is a diagram showing the region of FIG. It is the figure converted into the coordinates of the table. 104 is a coordinate input device, 105 is a coordinate input pen, 106 is an effective coordinate input surface, 912 is a start counter, and 913 is an end counter.

Claims (1)

(57) [Claims] In an area processing method of an image processing apparatus for performing a desired process on a closed area different from a rectangle, which is specified by a coordinate input device so as to be surrounded by horizontal / vertical segments in each of the main / sub scanning directions. The coordinates of a plurality of corners of a closed area different from a rectangle are stored, and the closed area is divided into a plurality of rectangular areas based on the stored coordinates of the plurality of corners, and coordinates representing the plurality of divided rectangular areas are obtained. A region processing method characterized by generating. 2. 3. The method according to claim 1, wherein the closed area is divided into a plurality of rectangular areas based on coordinates of a plurality of corners of the closed area and a directional component of a vector generated by sequentially connecting the corners. Area processing method to be used.