JPS6353679A - Automatic arrangement system for character to be drawn - Google Patents

Abstract

PURPOSE:To facilitate correspondence with an initial position, to arrange a character string, etc., so that they never protrude out of a drawing frame and to obtain a precise, visible drawing by executing prescribed operations and moving the character string and symbols toward their initial positions. CONSTITUTION:An I/O device 1 and a CPU 2 comprise a drawing system. According to a predetermined calculating expression, the CPU 2 calculates a way that the character string and symbols arranged on a screen overlap. If an overlap is found, the character string and symbols are shifted by prescribed distances in prescribed directions so that they never overlap, and arrangement positions are decided. Moreover they are moved by microtrace toward the initial positions from the arrangement positions, and arranged in the positions that have no overlap and are closest to the initial positions.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an automatic character arrangement method for drawing in which the automatic arrangement of character strings and symbols in an automatic drawing device is performed by computer calculations.

[Conventional technology]

FIG. 5 is a block diagram of a device for the conventional character self-recording system described in, for example, Japanese Patent Application No. 60-7212. In the figure, 1 is an input device for inputting data to the CPU 2; It is an output device that outputs data from.

FIG. 6 is a flowchart of the entire process of the conventional automatic character arrangement method. After inputting the data (step 4), a search is performed in the vicinity of the newly placed polygon (step 5), and an already placed polygon that is a target for overlapping detection is found (step 6).

Overlap detection processing (step 9) is performed on the already placed polygons to be detected (steps 7 and 8), and the overlap is 1.
If it happens even for two already placed polygons (Step 1)
0), the position is moved by a predetermined movement amount t in a predetermined direction according to a predetermined calculation formula (step 11).

The overlap detection process is performed again on the new polygon after the movement (step 10), and the above operations are repeated until it is determined that there is no overlap.

There will be no overlap with any existing polygons (Step 1)
2) The polygon whose placement position has been determined is set as an already placed polygon (step 18), and the same process is performed for the next new polygon. Once the positions of all polygons have been determined, the drawing output process is performed based on these placement positions (
Step 14).

The problem that Shinmei is trying to solve] The conventional automatic character placement method for drawing is structured as described above, and since the position of polygon movement is determined only by a predetermined calculation formula, it is difficult for humans to move. There is a problem in that the arrangement may be determined at a position far from the original position, which makes it more difficult to correlate with the original position than when the arrangement is performed manually. Furthermore, in a drawing with a large number of polygons, the moving position is determined only by an arithmetic expression, which poses a problem in that the drawing may not contain all the polygons.

This invention was made to solve the above-mentioned problems, and it determines the placement position of symbols and characters so that they can be easily associated with each other. To provide an automatic character arrangement method for drawing that can determine the arrangement position of characters without protruding outside the drawing frame.

[Means for solving problems]

In the automatic character arrangement method for drawing according to the present invention, a drawing system is configured by an input/output device and a CPU, and the degree of overlapping of character strings and symbols arranged on a drawing is calculated within the CPU using a predetermined calculation formula. As a result of the calculation, if there is an overlap, the placement position is determined by moving a predetermined distance in a predetermined direction so that the character strings and symbols do not overlap, and then moving from the placement position to the initial position direction. It is possible to move it minutely so that it can be placed at the position closest to the initial position without overlapping.

[Effect]

The character strings and symbols in this invention are made by imitating rectangular polygons, giving external dimensions, and calculating the overlap of the newly placed polygons with the already placed polygons through computer processing to determine the positional relationship of the figures without electric current. The position of the newly placed polygon is moved so as to have the above figure positional relationship, and further, it is slightly moved from the placement position in the direction of the initial position, and the placement is determined to a position that does not overlap and is closest to the initial position.

〔Example〕

FIG. 1 is a flowchart of the entire process of an automatic distribution line diagram creation system showing an embodiment of the present invention, and the device shown in FIG. 5 is used as the processing device.

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 explanatory character strings are placed and described on the map (Second
(See symbol 16, character string 17 in the figure).

Next, the operation of the above embodiment will be explained below with reference to FIG. The data input in step 98 of "input character string data and symbol data" is data defined by rectangular polygons 15 as shown in FIG.

In this embodiment, all character strings 17 are treated as rectangular polygons 15, as shown in FIG. That is, the rectangular polygon 15 means that it is positioned at the drawing coordinates as the smallest rectangle that can cover one symbol 16 or a series of character strings 17.

Here, the definition data of the rectangular polygon 15 are center coordinates (xc, yc), four corner coordinates (end points), as shown in FIG.
(x1+ yx) I (X21 y2) + (
Xllll ys) e (X413'4), distance from center to end point (I ■), length of long side Iw), length of short side IH
), the angle (θ), and whether the rectangular polygon 15 has already been placed (already placed polygon).
It consists of a flag indicating whether the polygon is about to be placed (newly placed polygon). However, regarding flags (for example, (symbol 16 in Figure 2))
Since it is not possible to move them all, they are assumed to be already placed, and all of the character strings 17 to be subscripted are initially placed as new placements.

First, enter these as "string data, symbol data input"
After (step 18), "neighborhood search processing" is performed by the CPU.
2 (step 19).

In this neighborhood search process, if there is a rectangular polygon that may overlap around the newly placed polygon, it is checked with "Possibility of overlap" and all results are stored in the memory (steps 20 and 21). That is, in the operation of step 21, "already placed polygons that may overlap are stored in memory".

In the "neighborhood search process" (step 19), it is checked whether "processing has been completed for all already placed polygons" for one newly placed polygon (step 22). After completing the neighborhood search for all placed polygons, "overlap detection processing" is performed (step 28). First, regarding the new and two existing polygons 15, consider four straight lines 24 passing through the center of the polygon and parallel to the sides, as shown in FIG. Check the distance 25 from one of these straight lines to each vertex of the other polygon (however, the equation of the straight line 24 passing through the center of the polygon and parallel to the sides is a
Let x+by+c=o, and the coordinates of the vertex are (x6+ y o
).

Comparing this distance 25 with the distance 26 from the straight line to the side (which is equal to 1/2 the length of the long side or short side),
If even one of the distances from the straight line to the vertex is smaller than the distance from the straight line to the side, the distances from other straight lines to each vertex of the other polygon are checked.

Here, if all the distances 25 are large, then it is checked whether the four vertices exist on the same side of the straight line.

If the four vertices are in the same area, it is determined that they do not overlap, and if the four vertices are not in the same area, it is checked whether the overlap detection has been completed for all four straight lines. If it has not finished, other straight lines are checked, and if they have finished, it is determined that they "overlap."

This process is performed only on polygons stored in memory that may overlap. Here, if there is only one already placed polygon that "overlaps" (YES), the position of the newly placed polygon is shifted and "character string data modification" is performed (step 28).

The law of movement of this position is set in advance.

After the character string data has been corrected in this manner, the "overlap detection process" is performed again for the newly placed polygon at the new position (step 28). Here, it is checked whether or not all overlaps with already placed polygons have been eliminated by "end of processing for all placed polygons" (step 29), and if there is no overlap, that position is set as a temporary placement position. The temporary placement position is moved slightly closer to the initial position by a certain distance (step 80), and each time the position is approached, the "overlap detection process" is performed (step 81). The process is repeated until an overlap occurs (step 82), and the initial position is "Determine the placement position of the new placement polygon" at the position closest to the position
(step 84), and set the polygon data flag to "
"Already placed".

Perform the above process for all newly placed polygons,
The drawing is output according to the corrected symbol data and character string data (step 85).

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.Although a plotter was used as the output device, CRT etc.

〔Effect of the invention〕

As described above, according to the present invention, in the automatic character arrangement for drawing, the arrangement position, fixed character strings and symbols are moved in the direction of the initial position using a predetermined arithmetic expression. At the same time, drawings with a large number of character strings and symbols can be arranged without protruding outside the drawing frame, resulting in accurate and easy-to-read drawings.

[Brief explanation of the drawing]

Fig. 1 is a flowchart of the entire process of the automatic distribution line diagram creation method according to an embodiment of the present invention, Fig. 2 is a distribution line diagram, Fig. 8 is an explanatory diagram of rectangular polygons, and Fig. 4 is a new and existing two.
FIG. 5 is a schematic diagram of an apparatus implementing the automatic character placement method, and FIG. 6 is a flowchart of the entire process of the conventional automatic character placement method. 1 is an input device, 2 is a CPU, and 8 is an output device. In addition, in the figures, the same reference numerals indicate the same or corresponding parts.

Claims (1)

[Claims] In an automatic character arrangement device for drawing, which consists of an input device that inputs data to a CPU, and an output device that outputs data after arithmetic processing by the CPU, an already arranged character string or Only for new character strings/symbols whose arrangement position has been moved to avoid overlapping between the character strings/symbols, as long as they do not overlap with existing character strings/symbols in the direction of the initial position according to a predetermined calculation formula. An automatic character placement method for drawing, characterized in that the placement position is determined by movement.