JP3679484B2 - Graphic processing apparatus and method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a graphic processing apparatus and method for drawing a graphic.
[0002]
[Prior art]
Conventionally, in a graphics processing apparatus that can draw a map using a personal computer or a word processor, as a method of drawing a road, an instruction means such as a cursor existing on a screen for displaying the drawn road is moved. There was something to draw with the moving trajectory. There is also a method of drawing a road by designating two points on the screen and connecting them.
[0003]
[Problems to be solved by the invention]
However, in the above conventional graphic processing apparatus, when the road being drawn intersects with another road, it must be determined every time it intersects with the road, such as a three-dimensional intersection or a horizontal intersection. There has been a problem that the operation associated with is complicated.
[0004]
Also, even if it is necessary to move the drawn road once and redraw it, it is necessary to determine and set the intersection with other roads each time.
The present invention has been made in view of the above problems, and when a road to be drawn intersects with another road, an operation associated with the drawing process can be easily performed without determining the intersection state. An object of the present invention is to provide a graphic processing apparatus and method.
[0005]
In order to achieve the above object, a graphic processing apparatus according to the present invention comprises the following arrangement. That is,
A graphics processing device for drawing graphics,
Storage means for storing a hierarchical value indicating a mutual height relationship for each of a plurality of graphics to be drawn;
An acquisition means for acquiring the respective hierarchical values of the two figures from the storage means when two figures of the plurality of figures overlap;
A comparison means for comparing the respective hierarchical values of the two figures acquired by the acquisition means ;
Drawing means for drawing overlapping portions of the two figures based on the height relationship between the two figures obtained by the comparison result of the comparison means;
Drawing instruction means for instructing drawing of a new figure;
Control means for storing, in the storage means, a hierarchical value of the new graphic when the new graphic overlaps with a graphic already displayed.
[0007]
Preferably, the drawing means, as a result of the comparison by the comparing means, if the hierarchical value of one of the two figures is higher than the hierarchical value of the other figure, Draw over the other figure.
Preferably, the drawing means draws so that an overlapping portion of the two figures is eliminated when the hierarchical values are the same as a result of the comparison by the pre-comparison means.
[0008]
In order to achieve the above object, a graphic processing method according to the present invention comprises the following arrangement. That is,
For each of a plurality of graphics to be drawn, a storage step for storing a hierarchical value indicating a mutual height relationship in a storage means;
When two figures of the plurality of figures overlap, an acquisition step of obtaining the respective hierarchical values of the two figures from the storage means ;
A comparison step of comparing each hierarchical value of the two figures acquired in the acquisition step ;
A drawing process of drawing an overlapping portion of the two figures based on a height relationship between the two figures obtained by a comparison result of the comparison step ,
A drawing instruction process for instructing drawing of a new figure;
A control step of storing the hierarchical value of the new graphic in the storage means when the new graphic overlaps a graphic already displayed.
[0012]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the drawings.
FIG. 1 is a block diagram showing a functional configuration of the graphic processing apparatus according to the embodiment.
Reference numeral 1 denotes a CPU which is connected to KB2, LCD3, VRAM4, FDD5, PRT7, ROM8, and RAM11 through a bus line BL6 and performs various controls. Reference numeral 2 denotes a keyboard (KB), which is provided with keys for inputting general characters and graphics and performing desired processing. Reference numeral 3 denotes a color LCD which displays characters and graphic information written in the VRAM 4 which is a display-only memory. In addition, a process or result executed in a flowchart described later is written in the VRAM 4 and then displayed on the LCD 3.
[0013]
Reference numeral 8 denotes a ROM that functions as a read-only memory, and stores a program for executing processing of data input from the KB 2 and various processing. Further, a program PRG8a for executing a flowchart (FIG. 10) described later is stored.
Reference numeral 11 denotes a RAM that functions as a writable memory, which is a work area and a temporary save area for various programs and data input from the KB2. The interior is divided into several areas, and 11a is a work area WORK used for operating the above-described program. Reference numeral 11b denotes a storage area DD for storing road data which is road drawing data.
[0014]
Reference numeral 5 denotes an FDD (floppy disk drive) that functions as an external storage device for storing the DD 11b. In addition, it is possible to read and write data by attaching an FD. Furthermore, a processing flow program to be described later can be written in the mounted FD (not shown), and the processing can be executed by reading the program into the RAM 11 of the apparatus. Reference numeral 7 denotes a PRT that functions as a printer for recording character graphic information and the like.
[0015]
Next, the storage state of the road data stored in the DD 11b of the RAM 11 will be described with reference to FIG.
FIG. 2 is a diagram illustrating one configuration of road data stored in the DD 11b according to the embodiment.
The DD1b stores m (m is a positive integer) road data, and the following data is stored in one road data DD (m). A numerical value DW indicating a road width is stored at the head of DD11 (m), and then a hierarchical value KS indicating a relative height with respect to another road is stored. Further, for example, when 0 is set as the hierarchy value of a certain road, the hierarchy value KS is set to 1 for a road that passes through a level intersection or the like, and -1 for a road that passes below. Furthermore, when creating a new map or road, initial data other than numerical values are set, and the setting of the hierarchical value KS is completed when the user sets the hierarchical value KS when drawing. After the hierarchy value KS, the central coordinates (X0, Y0) to (Xn, Yn) of n + 1 roads are stored. The meaning of these numerical values will be described with reference to FIG.
[0016]
FIG. 3 is a diagram for explaining a state of being drawn by road data according to the embodiment.
For example, assuming that coordinates (X0, Y0) to (X4, Y4) as the center of the road are positions as shown in the figure, each coordinate is first connected by a straight line and then connected to each coordinate. Centered on the straight line, lines are drawn on both sides at intervals of the road width DW as shown in the figure. At this time, the lines on both sides drawn as roads are curved.
[0017]
The technique for drawing the road can be easily realized by using a technique similar to that for character outline processing, for example. Further, each data constituting the road data DD (m) stored in the DD 11b can be updated at any time by inputting new data from the KB 2, and data calculated by a flowchart described later. Updated by.
[0018]
Next, processing of the present embodiment will be described with reference to the block diagram of FIG. 1, the memory configuration diagram of FIG. 2, the drawing examples of FIGS. 4 to 9, and the flowchart of FIG.
In the present embodiment, the cursor 20 displayed on the LCD 3 is moved, the trajectory of the movement of the cursor 20 is acquired as coordinates, and the road data DD1b is drawn based on the acquired coordinates. Further, the description will be made on the assumption that the road drawing process processed in the present embodiment or the road drawing result after processing is displayed on the LCD 3.
[0019]
An example will be described in which a new road is drawn by moving the cursor 20 in the arrow direction after the road 21 is drawn as shown in FIG.
In step S1, it is determined whether or not the road drawn by the cursor 20 to be moved intersects with another road. If it does not intersect with another road (NO in step S1), a normal road drawing process is performed, and the road drawing process is repeated until it intersects with another road. If it intersects with another road (YES in step S1), the process proceeds to step S2.
[0020]
In step S2, it is determined whether or not the hierarchical value KS of the road currently being drawn is initial data. If the hierarchy value KS is initial data (YES in step S2), the process proceeds to step S3. If the hierarchy value KS is not initial data (NO in step S2), the process proceeds to step S5.
In step S3, a user's instruction is awaited as to whether the road currently being drawn passes above or below the crossing road or crosses horizontally. Also, an instruction from the user is instructed by inputting a layer value KS from KB2. Until then, the cursor 20 does not move first.
[0021]
In step S4, if any instruction is given, the layer value KS according to the instruction is set. After the setting is completed, the process returns to step S1, and the road drawing process is repeated until it intersects with another road.
In step S5, the hierarchy value KS of the road currently being drawn is compared with the hierarchy value KS of the intersecting road. When the hierarchical value KS of the intersecting road is smaller than the hierarchical value KS of the road currently being drawn, the process proceeds to step S6. In step S6, the drawing process is performed so that the road 22 being drawn passes over the intersecting road 21 as shown in FIG.
[0022]
Further, when the hierarchical value KS of the intersection road and the hierarchical value KS of the drawing road are the same, the process proceeds to step S7. In step S7, as shown in FIG. 6, the drawing process is performed so that the road 22 being drawn intersects the intersecting road 21 horizontally.
Furthermore, when the hierarchical value KS of the intersection road is larger than the hierarchical value KS of the drawing road, the process proceeds to step S8. In step S8, as shown in FIG. 7, the drawing process is performed so that the road 22 being drawn passes under the intersecting road 21.
[0023]
When a plurality of roads are already drawn, the intersection of these roads is defined as a three-dimensional intersection or a horizontal intersection according to the hierarchical value KS of each road. When a new road is drawn, even if the newly drawn road intersects with a plurality of roads that have already been drawn, if the crossing situation with one of those roads is indicated, The intersection with other roads may be determined automatically.
[0024]
For example, referring to FIG. 8, it is assumed that the road 22 and the road 21 have already been drawn, and that the hierarchy of the road 22 and the road 21 is defined so that the road 21 is at the top at the three-dimensional intersection. . Here, when a new road 23 is drawn, when the instruction to pass under the road 22 (setting the hierarchical value KS) is first given, the hierarchical value KS of the road 23 is smaller than the road 22. Therefore, when the vehicle intersects with a road having a larger hierarchical value KS than the road 22 (here, the road 21), the road 23 passes under the road. Since the road 21 in FIG. 8 is defined to have a higher hierarchical value KS than the road 22, the road 23 automatically passes under the road 21 even if it does not give another instruction when crossing the road 21. Drawing is done.
[0025]
Further, when moving on a once drawn road, the value of the road data DD may be changed and redrawn. In this case, if the position of the road is simply shifted, each road coordinate (Xn, Yn) of the road coordinates constituting the road may be changed. If the road width DW and the hierarchy value KS are not changed, the crossing situation as another road feature is saved.
For example, when the road shown in FIG. 8 is drawn and then the road 23 is moved to the right as shown in FIG. 9, the hierarchy value KS is not changed even if the position is shifted, so the intersection state is also saved. Therefore, as shown in FIG. 9, the road 23 is drawn so as to still pass under the road 21.
[0026]
As described above, according to the present embodiment, when a road is drawn by giving each road of the road to be drawn a hierarchy value KS indicating a relative height with respect to other roads, the road is drawn. Even when the vehicle intersects with another road, the road drawing process can be easily executed without determining the intersection state.
Further, since the road is drawn based on the road data DD (m), if the hierarchy value KS of the road data DD (m) does not change, the road coordinates constituting the road data DD (m) are changed. Even the situation of intersection with other roads is preserved.
[0027]
Furthermore, when drawing a road on a map, it is possible to easily draw without having to grasp the situation of the intersection. Also, there is an effect that it is possible to draw without considering the intersection when moving on the road.
Note that the present invention can be applied to a system composed of a plurality of devices (for example, a host computer, interface device, reader, printer, etc.), or a device composed of a single device (for example, a copier, a facsimile machine, etc.). You may apply to.
[0028]
Another object of the present invention is to supply a storage medium storing software program codes for implementing the functions of the above-described embodiments to a system or apparatus, and the computer (or CPU or MPU) of the system or apparatus stores the storage medium. Needless to say, this can also be achieved by reading and executing the program code stored in the.
[0029]
In this case, the program code itself read from the storage medium realizes the functions of the above-described embodiment, and the storage medium storing the program code constitutes the present invention.
As a storage medium for supplying the program code, for example, a floppy disk, a hard disk, an optical disk, a magneto-optical disk, a CD-ROM, a CD-R, a magnetic tape, a nonvolatile memory card, a ROM, or the like can be used.
[0030]
Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) operating on the computer based on the instruction of the program code. It goes without saying that the case where the functions of the above-described embodiment are realized by performing part or all of the actual processing and the processing is included.
[0031]
Further, after the program code read from the storage medium is written into a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing, and the functions of the above-described embodiments are realized by the processing.
[0032]
When the present invention is applied to the above-described storage medium, the storage medium stores program codes corresponding to the flowcharts described above. In brief, each module shown in the memory map example of FIG. Is stored in a storage medium.
That is, at least the program code of each module of “storage module”, “acquisition module”, and “drawing module” may be stored in the storage medium.
[0033]
【The invention's effect】
As is clear from the above description, according to the present invention, when a road to be drawn intersects with another road, an operation associated with the drawing process can be easily executed without determining the intersection situation. A graphic processing apparatus and method thereof can be provided.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a functional configuration of a graphic processing apparatus according to an embodiment.
FIG. 2 is a diagram illustrating a configuration of road data stored in a DD 11b according to the present embodiment.
FIG. 3 is a diagram for explaining a state of being drawn by road data according to the present embodiment.
FIG. 4 is a diagram showing a display example for explaining a process in which the cursor 20 of the present embodiment draws a road 22;
FIG. 5 is a display example for explaining a state in which a road 22 according to the present embodiment is drawn intersecting a road 21;
6 is a display example for explaining a state in which a road 22 according to the present embodiment is drawn horizontally intersecting with a road 21. FIG.
FIG. 7 is a display example for explaining a state in which a road 22 according to the present embodiment is drawn crossing under a road 21;
FIG. 8 is a display example for explaining a state in which a road 22 according to the present embodiment is drawn crossing a plurality of roads.
FIG. 9 is a display example for explaining a state of being drawn by moving on the road 22 of FIG. 8 of the present embodiment.
FIG. 10 is a flowchart for explaining the processing flow of the present embodiment;
FIG. 11 is a diagram showing the structure of a memory map of an FD in which a program for processing flow executed in the present invention is stored.
[Explanation of symbols]
1 CPU
2 KB
3 LCD
4 VRAM
5 FDD
6 BL
7 PRT
8 ROM
8a PRG
11 RAM
11a WORK
11b DD

Claims (4)

A graphics processing device for drawing graphics,
Storage means for storing a hierarchical value indicating a mutual height relationship for each of a plurality of graphics to be drawn;
An acquisition means for acquiring the respective hierarchical values of the two figures from the storage means when two figures of the plurality of figures overlap;
A comparison means for comparing the respective hierarchical values of the two figures acquired by the acquisition means ;
Drawing means for drawing overlapping portions of the two figures based on the height relationship between the two figures obtained by the comparison result of the comparison means;
Drawing instruction means for instructing drawing of a new figure;
And a control unit that stores a hierarchical value of the new graphic in the storage unit when the new graphic overlaps a graphic already displayed. Said drawing means, the result of comparison of the comparison means, among the two figures, when the layer value of one figure is higher than the layer value of the other figures, one of the figures said of the other figures The graphic processing device according to claim 1, wherein the graphic processing device draws the image so as to overlap the upper surface. Said rendering means, before comparison results by the comparing means, when the layer value of the same figure, the figure of claim 1 or 2, characterized in that drawing to eliminate the overlapping portions of the two figures Processing equipment. For each of a plurality of graphics to be drawn, a storage step for storing a hierarchical value indicating a mutual height relationship in a storage means;
When two figures of the plurality of figures overlap, an acquisition step of obtaining the respective hierarchical values of the two figures from the storage means ;
A comparison step of comparing each hierarchical value of the two figures acquired in the acquisition step ;
A drawing process of drawing an overlapping portion of the two figures based on a height relationship between the two figures obtained by a comparison result of the comparison step ,
A drawing instruction process for instructing drawing of a new figure;
And a control step of storing a hierarchical value of the new graphic in the storage means when the new graphic overlaps a graphic already displayed.

Images