JPH0479028B2 - - Google Patents

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a method for automatically arranging characters in drawings in which the automatic arrangement of character strings and symbols in an automatic drawing device is performed by computer calculations. be.

[Prior Art] Conventionally, in drawing work that involves arranging characters and symbols, when arranging characters and symbols so that they do not overlap each other, the arrangement position is determined by obtaining information,
I try to give instructions.

[Problem that the invention seeks to solve]

It is difficult to automate the drawing work using the conventional method of arranging characters, symbols, etc. as described above, and even with computer-based drawing devices, the problem is that the arrangement of characters and symbols must be done interactively. The point was hot.

This invention was made to eliminate the above-mentioned problems with the conventional ones, and uses a computer to assume rectangular polygons surrounding characters and symbols, and automatically determine the weights of the rectangular polygons. The purpose is to provide an automatic text placement method for drawings that reduces the number of people required to create diagrams and shortens the time required to create them, and automatically creates and changes diagrams by arranging them to avoid overlapping. shall be.

[Means for solving problems]

The method for automatically arranging characters in drawings according to the present invention comprises a drawing system including an input/output device and a CPU, and calculates the degree of overlapping of character strings and symbols arranged on a drawing within the CPU using a predetermined calculation formula. As a result of the calculation, if there is an overlap, the position of the arranged characters is automatically moved by a predetermined distance so that the character strings or symbols do not overlap, and the overlap is calculated again. After repeated examinations, the final result is to minimize the overlap between character strings and symbols and automatically arrange them.

[Effect]

In this invention, outer dimensions are given to character strings and symbols by imitating polygons, and the overlap between polygons is calculated by a computer using calculation processing for polygons that have already been placed in the vicinity of placing newly placed polygons. It is used for graphical processing. Then, the result of the calculation is determined as a figure positional relationship without overlapping, and is transferred onto the drawing and drawn.

〔Example〕

FIG. 1 is a block diagram showing an embodiment of an automatic distribution line diagram forming system to which the method of the present invention is applied.

Here, the power distribution line diagram means a drawing in which utility poles, electric wires, related equipment (these are collectively referred to as symbols), and the above-mentioned explanatory character strings are arranged and described on a map. (See symbol 31 and character string 30 in FIG. 6) In the figure, 1 is an input device, 2 is a CPU, and 3 is an output device.

Next, the operation of the above embodiment will be explained below with reference to FIGS. 2 to 7. FIG. 2 is a flowchart showing the overall configuration of this system.

In the figure, the data inputted from the input device 1 at "character string data, symbol data input" 4 is defined by a rectangular polygon 26 as shown in FIG.

In this embodiment, all character strings 30 are treated as rectangular polygons 26 as shown in FIG. In other words, the rectangular polygon 26 is 1
This means positioning the symbol 31 or the series of character strings 30 in the drawing coordinates as the smallest rectangle that can cover it.

Here, _the definition data _{of the} rectangular polygon 26 is as _shown in _{FIG .} x ₃ , y ₃ ), (x ₄
,
y ₄ ), center-to-end point distance (I _L ), long side length (I _W ),
The length of the short side (I _H ), the angle (θ), and whether the rectangular polygon 26 has already been placed (already placed polygon) or is about to be placed (newly placed polygon). It consists of a flag indicating whether it exists. However, for symbols that will disturb the accuracy of the map if the placement position is moved (for example, consider symbol 31 in Figure 6 in this way), flags are set as already placed (for example, symbol 31 is set as already placed). ,
All of the character strings 30 to be subscripted are initially placed in new locations.

First, after inputting ``character string data and symbol data'' 4, ``neighborhood search processing'' 5 is performed on the CPU.
Execute within 2. In this neighborhood search process, if there is a rectangular polygon that may overlap around the newly placed polygon, a "Possible overlap" message will be displayed.
6, check and store all results in memory. That is, in the operation of step 7, "already placed polygons that may overlap are stored in memory".
This "neighborhood search process" 5 checks whether "processing for all already placed polygons" 8 has been completed for one newly placed polygon. After completing the neighborhood search for all placed polygons, "overlap detection processing" 9 is performed. This process is performed only on polygons stored in memory that may overlap. Therefore, the "overlap detection process" 9, which requires time for calculation processing, can be reduced, and the processing speed can be increased. Here too,
If even one of the 10 already placed polygons “overlaps” (yes), shift the position of the newly placed polygon,
Perform step 11 of “Correcting character string data”. (The movement law for this position is set in advance.) In this way, after modifying the character string data, for the newly placed polygon at the new position,
“Overlap detection processing” 9 is performed. At this point, check whether all overlaps with already placed polygons have been eliminated by checking ``Complete processing for all placed polygons'' 12, and then ``Determine the placement position of new placed polygons'' 13 at that position to check the polygon data. Set the flag to "already placed".

The above process is performed until there are no newly placed polygons, and when all the data is already placed, the data is completed, and the drawing is output 14 according to the data, that is, a drawing in which the corresponding symbol or character string is placed inside the already placed polygons. and output the drawing. In other words, "drawing output is performed according to the symbol data and character string data after position correction."

The main flow of automatic character arrangement for drawing in the present invention is as described above. Next, each process will be explained.

First, a flowchart of "neighborhood search processing" 5 is shown in FIG.

This "neighborhood search process" 5 attempts to automatically check whether there is a polygon 26 already placed in the vicinity of the rectangular polygon to be placed. As a method, this process starts from newly placed polygons to one of the already placed polygons.
The CPU 2 checks the distance to each one and determines whether there is a possibility of overlap.

In the flowchart of FIG. 3, first, the distance between the centers of two polygons 26, one already placed and the other newly placed, is determined. That is, the distance is expressed as √( _N − 〓) ² + ( _N − 〓) ² . (however,
(x _N , y _N ): Center coordinates of the newly placed polygon, (x〓,
y〓): Center coordinates of already placed polygons) Next, ``Find the sum of the distances from one end point to the center of each of the already placed polygons and the newly placed polygons.'' The distance between the center and end points is greater than the sum of the distances between the center and end points.''17 If the distance between the center points is greater or equal, it is determined that there is no possibility of overlapping. "Yes" 18, "Neighborhood search processing" 5
ends.

Next, Figure 4 shows the "overlap detection process" in Figure 2 above.
9 is shown.

First, regarding two newly placed polygons and two already placed polygons, consider four straight lines 27 that pass through the center of the polygon and are parallel to the sides, as shown in FIG. Therefore, for one straight line 27 among these, the distance 28 between a straight line passing through the center of one polygon and parallel to the side and each vertex of the other polygon is determined as follows (8th
figure). That is, the distance 28 is Let it be expressed as (However, the equation of straight line 27 passing through the center of the polygon and parallel to the sides is ax + by +
Let c=0 and the coordinates of the vertex be (x ₀ , y ₀ ). ) The distance 28 from this one straight line to the vertex of the other polygon, and the distance 29 from the straight line to the side (this is equal to 1/2 the length of the long side or short side) greater than the distance to”2
1, if any of the distances 28 from one straight line to the vertices of the other polygon is smaller than the distance 29 from the straight line to the side, then the distance from the other straight line to each vertex of the other polygon Find out. Here, if all the distances, that is, the distance 28 from one straight line to the vertex of the other polygon, are large, then
(FIG. 9). Next, it is checked whether "the four vertices are on the same side of the straight line" 22. If the four vertices are in the same area (Fig. 10), it is determined that they do not overlap 24, and if the four vertices are not in the same area, then for all straight lines 27 passing through the center and parallel to the sides,
It is determined whether or not this overlap detection has been completed with "processing completed for all 4 straight lines" 23. If it has not finished, investigate the other straight lines passing through the center and parallel to the sides 27, and if it has finished, "overlap" 2
It is judged as 5.

By performing the above-described processes, the distribution line diagram is completed in which the symbols 31 and character strings 30 are arranged without overlapping with others.

In the above embodiment, as shown in FIG. 1, a floppy disk was used as the input device, but a card reader or MT may also be used.
The example shown uses a plotter as the output device, but it may also be a CRT or the like. Note that when the number of polygons is large, the entire drawing may be first divided into regions, and this series of processing may be performed for each region. In addition, although the above embodiment was explained as creating a distribution line drawing,
The present invention can be applied not only to drawings involving characters, but also to pattern design, etc., and provides the same effects as the above embodiments.

〔Effect of the invention〕

As described above, according to the present invention, when arranging character strings, symbols, etc. on a drawing, polygons representing character strings or symbols are temporarily lowered, and the overlapping of the polygons is arranged according to predetermined rules. By repeating position movement and overlap detection, character strings, symbols, etc. can be automatically arranged with less overlap, which has the effect of reducing drawing man-hours and greatly improving drawing speed. be. Further, since the overlap detection process, which requires processing time, is performed only on polygons determined to be likely to overlap during the neighborhood search process, it is possible to shorten the processing time and increase the speed.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of an automatic character placement device to which the method of the present invention is applied, FIG. 2 is a flowchart explaining the operation of FIG. 1, and FIGS. Flowchart for explaining the processing in the figure, Figures 5 to 7 are explanatory diagrams for explaining terms specific to this embodiment, and Figures 8 to 10 are for explaining Figure 4. FIG. In the figure, 1 is an input device, 2 is a CPU, 3 is an output device, 26 is a rectangular polygon, 31 is a symbol, and 30 is a character string.

Claims (1)

[Claims] 1. In an automatic character arrangement method for drawing in which a drawing is created by arranging input character strings and symbols on an original drawing, each symbol whose arrangement position is determined among the input symbols is Place each polygon to cover on the original map, and place polygons that have already been placed in the vicinity of placing newly placed polygons that cover each symbol that can be moved among the input symbols and the input character string. This is determined by comparing the sum of the center-to-end distances of each of the already placed and newly placed polygons with the distance between the centers of the already placed and newly placed polygons. For newly placed polygons where there are already placed polygons, it is determined whether or not they overlap with the already placed polygons when placed at the specified position on the original drawing, and it is determined that they overlap. If so, repeat the process of moving the polygon by a predetermined amount in a predetermined direction until the polygon does not overlap with the already placed polygon, and create a newly placed polygon that covers the movable symbol and character string. , and display symbols and character strings corresponding to newly placed polygons and already placed polygons whose positions have been determined inside the corresponding polygons so that the symbols and character strings are displayed on the original image. An automatic character arrangement method for drawings, which is characterized by creating a written drawing. 2. The automatic character arrangement method for drawing according to claim 1, wherein the shape of the polygon is positioned at the drawing coordinates as one symbol or a minimum rectangle that covers a series of character strings.