JPH0516072B2 - - Google Patents

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention provides a drawing leader line addition character in which the automatic arrangement of character strings and symbols in drawings and the addition of leader lines are performed by computer calculations. This relates to an automatic placement method.

[Conventional technology]

FIG. 10 is a block diagram of a device for, for example, a conventional character automatic placement method, and in the figure, 1 is
Input device that inputs data to CPU2, 3 is CPU2
It is an output device that outputs data from.

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

Overlap detection processing (step 9) for already placed polygons to be detected for overlap (steps 7 and 8)
If overlapping occurs for even one placed polygon (step 10), the position is moved by a predetermined amount 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 operation is repeated until it is determined that there is no overlap.

The polygon that no longer overlaps with any of the already placed polygons (step 12) and whose placement position has been determined is set as the already placed polygon (step 13), and the same process is performed for the next new polygon. Once the positions of all polygons have been determined, drawing output processing is performed based on these placement positions (step 14).

[Problem that the invention seeks to solve]

Since the conventional automatic character placement method for drawing is configured as described above, the position of polygon movement is determined only by a predetermined calculation formula, so it is difficult to move the polygon to a position that is difficult to correlate with the original position. There was a problem that the placement could be determined.

This invention was made in order to solve the above-mentioned problems, and it provides a drawing leader line that can automatically place symbols, characters, etc., and also automatically add leader lines for correspondence. The purpose of this paper is to obtain a method for automatically arranging additional characters.

[Means for solving problems]

The method for automatically placing characters with leader lines in drawings according to the present invention configures a drawing system using an input/output device and a CPU, and determines the degree of overlapping of character strings and symbols arranged on a drawing using a predetermined calculation formula. As a result of the calculation, if there is an overlap, the character strings or symbols are moved a predetermined distance in a predetermined direction so that they do not overlap, and the placement position is determined. If the distance is large, a leader line is automatically added.

[Effect]

In this invention, the character strings and symbols are obtained 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 overlapping. If the amount of movement of the newly placed polygon is large, draw a leader line for correspondence so that it does not overlap with the character string or symbol. Add.

〔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. 10 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 inputted in "character string data, symbol data input" is data defined by rectangular polygons 15 as shown in FIG.

In this embodiment, all character strings 17 are handled as rectangular polygons 15, as shown in FIG. In other words, the rectangular polygon 15 is
This means positioning 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 the center coordinates (x _c , y _c ), the four corner coordinates (end points) (x ₁ , y ₁ ), (x ₂ , y ₂ ), ( x ₃ , y ₃ ), (x ₄
，
y ₄ ), distance from center to end point (I _L ), length of long side (I _W ),
The length of the short side (I _H ), the angle (θ), and whether the rectangular polygon 15 has already been placed (positioned polygon) or is about to be placed (newly placed polygon). It consists of a flag indicating whether it exists. However, since all flags (for example (symbol 16 in FIG. 2)) cannot be moved, they are assumed to be in the existing position, and all subscripted character strings 17 are initially placed in new positions.

First, after "character string data and symbol data are inputted" (step 21), "neighborhood search processing" is executed within the CPU 2 (step 22). In this neighborhood search process, if there is a rectangular polygon that may overlap around the newly placed polygon, a check is made with "Possibility of overlap" and all results are stored in memory (steps 23 and 24).
That is, in the operation of step 24, "already placed polygons that may overlap are stored in memory".

The above "neighborhood search process" (step 22)
Regarding the newly placed polygons, a check is made as to whether "processing has been completed for all already placed polygons" (step 25). After completing the neighborhood search for all placed polygons, "overlap detection processing" is performed (step 26). First, consider four straight lines 18 passing through the center of the polygon and parallel to the sides, as shown in FIG. 4, for the new and two existing polygons 15. The distance 19 from one of these straight lines to each vertex of the other polygon is checked. The distance shall be expressed as |ax ₀ +by ₀ +c|/a ² +b ² (however, the equation of the straight line 18 passing through the center of the polygon and parallel to the sides is ax+by+c=0, and the coordinates of the vertex are (x ₀ , y ₀ ).

Compare this distance 19 with the distance 20 from the straight line to the side (this is equal to 1/2 of the length of the long side or short side), and find out if there is at least one side from the straight line within the distance from the straight line to the vertex. If there is a distance smaller than the distance from the other polygon, check the distance from the other straight line to each vertex of the other polygon.

Here, if all the distances 19 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 ended, other straight lines are checked, and if they have ended, 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), shift the position of the newly placed polygon,
Perform "correction of character string data" (step 28).
The law of movement of this position is set in advance.

In this way, after modifying the character string data, for the newly placed polygon at the new position,
Performs "overlap detection processing" (step 26). At this point, check whether all overlaps with existing polygons have disappeared using "Processing completed for all already placed polygons" (Step 29), and then select "Determine placement position of newly placed polygons" at that position. (Step 30), and set the polygon data flag to "already placed".

Also, here, check the amount of movement from the original position,
If the amount of movement is greater than a preset specified value (step 31), the polygon to be processed is held in memory (step 32). Check whether the placement positions of all polygons have been determined or whether there are any unplaced polygons (step 33). If there are unplaced polygons, repeat the process from the beginning. If the placement positions of all polygons have been determined, lead line processing is performed. (Step 34). When all processing is completed and the data is completed, drawings are output according to the data (step 35).

FIG. 5 is an overall flowchart for explaining the above-mentioned leader line processing, in which the start and end points of the leader line are determined for polygons that move significantly and are determined to require a leader line during the character automatic placement process. (Step 36). In addition, the equation of the lead line from the starting point to the ending point is ``Ax + By + C = (JY -
IY)x+(IX-JX)y+JX・IY−IX・JY=0”
(Step 37).

Next, polygon detection processing is performed to find a polygon that overlaps the leader line near the leader line (step 38). If there is a polygon in the nearby area (step 39), the intersection between the polygon in the nearby area and the leader line is detected (step 40), and the intersection is stored in memory (step 41).

From the above polygon detection process in the nearby area (step 38), the intersection points are stored in memory (step 38).
After performing the series of processes up to 41) on all polygons in the neighborhood area (step 42), arrange the data for drawing a leader line that skips polygons in the order in which the above intersection points are closest to the start point of the leader line. (Step 43) and draw a leader line based on that data (Step 44). The above processing is related to one leader line.

Next, each process in the above-mentioned leader line process (FIG. 2) will be explained.

Figure 6 is a flowchart of polygon detection processing in the nearby area, where the MAX value of the distance from one end point to the center of the polygon data is set as IW (step 45), and the width is determined by the calculation formula (IWID=IW×A ² +B ² ). Calculate IWID (step 46).

The center coordinates (x ₀ , y ₀ ) of the polygon are within the area equal to the width of both end points of the leader line plus IW (steps 47 and 48), and the distance from the center point to the leader line is less than IWID. Small polygon (step 49)
are determined to be polygons in the nearby area (step 50), and other polygons are determined to be not polygons in the nearby area (step 51).

In addition, the polygon in the nearby area is the 7th polygon in the diagram.
It will be within the area shown in the figure.

Next, the process of detecting the intersection between the polygon in the neighborhood area and the leader line will be explained based on the flowcharts shown in FIGS. 8-1 and 8-2.

First, set the initial values (step 52), and set the polygon side number + 1 for each side of the polygon.
(Step 53), and determines whether the side number of the polygon is >4 (Step 54). If NO, the equation of the side of the polygon is ``(Y ₂ − Y ₁ ) x + (X ₁ − X ₂ ) y−
X _{1 ·} Y _{2 +} Since it is considered that there is no intersection like -5, the next edge is processed. Note that (X ₁ , Y ₁ ) (X ₂ , Y ₂ ) are the vertices of the polygon.

Next, if they are not parallel, find the intersection coordinates (x ₀ , y ₀ ) using the formula Ax+By+C=0 ax+by+c=0 (step
57), if the intersection is on the leader line (steps 58, 59), the number of intersections is increased by +1 (step 60), and the intersection coordinates are stored in memory (step 57).
61).

After performing the above processing on the four sides, check the number of intersections stored in the memory. If the number of intersection points is 3 or 4 (step 62), the two points with the same coordinates are treated as one point and processed as intersection point 2 (Figure 9-
3,4). The above is the high point detection process.

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.

〔Effect of the invention〕

As described above, according to the present invention, leader lines can be automatically added during automatic character placement in drawings, so that symbols and character strings that are difficult to associate with each other due to automatic character placement can be resolved. This has the effect of allowing accurate drawings to be obtained.

[Brief explanation of drawings]

FIG. 1 is a flow chart of the entire process of the method for automatically creating a distribution line diagram according to an embodiment of the present invention, and FIG.
The figure is a power distribution line diagram, Figure 3 is an explanatory diagram of rectangular polygons, Figure 4 is an explanatory diagram of the new and two existing polygons, Figure 5 is a flowchart of lead line processing, and Figure 6 is an explanatory diagram of rectangular polygons.
The figure is a flowchart of the polygon detection process in the nearby area, FIG. 7 is an explanatory diagram of the area near the leader line, and FIGS.
Figures 9-1 to 5 are explanatory diagrams of intersections between polygons and lead lines, Figure 10 is a block diagram of a device that implements the automatic character placement method, and Figure 11 is a flowchart of the entire process of the conventional automatic character placement method. It is a diagram. 1 is the input device, 2 is the CPU, and 3 is the output device. In addition, in the figures, the same reference numerals indicate the same or corresponding parts.

Claims (1)

[Claims] 1 In an automatic character placement method for drawing in which characters are automatically placed in a drawing by a CPU that has an input device that inputs data and an output device that performs arithmetic processing and outputs data, an already placed character placed at a drawing position in the CPU The degree of weight of the newly placed polygon for the polygon is calculated in the CPU using a predetermined calculation formula, and only when there is an overlap between the two polygons, the position of the new polygon is calculated using a predetermined calculation formula. is determined, and the new polygon is moved by a predetermined amount in a predetermined direction to avoid overlapping between the two polygons, and if the amount of movement of this new polygon is large, a lead line is added for association. A method for automatically arranging characters to add leader lines in drawings.