JPH0756671B2 - Graphic data retrieval device - Google Patents

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graphic data search device, and more specifically, a CA.
The present invention relates to an apparatus for retrieving graphic data existing in an arbitrary area from graphic data in a D / CAM system.

(Prior Art) Generally, graphic data is mainly composed of coordinate values, and is decomposed into pixels and stored as a large amount of data at a predetermined position in a storage device. Then, such graphic data is searched in an arbitrary area by the following system.

FIG. 8 is a block diagram showing a graphic processing system. In the figure, 41 is a coordinate input / output device, 42 is a keyboard, and 43.
Is a graphic operation unit, 44 is a graphic data registration unit, 45 is a graphic data storage unit, 46 is a graphic data extraction unit, 47 is a display control device, and 48 is a display control device.
Is a display data storage device, and 49 is a display device. The graphic data is supplied to the graphic operation unit 43 as coordinate value data via the coordinate input / output device 41. Then, the graphic operation unit 43 supplies the additional data input from the keyboard 42 and the graphic data to the graphic data registration unit 44. The graphic data registration unit 44 decomposes them into pixels and stores them in the graphic data storage unit 45. Further, the graphic data stored in the graphic data storage unit 45 is extracted by the graphic extraction unit 46 by giving an operation instruction, an operation area designation, and the like to the graphic operation unit 43 by the coordinate input / output device 41 and the keyboard 42. , Graphic operation unit 43
At, graphic operations such as enlargement and reduction are performed. Thereafter, the graphic data that has been graphic-operated is stored as display data in a predetermined position of the display data storage device 48 via the display control device 47. Then, the stored display data is again supplied to the display device 49 via the display control device 47 as an electric signal and displayed. The operation part that takes the longest processing time in the above graphic operation is the operation in the graphic data extraction unit 46 that extracts a large amount of data due to the decomposition into pixels, that is, the graphic data existing in the designated arbitrary area. Is the operation of searching.

Conventionally, in the above-described search processing, the graphic data is divided into predetermined divided areas (areas a, b, c) as shown in FIG. 9, and the graphic data in FIG. 8 is stored as the stored graphic data shown in Table 1. It is configured to be stored in a predetermined position of the storage unit 45. Here, the divided area obtained by dividing the graphic data in this way is based on the concept in the world coordinate system,
It is represented by a rectangle and is actually composed of vertex coordinates such as 2 points or 4 points of the rectangle.

Next, as the search processing, the overlap between the arbitrarily set search area (shown by the alternate long and short dash line in FIG. 9) and the divided area is calculated from the coordinate values, and the graphic data stored in the divided area where the overlap exists. Was performed by reducing the number of operations for extracting the graphic data to be processed, thereby increasing the speed.

(Problems to be Solved by the Invention) However, in the above method, when processing graphic data in which a line segment 56 extends over each divided area as shown in FIG. However, the storage capacity, the processing speed, and the like are not technically satisfactory as the number of divided areas increases and the division becomes more complicated.

The present invention has been made to solve these problems, and an object of the present invention is to provide a graphic data search device capable of reducing the storage capacity and improving the processing speed.

(Means for Solving Problems) In order to solve the above problems, the present invention divides a work area including graphic data and sets a plurality of divided areas, and a search area including desired graphic data. In a graphic data search device for searching graphic data included in an area overlapping a divided area, a hierarchical area division for hierarchically dividing a work area according to a distribution state such as complexity of the graphic data or existence density in the work area Means, graphic data registration means for registering graphic data contained in the hierarchical divided area created by the hierarchical area dividing means, and determining the search area by determining the overlap between each of the plurality of divided areas and the search area. A region overlap determining means for obtaining a divided region containing the graphic region and a graphic data extracting device for extracting from the graphic data registering device all graphic data enclosed in the divided region obtained by the region overlapping determining means. The present invention is characterized by including a data extraction unit and a graphic data overlap determination unit that obtains graphic data that overlaps the search area from all the graphic data extracted by the graphic data extraction unit.

(Operation) According to the present invention having the above-described configuration, the work area is hierarchically divided by the hierarchized area dividing means to create each hierarchized divided area. Further, the graphic data registration means registers the data in the smallest hierarchical divided area in which the graphic data is included. When searching for the desired graphic data, the area overlap determination means determines a divided area in which the search areas including the desired graphic data overlap. Then, all the graphic data included in the obtained divided area is extracted by the graphic data extracting means. The graphic data overlap determination means obtains graphic data that overlaps the search area from all the graphic data, and extracts desired graphic data.

Therefore, the present invention can solve the above-mentioned problems, and can provide a graphic data search device capable of facilitating the search for graphic data extending over divided areas and reducing the storage capacity and improving the processing speed. .

(Embodiment) An embodiment of the present invention will be described below with reference to the drawings.

1 and 2 are block diagrams showing an embodiment of the present invention. FIG. 1 shows a part of the functions of the graphic data registration unit 44 shown in FIG. 8, that is, an operation of dividing the graphic data into hierarchical areas and registering them. Further, FIG. 2 shows a part of the function of the graphic data extracting unit 46 shown in FIG. 8, that is, an operation of searching and extracting graphic data based on the hierarchical divided areas. Also the third
The figure is a diagram showing how an initial area and a division target area are set from a work area. Further, FIG. 4 is a diagram showing an example of storing the initial area and the division target area.

In FIG. 1, 10 is a work area, 11 is an initial area setting unit,
Reference numeral 12 is a division target area determination unit, 13 is a hierarchical area division unit, 14 is graphic data registration unit, 15 is graphic data, 16 is graphic data storage unit, and 17 is a divided area storage unit. Next, in FIG. 2, 20 is a region overlap determination unit, 21 is a divided region graphic data extraction unit, 22 is a graphic data overlap determination unit, 23 is a search region setting unit, 24 is a search data storage unit, and 25 is a graphic. It is an operation unit.

Next, the operation of this embodiment will be described.

First, the division processing operation will be described with reference to FIG.

First, the initial area setting unit 11 sets an initial area based on the work area 10 designated by a keyboard (not shown) or the like, and stores the initial area in the divided area storage unit 17 as coordinate values. The area of the initial area is the same as the work area 10, but the graphic data in the initial area is the graphic data registered at the time of retrieval, and the concept of the area of the work area is different. The initial area corresponds to the first hierarchical layer and is an area having the same concept as a hierarchical divided area of a divided area described later. The coordinate value stored in the divided area storage unit 17 is, for example, the coordinate value (0,0) (48,32) of the area corresponding to the initial area in the first layer shown in FIG. 3, and as shown in FIG. Storage area in the divided area storage unit 17
The area number 1 is stored as 101 in association with the layer number 1.
Then, in the second layer, the first layer is divided into two, and the initial region of the first layer is divided into two divided regions as shown in FIG. 3, and the divided regions are assigned region numbers 2 and 3, respectively. The coordinate values of are stored as shown in FIG. The coordinate values of the divided areas divided for each hierarchy are stored below. At this time, the divided area stores the storage address of the divided area of the immediate upper hierarchy by matching the relationship of the divided areas of the immediate upper hierarchy. That is, area number 2
The storage address 101 of the overlapping divided area is stored immediately above the divided area. Note that the above example shows an example of a predetermined ratio of two divisions, but the present invention is not limited to this, and there is a distribution state existing in the area of the graphic data by the hierarchical area division unit 13, for example, there is an area. The figure data is divided depending on the fact that the figure data is concentrated in the portion or the amount of the figure data is uneven. As described above, the initial setting of the management area including the initial area and the divided areas is completed.

Next, the figure data 15 input by the coordinate input device (not shown) is sequentially determined by the figure data registration unit 14 from the lowest area of the areas stored in the divided area storage unit 17 to the inclusion relation in the coordinate values. , The graphic data is registered in the initial area and the divided area including the graphic data.
When the divided area is created and the figure data exists, the layered area dividing unit 13 may register the figure data.

Next, the registration of the graphic data will be specifically described below. Fifth
The figure shows an example of graphic data. For convenience, a straight line or the like is marked with ~ as a graphic name. FIG. 6 is a diagram showing the inclusion relation of the graphic data of FIG. 5 by three-dimensionally representing the divided areas hierarchically adapted to the example shown in FIG. Figure 7 shows the first
It is a figure which shows the storage state of the figure data storage part of a figure.

First, the lowermost layer, that is, the 16 divided areas shown in hierarchy number 5 in FIG. 3 and the graphic data is referred to, and the divided area containing the graphic data is determined. The divided area with the area number 28 includes the figure name I, and the divided area with the area number 27 includes the figure name. Therefore, as shown in FIG.
In the memory address 128 of the area number 28, the memory address 209 in which the graphic name I is stored in the graphic data registration unit 14 is stored.
The area number of the divided area included in the graphic data registration unit 14 is also stored. In the storage number 127 of the area number 27, the storage addresses of the graphic names, ... Are stored in the graphic data registration unit 14, but one of the storage addresses 201 is stored. Then, the storage addresses 202 of the graphics belonging to the same area in the storage address 201 in the graphics data registration unit 14 and the storage addresses 203 of the graphics belonging to the same area in the storage address 202 are stored respectively, and the graphics name ,,
Of each of the above, so that the mutual connection relationship can be understood. When only one figure data is included in one divided area, or when there is no figure data in the lower storage address in the same divided area, -1 is set. In this way, all the graphic data included by referring to each divided area of each layer is stored.

Next, the search processing operation will be described with reference to FIG. First, the search area setting unit 23 sets the search area based on the coordinate values given by the graphic operation unit 25 that performs graphic operations such as enlargement, reduction, and transfer. Next, the area overlap determination unit 20 obtains a divided area including the search area from among the plurality of divided areas extracted from the divided area storage unit 17. The obtained divided area is passed its identifier, generally an area number, to the in-divided-area graphic data extracting unit 21, and is used to retrieve the graphic data registered in the divided area from the graphic data storage unit 16. The extraction of the graphic data in the divided area can be performed by sequentially tracing the addresses connected for each area number to extract the graphic data stored in the address.

Next, the figure data overlap determination unit 22 determines whether or not the figure data extracted from the divided area including the search area overlaps the search area. The overlap determination at this time depends on the content of the graphic operation, and is considered to be inclusion, partial overlap, or the like. As a result, the graphic data that is the target of the graphic operation is stored in the search data storage unit 24. The stored data is used by the graphic operation unit 25 to perform graphic operations such as enlargement and reduction.

Here, a specific example of the search processing operation will be described based on the above-mentioned graphic data. The search area in this example is an area including a part of the graphic name connected to the graphic name in FIG. 5, that is, an area surrounded by a dashed line in FIG.

First, the operator sets the search area shown by the alternate long and short dash line in FIG. 5 via the graphic operation section 22 in FIG. 2 (actually the search area setting section 23). Layered, which overlaps with the set search area,
The area overlap determination unit 20 obtains the divided areas of the area numbers 1, 2, 4, 5, 8, 9, 10, 10, 11, 17, 19, 20, 22. Then, the divided area graphic data extraction unit 21 corresponds to the obtained divided area,
The storage address of the graphic data stored in the management table shown in FIG. 7 is obtained. Further, the storage addresses in which the figures belonging to the same area are stored are sequentially traced based on the respective storage addresses. For example, since the storage address where the graphic data in the divided area of area number 1 is stored is 205, the graphic name of the storage address 205 is extracted. Then, the storage address 205
For other figures belonging to the divided area, the figure data based on the stored storage address 207 is extracted. Further, the storage address where the graphic data is stored is not stored in the divided area of the area number 4, and the graphic name is not extracted. In this way, as a result of sequentially tracing all the divided areas obtained by the area overlap determination unit 20, the storage address 205,
207, 211, 206, 212 are obtained, and the figure names in FIG. 5, which are the figure data stored in the obtained storage addresses, are extracted. Finally, the graphic data overlap determination unit 22 determines a graphic portion that overlaps, for example, from the diagonal coordinates of the search area and the coordinates of these graphic data, and obtains the graphic data in the search area. As a result, in FIG. 5, all the figure data of the figure name and the figure data of the part related to the search area of the figure name are obtained.

(Effects of the Invention) As described above, according to the present invention, an area in which all graphic data exists is hierarchically divided, and the graphic data is searched based on the hierarchical divided areas. It is possible to provide a graphic data search device that can handle graphic data that extends between areas in the same manner as graphic data that fits in the area, and can reduce the storage capacity and improve the processing speed.

[Brief description of drawings]

FIG. 1 is a block diagram showing a division processing operation in one embodiment of the present invention, FIG. 2 is a block diagram showing a search processing operation in this embodiment, and FIG. 3 is an initial area and a division target area set from a work area. FIG. 4 is a diagram showing an example of storing the initial region and the decomposition target region, FIG. 5 is a diagram showing an example of the graphic data of FIG. 5, and FIG. 6 is a diagram showing the hierarchical divided regions of FIG. FIG. 7 is a three-dimensional view, FIG. 7 is a diagram showing a storage state of the graphic data storage unit of FIG. 1, FIG. 8 is a block diagram showing a graphic processing system, and FIG. 9 is a graphic subjected to conventional division processing. It is a figure which shows an example of data. 10 …… Work area, 11 …… Initial area setting section, 12 …… Division target area determination section, 13 …… Hierarchical area division section, 14 …… Figure data registration section, 15 …… Figure data, 16 …… Figure Data storage unit, 17 ... divided area storage unit, 20 ... area overlap determination unit,
21 …… Figure data extraction section in divided area, 22 …… Figure data overlap judgment section, 23 …… Search area setting section, 24 …… Search data storage section, 25 …… Figure operation section.

Claims (1)

[Claims] 1. A work area including graphic data is divided to set a plurality of divided areas, and graphic data included in an area where a search area including desired graphic data and the divided area overlap is searched. In the figure data retrieval device, the hierarchical area dividing means for hierarchically dividing the work area in accordance with the distribution state of the figure data in the work area, such as complexity and existence density, and the hierarchical area dividing means Graphic data registration means for registering graphic data included in hierarchical divided areas, and area overlap determining means for determining the overlap between each of the plurality of divided areas and the search area to obtain the divided area including the search area And graphic data extraction means for extracting from the graphic data registration means all graphic data enclosed in the divided areas obtained by the area overlap determination means, Graphic data retrieval apparatus characterized by comprising a graphic data overlap judging means for obtaining the graphic data overlap and the search area from the entire graphic data extracted by the graphic data extracting means.