JPH0736146B2 - Random vector processing method - Google Patents

Description

The present invention relates to a raster scanning type output device such as an electrostatic type, a laser type, a thermal type, etc., in which each graphic element data string to be output is output. The present invention relates to a processing method when input is performed in an order that is not arranged at all with respect to a drawing position.

[Conventional technology]

Recent computer-based graphic processing systems (eg CAD
, Etc. are becoming more popular and higher in performance, it is necessary to speed up and reduce the cost of drawing devices in computer systems. One of the means is the conventional pen-type xy plotter (machine-driven vector scanning automatic drafting machine). In place of the above), various raster scanning type drawing devices which do not depend on the drawing data and have a relatively short drawing time have been developed and known.

Normally, in the case of such a raster scanning type drawing device, based on the same concept as the raster scanning type graphic display, a raster image storage device (hereinafter referred to as a frame memory) corresponding to the entire drawing region is placed and input. A method of sequentially performing vector raster conversion processing on graphic element data, expanding it on the frame memory, detecting the end of the graphic element data, then switching the frame memory to raster output mode and outputting at once. Is taken.

However, in such a drawing device, a device having a raster resolution capable of replacing the conventional pen type xy plotter has a large capacity in order to store the entire drawing region in the frame memory. It is not practical to scale up.

There is also a method in which a large-capacity external storage device (for example, a fixed disk) is placed as a frame memory, but the speedup cannot be realized due to random access during vector raster conversion.

As a means to avoid them, paying attention to the fact that the scanning speed of the drawing device is relatively slow and the drawing time is required, two or more relatively small frame memories are placed, and only the small frame memories are vector rastered at the time of drawing. A method is used in which conversion processing is performed, and the contents of the corresponding frame memory are raster-output at the time in synchronization with the drawing time of the drawing device.

However, the graphic element data input to the device is naturally assumed to be a pen-type xy plotter, and it is usual that the arrangement order of the data is not considered at all regarding the position where the data is output. Therefore, in the case of this method, it is necessary to extract the graphic element data existing at the drawing-out position corresponding to the frame memory to be subjected to the vector raster conversion processing by some means, and perform the processing in the drawing-out order.

However, it is generally necessary to "sort" (hereinafter referred to as "sort") or "allocate to a small area" (hereinafter referred to as "mapping") the uniform and large amount of graphic element data for all the graphic element data. Since these processes still require a large storage capacity and computer time, it cannot always be said that the method for realizing the original purpose of large-scale high-speed drawing is realized, and a faster and simpler random vector processing method is desired. Was there.

[Problems to be solved by the invention]

The contents of sorting and mapping that have been adopted so far will be described below.

First, sorting means rearranging random vector data in the order of output, which will be described with reference to FIGS. 6 and 7.

FIG. 6 is a diagram showing an example of an output graphic by a vector plotter, and FIG. 7 is a diagram showing an example of an output graphic by a raster plotter, showing a case where the same A-shaped graphic is output. The x-axis indicates the vertical direction (paper conveyance direction), and the y-axis indicates the horizontal direction (direction perpendicular to the paper conveyance).

In the case of the vector type (pen type) plotter shown in Fig. 6, the following data are given: point P1 → point P2 line segment; point P2 → point P3 line segment; point P4 → point P5 line segment. , Given data as figure output,
, In order, from point P1 to point P2, from point P2 to point P3, point P4
Draw from to point P5. As described above, the vector plotter may perform the processing sequentially in the input order, but the raster plotter must perform the processing in the order according to the paper conveyance direction. That is, in this example, the data should be processed before the data, and the data should be processed not as the line segment of the point P4 → point P5 but as the line segment of the point P5 → point P4.

Therefore, in the case of the raster plotter shown in FIG. 7, the sort process is performed to change the order of the data, and the contents thereof are also changed as follows.

A line segment from point P1 to point P2; a line segment from point P5 to point P4; a line segment from point P2 to point P3 After such processing, the raster plotter performs drawing in the order of the sheet conveyance direction.

The problem with this method is that in order to perform this rearrangement process for a large amount of ordinary drawing data, not only the same storage capacity as the input is required for output, but also a relatively large storage capacity for work is required. Moreover, since all the data are compared and checked, the calculation time becomes enormous. Therefore, it is not practical to perform this processing on the normal device side in terms of computer resources, scale, and price.

Next, the mapping is to cut out and group the data existing in each rectangular area corresponding to a relatively small frame memory for output, using FIG. 6 and FIG. Explain.

When the figure by the vector plotter shown in FIG. 6 is output by the raster plotter, the entire output area is divided into rectangular areas I, II and III corresponding to a small frame memory as shown in FIG. Then, for each input data, it is checked which rectangular area corresponding to the small frame memory is included, and the divided rectangular area is stored.

At this time, regarding the data over a plurality of rectangular areas, in this example, the data and the data are rectangular areas I and II, respectively.
And II, III, but their boundary points Q1 and Q2
The data is divided by, the data is processed, and each rectangular area is grouped as follows.

Group I; data; line segment from point P1 to point Q1 group II; data; line segment data from point Q1 to point P2; line segment data from point P2 to point Q2; line segment from point P4 to point P5 group III; data Line segment from point Q2 to point P3 When "cutout" and "grouping" are completed for all the data by such processing, the rectangular area may be vector raster-converted and output.

As a problem with this method, a huge amount of calculation time is still required to perform this intersection processing calculation for all of a large amount of ordinary drawing data. Further, the grouped format data is naturally required to have a larger capacity than the input storage. Therefore, it is not practical to perform this processing on the normal device side in terms of computer resources, scale, and price.

The present invention, in view of the above conventional drawbacks, when inputting a random vector data sequence created for a vector plotter, does not require heavy processing such as sorting or intersection calculation for all data, and It is an object of the present invention to provide a processing method for enabling raster drawing at high speed on the device side with a small-scale hardware.

[Outline of Invention]

The random vector processing method of the present invention is applied to all rasters in a processing order when outputting to a raster scanning drawing device in a raster scanning drawing device having a raster scanning drawing device, a control microprocessor and a storage device. A chain pointer table area (2b) that can store the corresponding chain pointer, and a chain pointer (2c
1) with random vector All graphic element data (2c
Reserve a graphic element storage area (2c) for storing 2).

Graphic element data (2c2) is sequentially stored in graphic element storage area (2c)
When storing, the chain pointer table area (2b) and the chain pointer (2c) attached to each graphic element data (2c2) stored in the graphic element storage area (2c) are stored.
1) By the graphic element data storage means that combines with and reflects it in the processing order.

To explain this concretely, before starting the reading of the graphic element data from the control microprocessor (1), the contents of each storage address of the chain pointer table area (2b) are set to #N, and the value of that address is set. Be designated as #N.
Next, the graphic element data is sequentially stored in the graphic element storage area (2c), but the contents of the address of the chain pointer table area (2b) corresponding to the first x-axis position of the graphic element are stored in the graphic element data. It is attached as a chain pointer, and the storage address of the graphic element data is stored in the storage address of the chain pointer table area (2b). This work is called implementation of chain means.

After storing all graphic element data in this way,
The entire drawing area is divided into rectangular areas (I, II, III) corresponding to the small frame memory area (2d), and the graphic element data in the graphic element storage area is stored in the frame memory area (2d). The number of frame memory areas (2d) may be two or more.

That is, the output means is adapted to realize a predetermined order process in response to the address information of the chain pointer table area (2b) during the drawing process.

More specifically, the contents of the address of the chain pointer (2c1) of the graphic element storage area (2c) corresponding in order from the first x axis of the rectangular area currently being processed in the chain pointer table area (2b) Checks whether or not it points to the address of the data, and if it points to that address, it advances to the next address. If the content does not point to the address of the data, the graphic element data (2c2) stored at that address is for the graphic element whose starting point is the x-axis position currently being processed. The graphic element data is vector-raster converted and stored in the frame memory area (2d).

When the storage in the frame memory area (2d) is completed, the process proceeds to the address indicated by the chain pointer (2c1). The address indicated by the chain pointer (2c1) is the graphic element storage area (2
In the case of c), it is stored in the frame memory area (2d) as described above. When the address indicated by the chain pointer (2c1) is in the chain pointer table area (2b), the value of the address is stored in the chain pointer table area (2b) and then the processing is performed. That is, since the content of the address of the data points to the value of that address, the process proceeds to the next address in the chain pointer table area (2b).

Since the rectangular area (I, II, III) is small, a large graphic element covers a plurality of frame memories. However, since vector raster conversion for storage in the frame memory area (2d) is usually performed by a DDA (digital differential analyzer), etc., the midway coordinates can be recognized during execution, so if the frame memory area (2d When the x-axis value of the rectangular area corresponding to () is exceeded, the graphic element storage means is executed to pass the data to the next frame memory. That is, since the chain means is implemented, the first x in the next rectangular area
Chain pointer table area (2b) corresponding to the axis position
The content of the address of is added as a chain pointer, the storage address of the graphic element data is stored in the address of the chain pointer table area (2b), and the graphic element data is changed to the data below the frame memory and stored. Let

When these processes are repeated and the processing of the chain pointer table area (2b) corresponding to the last x-axis position of the rectangular area currently being processed is completed, the processing of the frame memory is completed, and the raster scan rendering Output to the device is possible.

Therefore, the raster scanning drawing apparatus draws the frame memory output after the processing, and executes the output unit for the next rectangular area to convert the graphic element data to vector raster conversion for another frame memory. The entire drawing area can be drawn by repeating the above storage.

〔Example〕

Hereinafter, an example in which the random vector processing method according to the present invention is implemented by program control will be described with reference to the drawings.

FIG. 1 is a block diagram showing the overall configuration of a raster scanning type drawing device for carrying out the present invention, and FIG. 2 is a detailed view in the graphic element storage area of FIG. 1, and FIGS. In the figure, a processing method according to the present invention comprises a control microprocessor (hereinafter referred to as CPU) (1), a storage device (2) having a control program, two memory areas, and two or more frame memories, and a raster scanning drawing apparatus. (3) and the interface for output device (4). In addition to the control program area (2a) that stores the control program in the storage device (2), there are two memory areas for work. One of the memory areas is a chain pointer table area (hereinafter referred to as CT) (2b), the other is a graphic element storage area (hereinafter referred to as SEG) (2c), and a frame memory area (hereinafter referred to as FM) ( 2d) It is secured.

CT (2b) has the number of elements corresponding to the number of x-axis scanning lines in the entire drawing area, and the contents of each address (address) correspond in the order from the first scanning line to the last scanning line.

The SEG (2c) is a part for storing the graphic element data as a random vector, and the storage address (address) for storing the graphic element data one by one will be represented by @A hereinafter. The storage structure of one graphic element is as shown in the conceptual diagram shown in Fig. 2. The chain pointer (hereinafter referred to as CPTR) is a part for writing the data chain state in the storage part of the storage address @A of the random vector. (2c1)
And a portion for storing graphic element data (hereinafter referred to as DATA) (2c2).

CT (2b) is provided to combine the X-axis coordinates with the graphic element stored in SEG (2c). CPTR (2c1) stored in SEG (2c) is the corresponding graphic. It is for connecting the element with its first x-axis and other graphic elements associated with that x-axis.

Next, FM (2d) will be described.

A large number of small rectangular areas (I, II, I
II), and a plurality of frame memories having a size corresponding to all the raster information in one small rectangular area are secured. In this embodiment, three rectangular areas (I, II, III) are secured in FM (2d).

Next, referring to FIGS. 1 and 2, the process of inputting graphic element data will be described with reference to the flow chart of FIG. 3, the memory content diagram of FIG. 4 (a) and the graphic element diagram of FIG. 4 (b). explain.

In the initial state before input processing, the address is stored in all the elements of CT (2b), that is, the contents of all addresses. (B of FIG. 3) In FIG. 4 (a), # 0, # 1 ,.

Next, as shown in FIG. 1, graphic element data is sequentially read from the CPU (1) as long as the data continues. (B in FIG. 3) In CT (2b), as shown in FIG.
0) → If the straight line from point P2 (40, 70) is read as graphic element data @, the minimum value of the X axis of that graphic element data A
_Obtain X _MIN and know X _MIN = 10 as shown in FIG. 4 (a). (C in FIG. 3) After that, this value is set as the numerical value N of the printing unit. (D in FIG. 3) When the print unit is 1, for example, N = 1 × 10 =
Will be 10.

Here, the value of each address (address) of CT (2b) is represented by #N.

Next, look for an empty area in SEG (2c) and find its address @
It is assumed that A is @ 0 as shown in FIG. (E in FIG. 3) Although the operation of finding an empty area of the SEG (2c) is performed here, the operation may be performed in order to input the data to the SEG (2c) without performing this operation.

Here, the chain means of CT (2b) and SEG (2c) is implemented.

Storage of the address (# 10, which is the address corresponding to the 11th scanning line from the figure data in FIG. 4B) in the chain pointer table area (2b) corresponding to X _MIN (= 10) Contents (# 10, in the initial state, the contents of all addresses are the same as the addresses at that time),
CPTR (2c at address @ 0 where graphic element data should be stored
1) While storing in the storage part, change the stored content to that address (@ 0). That is, the storage content of address # 10 in CT (2b) is changed from # 10 to @ 0. at the same time,
The figure data (straight line data from P1 to P2) is stored in the DATA (2c2) storage part of address @ 0 in SEG (2c). Further, as described above, the storage address of the graphic element data is stored in the storage address of the CT (2b) as described above. Next, when the straight line from point P2 (40,70) to point P3 (70,10) is read as data, X _MIN = 40, so CT (2b)
Change the stored content of address # 40 in # 40 to @ 1 and add # 40 to CPTR (2c1) part of address @ 1 in SEG (2c) and graphic data (P2 → to DATA (2c2) part) The straight line data of P3) is stored, and the operation is the same as in FIG.

Then, when the straight line from point P4 (60,30) to point P5 (20,30) is read as data, X _MIN = 20, so CT (2
b) The memory content # 20 in address # 20 in SEG (2c) is changed to @ 2, # 20 is stored in the CPTR (2c1) part of address @ 2 in SEG (2c), and the graphic element data (P5 is stored in DATA (2c2)). → The data of the straight line of P4) is memorized, and the operation is the same as G in Fig. 3.

Next, when it is read as straight line data from point P6 (80,10) to point P7 (80,70), since X _MIN = 80, the stored contents of address # 80 in CT (2b) will be read from # 80. Change to 3 and # 80 in the CPTR (2c1) part of address @ 3 in SEG (2c)
(Α in FIG. 4 (a)) is stored in the DATA (2c2) portion as graphic data (linear data of P6 → P7), and the same operation as in FIG. 3G is performed.

Then, when the straight line from point P7 (80,70) to point P8 (120,70) is read as data, X _MIN = 80, so CT
Content changed to address # 80 in (2b) @ 3
Is changed to @ 4 on the plate and @ 3 (β in Fig. 4 (a)) is changed to D in CPTR (2c1) part of address @ 4 in SEG (2c).
The figure data (the straight line data from P7 to P8) is stored in the ATA (2c2) section, and the same operation as in FIG.

That is, both data and data are X _MIN = 80,
Since the minimum X-axis values of both graphic elements are the same, CPTR (2c
1) shows that # 80 → @ 4 → @ 3 (γ in FIG. 4 (a)) is chained. In this way, reading of all the graphic element data is completed, and when there is no input data, the process proceeds to output control. At this stage, the content of address # 100 in CT (2b) is naturally # 100. In the flowchart of FIG. 3, @A indicates the storage address of the graphic data A, and () indicates the content of the address.

Next, the output control will be described. In this embodiment, a small rectangular area (I, I in FIG. 1) that is composed of 100 scanning lines is used for the entire output area.
Since it is divided into I, III) and 3 FM (2d) are secured,
The vector raster conversion result of the graphic data is stored in the frame memory in which the drawing is completed in the order of I, II, and III.

FIG. 5 is a flowchart relating to output control.

In Fig. 5, at the time of drawing, it is necessary to control all scanning lines from 0 to the maximum value on the x-axis in order.
The contents are checked from the address order of (2b), that is, from # 0 of (a), and it is checked whether the value N is equal to the address currently checked or not.
(B) If they are equal, the address processing is completed and the process proceeds to the next address (c).

When the address (@A) of SEG (2c) is written in the content (d), the content is graphic element data to be processed.

Therefore, a means for unwinding the chain (unchain means) is executed. The unchaining means is performed by storing the contents of the CPTR (2c1) portion of the address @A in SEG (2c) as the contents of the current address in CT (2b).

That is, firstly, the contents of CT (2b) are changed to the CPT of SEG (2c).
The content (e) of R (2c1) is used. Secondly, the DATA (2c2) of SEG (2c) is used as the vector raster conversion (f).

Next, it is checked whether or not the raster data rectangular area (I) is exceeded. (G) If it does not exceed the rectangular area (I) of the frame memory, it is stored in the rectangular area (I). (H) If it exceeds the area of the frame memory, the area boundary value of the X coordinate of the frame memory is newly used as the data.
(I) A detailed description will be given with reference to FIGS.

The contents of the address (@A) of CT (2b) of that data are stored in the CPTR (2c1) of SEG (2c) according to the above-mentioned input processing, and the contents of the address of CT (2b) corresponding to the print position value of the input data. Is stored in the CPTR (2c1) of the SEG (2c), and
After the address (@A) of CT (2b) is stored in the CT (2b), raster data within the area boundary value and the newly provided boundary value is stored in FM (I).

After processing both when the X-coordinate area boundary value is exceeded and when it is not exceeded, the contents of the CT (2b) address are checked again, and the above processing is repeated until the value becomes equal to the address value, and the frame boundary CT (2
Proceed with address processing in b), and perform this operation until the frame boundary address is reached. (K) Then, after reaching the frame boundary address, the FMI
Can be output (m), and the output printing is performed in frame memory units, and the same operation is performed for other frame memories (II, III).

Although this operation is performed up to the drawing limit, the description limit is omitted because it is performed in frame memory units.

Next, the embodiment shown in FIGS. 4 (a) and 4 (b) will be described with reference to FIG.

In FIGS. 4A and 4B, the contents are checked in order from the first address # 0 (a in FIG. 5) of CT (2b). (B in FIG. 5) Since the contents up to address # 9 point to the value of the currently checked address, the next address (5th
Proceed to c) in the figure. When the content of the address # 10 is checked, unlike # 10, it is @ 0 (d in FIG. 5), so it is understood that the graphic element data starting from the x-axis 10 is stored here. Therefore, the unchaining means is executed and # 10, which is the contents of the CPTR (2c1) portion of the address @ 0, is stored in the address # 10 (e in FIG. 5). This allows
The content of address # 10 points to the value of the address currently being checked.

After executing the unchaining means, DATA (2c
2) Perform vector raster conversion on the figure data of part.
(F in FIG. 5) Next, it is checked whether the graphic data exceeds the rectangular area of the frame memory. (G in FIG. 5) The data in FIG. 4 (b) has an X-axis value of 10 to 40,
Since FM (I) does not exceed the range of 0 to 99, the vector raster conversion result is stored in FM (I) as it is. (H in FIG. 5) Then, when checking the contents of address # 10 of CT (2b), it indicates the value of the data currently being checked.
Proceed to the next address (c in FIG. 5) in order. And if you check the contents of the address in order of address,
As shown in FIG. 4 (a), the next address is # 20, and the next is address # 40, but vector raster exchange is performed in the same manner as described above, and the results are stored in the frame memory and proceed in sequence. , Point p1 → point p2, point p5 → point p4, point p2 → point
Each straight line of p3 is stored in the rectangular area (I).

Next, when the contents of the address # 80 of CT (2b) are checked at points P6 to P7, the unchain means is executed because it is @ 4 unlike # 80, and it is the contents of the CPTR (2c1) part of @ 4. After storing @ 3 in address # 80 (γ in Fig. 4),
Vector raster conversion is performed on the graphic data in the DATA (2c2) part at address @ 4. (H in FIG. 5) The vector raster conversion is performed by the DDA (digital differential analyzer) and is performed by the recurrence method, so that the intermediate coordinates can be recognized during execution.

The figure data in the DATA (2c2) part of address @ 4 is the point P7 (8
0,70) → Point P8 (120,70) is a straight line, so FM
(I) exceeds the range of 0-99. (G in FIG. 5) Therefore, as described above, when the area of the frame memory is exceeded (k in FIG. 5), the area boundary value of the X coordinate of the frame memory is newly set as the data (fifth area). According to i) in the figure, the process of passing the subsequent graphic data to the next frame memory is performed from the intersection P9 with the boundary line of the current rectangular area corresponding to the frame memory.

That is, here, the chain means is implemented again (j in FIG. 5), and the contents of the address # 100 of CT (2b) at the point P9 are read @
4 in the CPTR (2c1) part of the SEG (2c) address @ 4 #
Point 100 to the DATA (2c2) section at point P9 (100,70) → point P8 (120,7)
Stores the straight line graphic data of 0). {Fig. 4 (c)}
After that, the point where vector raster conversion is completed P7 → Point P9
Data in the rectangular area (I) (h in FIG. 5),
Check the contents of the original address # 80.

Although the content of address # 80 of CT (2b) has been replaced from @ 4 to @ 3 earlier, it is different from the current address value (α in Fig. 5), so execute the unchaining method. , # 80, which is the contents of the CPTR (2c1) portion of the address @ 3, is stored in the address # 80, and then vector raster conversion is performed on the graphic data of the DATA (2c2) portion of the address @ 3. (F in FIG. 5) Since the graphic data at address @ 3 is a straight line from point P6 to point P7, it does not exceed the frame memory range during vector raster conversion, and after the conversion result is stored in the frame memory as it is, When the contents of the original address # 80 are checked, since the value of that address is pointed this time, it is known that the processing of the graphic data starting from this scanning line is completed, and the process proceeds to the next address (c in FIG. 5). . And point P9
→ For P8, for example FM
Store in (II).

In this way, the contents of the CT (2b) address are sequentially checked, and when all the addresses corresponding to the scanning lines of the rectangular area currently being processed are checked, it is possible to output from the frame memory (Fig. 5). M) of the FMI, FMII, or FMIII, the available frame memory is used to shift to the process for the next rectangular area.

〔The invention's effect〕

The memory efficiency of a raster image is extremely inferior to the memory efficiency of vector data having a higher degree of abstraction. In particular, it becomes more prominent in the case of a device having a raster resolution of a level that enables replacement with a pen type xy plotter.

For example, consider a case where the total drawing area is 2 m in the x-axis direction and 1 m in the y-axis direction, and when using a raster scanning type drawing device of 10 dot / mm, if the whole drawing area is set as a frame memory, it will be in the x-axis direction. 2000
The storage capacity of 0 bits and 10000 bits in the y-axis direction requires (10000 × 20000/8) = 25 Mbytes as the total storage capacity.

On the other hand, if one straight line is stored in the vector image, it can be completed in several bytes at most, and therefore, it is assumed that, for example, 8 bytes are required.

In the above embodiment, the number of scanning lines in one rectangular area is 100, but if the number of scanning lines is about 400, one frame memory is 0.5M.
I need a part-time job.

Since the total number of scanning lines is 20000, the number of elements of CT (2b) is 2
0000, and if it requires 4 bytes to hold the storage contents as a physical address, it will be 20000 × 4 because of CT (2b).
= 80,000 bytes are required.

Let X be the number of graphic elements to be memorized, then SEG (2
Each element of c) has 4 bytes in the CPTR (2c1) part and DATA (2c
2) It takes 8 bytes for the part, so it takes 12 bytes in total,
The total graphic element storage area (2c) requires X × 12 bytes.

If 5 Mbytes, which is 1/5 of 25 Mbytes required when the entire drawing area is used as one frame memory, is the capacity of the storage device of the drawing apparatus according to the present invention, graphic elements that can be processed The number of data X is X = {(5000 × 10 ³ −1500 × 10 ³ -80 × 10 ³ ) / 12} = 285000, and if there are 280,000 graphic elements in the 1 m × 2 m drawing area, there are 10 It will be in half.

The sort described above in the section of problems to be solved by the invention
According to the above method and the mapping method, the storage capacities are almost the same, but the computer time becomes enormous.

That is, according to the method by sort, it is generally known that the calculation time for sorting increases exponentially as the number of data increases. For example, the number of graphic elements of 280,000 is handled. In some cases, the time required is at least 100 times longer than that of the method according to the present invention.

In the case of the mapping method, a huge amount of calculation time is required to calculate the intersection point with the boundary line, which is 10 to 100 times longer than that of the method according to the present invention.

As described in detail above, according to the random vector processing method of the present invention, a small-capacity storage device is effectively used, and when inputting a random vector data string created for a vector plotter, Since time-consuming processing such as data rearrangement and intersection processing calculation is not required, raster drawing can be performed at high speed.

[Brief description of drawings]

FIG. 1 is a block diagram of a raster scanning drawing apparatus for carrying out a random vector processing method according to the present invention, and FIG.
FIG. 3 is a conceptual diagram showing a storage structure of graphic elements, FIG. 3 is a flow chart of control means for storing data, FIG. 4 (a) is a memory content diagram, and FIGS. 4 (b) and 4 (c) are graphic element diagrams. , Fifth
FIG. 6 is a flow chart for drawing control, FIG. 6 is an example of an output figure by a vector plotter, and FIG. 7 is a diagram showing an example of an output figure by a raster plotter. 1 ... Control microprocessor, 2 ... Storage device, 3
...... Raster scan type drawing device, 4 …… Output device interface, 2a …… Control program area, 2b …… Chain pointer table area (CT), 2c …… Graphic element storage area (SEG), 2c1 …… Chain Pointer (CPTR), 2c2 ...
... Graphic element data (DATA), 2d ... Frame memory area (FM) I, II, III ... Rectangular area.

Claims (1)

[Claims] 1. A raster scanning output method for inputting and outputting a data sequence in an arbitrary arbitrary order with respect to an output position of a graphic element, and having two memory areas and two or more frame memory areas, One of the memory areas is a chain pointer table area (2b) whose address is a unit (print unit) of the X coordinate scanning line in the paper output direction, and one of the other memory areas is a chain pointer (2c1 )
And a graphic element storage area (2c) having each graphic element data (2c2), and two or more frame memory areas (2d) are memories corresponding to drawing drawings, and all drawing areas are X-axis. It is divided into a plurality of rectangular areas (I, II, III) in the direction. Before inputting data as input processing, the chain pointer table area (2b) is used as its address as the initial operation.
After that, the control microprocessor (1) decomposes the input data into graphic element data including start and end point coordinates, converts the graphic element data into a value of a printing unit, and stores the data in the graphic element storage area (2c). At the same time, the content of the address of the chain pointer table area (2b) corresponding to the value of the print position of the graphic element data is calculated to find the minimum value of the X axis of the graphic element data and the chain pointer (2c) of the graphic element storage area (2c). 2c1) and the address of the chain pointer (2c1) is stored in the chain pointer table area (2b), these processes are performed on all the data, and the chain pointer table area ( 2b)
Check the contents in the order of the address of, and if the value is equal to the address currently checked, the address processing is completed, and if the address of the graphic element storage area (2c) is written in the contents, First, the contents of the chain pointer table area (2b) are transferred to the chain pointer (2c1) of the graphic element storage area (2c).
Second, the graphic element data (2c) in the graphic element storage area (2c)
2) is vector-raster converted, and if it does not exceed the area of the frame memory as raster data, it is stored in the frame memory area (2d). If it exceeds the area of the frame memory, the area boundary value of the X coordinate of the frame memory is set. The data is newly used as the data, and the contents of the address of the chain pointer table area (2b) of that data are stored in the graphic element storage area (2c).
In the chain pointer (2c1) of the chain pointer table area (2
The content of the address of b) is stored in the chain pointer (2c1) of the graphic element storage area (2c), the raster data in the frame memory area (2d) is stored in the frame memory, and the area boundary value of the X coordinate is exceeded. After processing both the case and the case where it does not exceed, check the contents of the address of the chain pointer table area (2b) again, repeat the above process until the value becomes equal to the address value, until the address value on the frame boundary is reached. After the address processing of the chain pointer table area (2b) is advanced and the frame boundary address is reached, the frame memory can be output, and the output printing is performed in frame memory units. The same applies to other frame memories. A random vector processing method characterized in that an operation is performed.