JPS6075969A - Graphic information processor - Google Patents

Abstract

PURPOSE:To decrease both memory capacity and processing time of a graphic information processor by performing the continuous image pickup only with a memory at the outer circumference part of the start point side in the scanning direction after deciding the scanning direction of a flag memory. CONSTITUTION:A common control command is stored to a data buffer 1, and a picture description command and apex data are stored to a data buffer 2. A processor 4 uses the data stored in buffers 1 and 2 to form a flag. A flag obtained by the continuous image pickup of the graphic information within a data calculation area existing at the starting point in the scanning direction is written to the memory at the outer circumference part of the starting point side in the scanning direction of a flag memory 3. This flag is read out of the memory 3 to the processor 4. Then the prescribed picture element data given from the processor 4 is written to a prescribed address of a raster memory 5. The picture data read out of the memory 5 is supplied to a monitor picture receiver 7 via a display control circuit 6.

Description

Detailed Description of the Invention "-Field of Application in Industry-1" This invention relates to an advanced information communication system (for example, an advanced information communication system that displays a predetermined figure on a monitor receiver based on data transmitted via a digital communication line). The present invention relates to a graphic information processing device applied to INS).

"Background Art and its Problems" When displaying a figure formed based on graphic information transmitted via a digital communication line, for example, polygon vertex information G, and performing processing to fill in the inside of this figure, needs to detect closed regions of this shape. Two types of first-order methods are known as methods for searching for this closed region.

The first method is to store all the shapes of the figures given in memory, and the second method is to search for closed regions using information on intersections without having any memory. In the first method, since there are 4 memos of closed area information, the types of filling processing (filling the entire surface, vertical hatching,
Various methods can be used for the processing (horizontal hatching, cross-hunting, diagonal hatching) and direction of processing (such as from below or from left to right). However, it has the disadvantage that all the given first graphic information must be stored, and the required memory capacity is extremely large.

Direction) The h method of 2 is I' which connects the received vertex information in order.
First, find a straight line, find the intersection between this straight line and the scanning direction, and use this intersection information to draw a closed region. 4'< This is to perform a grinding process. This method is.

Although it does not require memory, the processing time is multi-interval; therefore, the time required for processing becomes extremely long, and there are problems such as cross-hunting and other problems.
There is a drawback that I7'c processing is difficult, and the type of processing is limited.

The applicant of this application does not need to write the given graphical information alloy 1 and can detect closed regions in the figure ++=g
This paper proposes an information processing device. This person〕
, i; l', , Add one frame of memory along the four sides of the flag memory corresponding to the display area, and add this one frame of memory along the four sides of the flag memory corresponding to the display area.
Frame memo IJ This is to continuously map data outside the display area.

1-Objective of the Invention The objective of this invention is to improve the above-mentioned graphical information processing device proposed earlier. In other words.

This invention aims to reduce the amount of memory and processing time by determining the scanning direction and making it possible to perform two consecutive mappings only in the outer peripheral memory on the starting point side in the scanning direction. ○ "Summary of the Invention" This invention determines the scanning direction of a flag memory, and writes a peripheral memo IJG on the starting point side of this scanning direction.

A flag is written by continuous mapping of graphic information in a data calculation area located on the starting point side G in the scanning direction.

Embodiment FIG. 1 shows the overall configuration of an embodiment of the present invention. In FIG. 1, 1 and 2 are.

Indicates the data buffer in which the digits are stored.

3 indicates a flag memory, and 4 indicates a processing device composed of a microcomputer.

In one embodiment of this invention, to express one figure, PDI:
(Picture Description In5
A word #l called tructi○n)! 7 is used. This word Wμ refers to figures as points (POIN'J') and lines (LIN).
E), fi (ARC), [2IQ angle)l〉(
l (II: t,: '1°A 1101, l!?)
, polygon (POLYGON) θ) is a combination of basic elements for displaying figures from five types.

Received data using this language consists of, for example, a common control command, an image description command, and a vertex digit. Common control commands.

・1・A′ Command to display either a character or a figure.

Logical pixel size 4 "Which parameter to set, -
This common control command is stored in the T-tab '1. In addition, 3 image description commands ζ, 11
Display area, drawing color 1 outline line, closed area G vs.

IJ,! (The point data and this vertex data are a straight line.)

Arc, polygon〕12σ) Specify which one to form completely.

There is -C for specifying whether to process the 1°/1σi region. This image description command and vertex data are stored in the data buffer 2.

The processing unit i′t 4 stores these data buffers 1.2
Using the data stored in f, r
A flag is formed and this flag is written into the flag memory 3. Further, this flag is read out from the flag memory 3 by the processing device 4G, and a predetermined image indicator from the processing device 4 is written at a predetermined address G in the raster memory 5. This raster memory 5 has 9 display areas (for example)
The image data is read from the raster memory 5 and supplied to the monitor receiver 7 via the display control circuit 6. The scanning of the raster memory 5 is synchronized with the beam scanning of the monitor receiver 7.

As shown in FIG. 2, the flag memory 3 corresponds to one display area and has a width of Xll! If Ii is a memory area of Y pixels vertically, then ! (The memory for I pixels on any of the four sides of this area (frame memories 8A, 8B).

80 or 8r) is added in correspondence with the scanning direction. In the poem with scanning direction 9A going down from Go.

The memory 8A of the outer frame on the starting point side ζ is added to 113 in the scanning direction 9B that advances from below the skin to the top, /-f, 1
Regarding the horizontal scanning direction 9C and 9Dl, in which the outer frame memory 8B is added to the starting point side, the memories 8C and 8D of the first frame are added to the starting point, and the first .

The display area is the entire screen of the monitor receiver 7 (, 1 part and frZ). In addition, the area obtained by subtracting the display area 2 from the thick area that is constant with the number of bits on the two-dimensional plane is the data 1,1 calculation area, and for example, the data calculation area and the display 4Ci area are interrupted by 4 frames in total. . Furthermore.

',,,I In order to reduce stem 1□'L, detection of closed areas and closing/li [J area processing consists of +14 i with multiple physical pixels j11! Song 1 Soki Li ranked 1st.

The flag is formed in each of one display area and data main area. In addition, as shown in FIG. 3, the intersection of the closed region 10 and the straight line 11 is
It is solid. Therefore, if we consider that the direct color 11 indicates the direction of the first intersection, filling processing is performed from the brightest intersection to the next intersection, and from the first intersection to the next intersection, it is a closed area. Since it is not 10, the filling process is not performed and the area sandwiched by the two intersection points is intersected 1Ji4
All you have to do is fill it in.

As an example, the vertex data of the received data is a polygon.

Detection of closed regions will be explained. First, each pixel of the flag memory 3 is set to a predetermined 7 rasog in the initial state by 'I''.
(represent L as O). next.

A straight line forming the outline of the polygon is calculated from the received data. It is difficult to determine whether a plurality of pixels corresponding to this straight line are included in the display area. The address G corresponding to the pixel included in the display area,
Write a predetermined flag different from the initial state.

A5 1 display area 1. The pixels included in the data calculation area are continuously imaged for the memo IJG in the first frame. The scanning direction is a horizontal scanning direction 9
When C is determined, as shown in FIG. 4, the pixels in the area A1 located on the starting point side are imaged continuously η1 in contrast to the outer frame memo 1)8Cc. The first flag occupied in this outer frame memory 8C is a 1-bit flag for the initial state (represented by o) and the standing state (represented by 1 and T).
When mapping is performed, each time the mapping is performed, the state is different from the previous state. Therefore, areas 11A to 1
If the number of straight lines included in each of 1r+ is <'fRusi tree, the flag becomes 1 and 'fOf' as a result of continuous mapping. If this is an even number, then the flag becomes 0 and lI'. 〇 If you set the scanning direction to 90 in this case, 1 display button)
・The information necessary for the second drawing is only the data in the areas A and G and the data in the first display area 0. In other words, 1-I, memory 8 (the first
〉; Represented as 0T), immediately fill it in and decide whether to display it in the drawing color and how far to fill it. As mentioned above, when you draw a straight line with a closed area, be sure to find an even number of intersections. The problem is to determine whether the area up to (X=O) is a closed area.
``t'', we start drawing with l and J, /j:R, then let this be ρ1 and make it an even number of intersection points, and.

Is there a flag at (×20)?
If you do not start drawing 1lI11 with It can be done.

Furthermore, the data is in area A2, A3, and other areas other than area A.
A4, A5 + A6 + A7 (see Figure 4) &
If this is the case, ignore this data. and.

The flag memory 3 (display area) scans seven points in the determined direction and the flag is read out. Then, between the flags that are in the standing state, filling processing and non-filling processing are alternately performed TfI-G. The type of filling process, the direction, and whether or not to fill in including the contour line are determined by the received data.

Also, 4:,? Differences: processing when imaging.

5 will be explained with reference to FIG. 11 (i L). In FIG.

Special y4 point P, which is the vertex where two straight lines with opposite slopes intersect,
does not change the Z image to line 4. Also, the singular point Pb is the intersection of two straight lines with opposite slopes and the water line IZ (7).
.

The PC short-circuits the horizontal line and assumes it to be the same as the singular point pa, and does not perform mapping. Furthermore, a singular point Pd + P is the intersection of each of two straight lines with the same slope and a horizontal line.
(For 4, short this horizontal line.

Mapping 2 is performed assuming that 1.r"1" - 箕", ', i, l" is the same as l. Particularly, the processing described in 1 that applies to 5° 14 points is 9
One-of-a-kind G in both display area and data calculation area
This is the same. Whether it is a singular point or not is determined by the requested straight line (・Regarding this, the address information of consecutive pixels E?X
You can judge by going to d. 3.Although not shown in the drawings, 9.Even when the curve intersects with the scanning straight line at one point, the same processing as for the singular point pa can be performed.

・When the received f11 data is polygonal and the scanning direction is indicated by 90, only one flag is generated when G is determined.
Example G will be explained with reference to FIG. FIG. 6 shows an example using the frang memory 3 (χ: 12 logical pixels, ¥=8 logical pixels).

If a polygon with a display area and a data calculation area O as shown in Fig. 1 is given, then the memory area of flag memory 3 and the memory 8C of frame 1 are Figure 6 1'3 [A flag like this is formed.

In FIG. 6 and 13, illustration of the flag in the initial state is omitted. In addition, in the flag memory 3, the flag indicated by 2 is the singular point (P in Fig. 5).
(a).

Since the point Pl in FIG. 6A corresponds to the singular point P a C, the flag of the corresponding address in the outer frame memory 8C (7) is O as shown in FIG. 6B.

Also, + P2 + P3 + P, + 3 points at the same horizontal position (J, outer frame memo l) 8 C's corresponding address L J'ljl ? <'Q' image E n
As a result, as shown in FIG. 6B, the flag corresponding to the singular point P in the 0 display area is set to 2, and the flag corresponding to the 7 racks at this address is set to 2, as shown in FIG. 6B. The flag can be used to fill in the horizontal direction from (X-0) to (x=1.]). In the illustrated example, (X-〇) digit 111
At t, the process of filling in G in the horizontal direction starts from the place where the flag of the outer frame memory 8C is set; n, (x=1
Fill in all the way to position r).

Such processing is executed by the processing device 4 receiving the flag that has not been read out from the flag memory 3, and writing the processed pixel puter to the address Q of the raster memory 5 based on this flag. 1), Example of use (without adding a frame memory, the minimum one round part of the flag memory 3 located on the starting point side in the scanning direction, for example 9A (: x
-0) data in display area I as opposed to area O*, I
You can also strain G so that it looks like tj'.

1. Effects of the Invention This invention relies on ε2t, since the memory used for detecting closed regions limits the travel I4Y direction.
1-X')y becomes a container of (XXY-1-Y), and it is possible to reduce the number of memory accesses (that is, increase the processing speed) by reducing the amount of memory used δ.

[Brief explanation of the drawing]

11] is a block [・4. 21st, 3rd and 4th fig.
, 1! MIL (91 J 3. Flag memory, 4. Processing device.
5... Raster memory, 7... Monitor receiver. Agent: Tomo Sugiura Figure 4 Figure 2 Figure 3

Claims (1)

[Claims] The display area is divided into several unit pixels, and each unit is 1ll.
A flag indicating whether or not the display figure is a closed area is generated for each element O, and this flag is stored as 1 in a flag memory having a memory area corresponding to the display area indicated by -I-.
), and by scanning this flag memory in a predetermined direction, '2! The first flag is 0. 1. Forming graphical information in which the closed region has undergone predetermined processing--J
- In a processing device for graphical information as described above. 1. Determine the scanning direction of the flag memory and perform this scanning/
In the memory on the outer periphery of the starting point side of J-white, I wrote the sequence γj = image G of the graphic information in the data calculation area that is located at the starting point in the running-r direction. Graphic information processing device 0