JPH07262341A - Automatic arranging device for character string - Google Patents

Abstract

PURPOSE:To efficiently and automatically arrange character strings and to automatically arrange them in coarse areas by arranging the character strings according to a simulate order and arranging them at positions where the overlap of character strings is eliminated or most reduced. CONSTITUTION:This device is provided with a simulation order deciding means 3 for deciding the simulation order, arranging means 4 for arranging the character strings at previously designated standard arranging positions within a prescribed retrieval range according to the simulation order, and overlap degree check means 5 for calculating the degree of overlapping concerning the number of simulation lengths when a certain character string is overlapped on any graphic or the other character string on each position where that character string is arranged. When no character string is overlapped, the character strings are arranged at those positions but when any character string is overlapped, the character strings are arranged at the positions as many as the least number of overlapped simulation lengths. This processing is repeated concerning all the character strings.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus for automatically arranging character strings on a graphic so that the character strings do not overlap each other. When placing a character string on a figure such as a map,
It is desired to automatically arrange this character string so as not to overlap with other figures or line segments as much as possible.

[0002]

2. Description of the Related Art Conventionally, when arranging a character string on a graphic such as a map, the area of the character string to be arranged is represented by a polygon (polygon), and this polygon does not overlap with straight lines, symbols or other polygons. So, it was arranged by the computer.

[0003]

Since the character string on the figure such as the conventional map described above is represented by a polygon and the area is determined so that the polygon does not overlap a straight line or another polygon, all the character strings are polygonal. There is a problem that an operation of putting together the figures becomes necessary and it becomes impossible to effectively arrange the gathered polygons in the drawing area.

The present invention solves these problems.
The character strings are arranged in the standard arrangement position and the search range according to the simulation order, the overlap of the simulated length unit at this time is checked, and the character string is arranged at the position with no overlap or the position with the smallest overlap. ,
The purpose is to efficiently and automatically arrange the character strings so that they do not overlap the figure, and to automatically arrange them in a sparser area.

[0005]

FIG. 1 shows a block diagram of the principle of the present invention. In FIG. 1, a character string automatic arrangement device 1 is for automatically arranging a character string on a graphic, and comprises an input means 2, a simulation order determination means 3, an arrangement means 4,
And an overlapping degree check means 5.

The input means 2 is for inputting various input parameters. Simulated ranking determination means 3
Is to determine the simulation order of whether the character string is simulated on the upper side, lower side, left side, or right side of the figure.

The arranging means 4 arranges the character strings on the upper side, the lower side, the left side, or the right side in accordance with the simulation order within the standard arrangement position and the search range designated in advance. The overlapping degree check means 5 calculates the overlapping degree of the number of point sequences in a predetermined simulation length unit when a character string overlaps with a figure or another character string at the arranged position.

The database 6 stores information such as figures and character strings. For example, the station position (X0, Y
0), station symbol name, map data, etc. are registered.

[0009]

According to the present invention, as shown in FIG. 1, the simulation rank determining means 3 determines whether the character string is on the upper side, the lower side, the left side or the right side of the figure based on the information input by the input means 2. The simulation order of whether or not to simulate is determined, and the arrangement unit 4 determines whether the character string is on the upper side, the lower side, the left side, or the right side according to the determined simulation order within the predetermined standard arrangement position and search range. When the character string overlaps with the figure or another character string at each of the arranged positions, the overlapping degree checking means 5 calculates the overlapping degree of the number of point sequences in the preset simulated length unit. , If there is no overlap, place the character string at that position, or if there is overlap, place the character string at the position with the lowest degree of overlap, and repeat for all character strings to draw the character string. It is to be arranged.

At this time, the simulation rank determining means 3 lowers the simulation rank on the upper, lower, left and right sides of the line segment extending from the figure as the simulation order, and the line segment extending from the figure is the highest. Increase the simulation order of the upper side, lower side, left side, and right side, which are sparse, set the simulation order of the upper side, lower side, left side, and right side of the figure in advance as parameters, and decide in this order. ing.

Further, the search range is a rectangle including predetermined standard arrangement positions of upper side, lower side, left side, and right side. Therefore, the character strings are arranged in the standard arrangement position and the search range according to the simulation order, and when they overlap, the overlap of the point sequences of the simulated length unit is checked, and the position where they do not overlap or the position with the lowest overlap when they overlap. By repeatedly arranging the character strings in the same manner, it is possible to efficiently arrange the character strings automatically so that they do not overlap each other on the figure, and also to arrange the character strings in a sparse area automatically.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the construction and operation of an embodiment of the present invention will be described in detail with reference to FIGS. here,
As shown in FIG. 8, when the station symbol (graphic) on the map and another station symbol are connected by a line route (line segment), the station name (character string) of the station symbol (graphic) is automatically An example of the arrangement will be described in detail below.

FIG. 2 shows a processing flowchart of automatic arrangement of character strings according to the present invention. This is based on the configuration of FIG.
The character string (station name) should be placed in an easy-to-see position near the figure (station symbol) so that it does not overlap other figures (station symbol) and line segments (line route) as much as possible, and it is automatically placed in a sparse area. It is when you do.

In FIG. 2, S1 designates each parameter value from the outside. This is done by the input means 2 of FIG.
Input the following parameters from the outside to instruct. -Arrangement direction priority: For example, upper side, lower side, left side,
Order on the right side (see (c) of FIG. 5) • Simulation length: For example, moving distance L (see (c) of FIG. 4) • Convergence condition: When the number of moved station names is less than or equal to a specified number To end the repeat.

Maximum number of repetitions: The process ends when the specified maximum number of repetitions has been executed. In S2, it is determined whether the character string can be arranged in the standard arrangement position.
This determines whether or not the character string can be arranged without being overlapped with the figure or other character strings even if the character string is arranged at the standard arrangement position designated in advance. In the case of YES, the character string is placed in the standard placement position designated in advance in S8, and the process ends. If NO, the process proceeds to S3.

In step S3, an arrangement position is searched for in the arrangement area of the character string according to the simulation order. This is based on the simulation order determined in FIG. 5, which will be described later.
Place the character string in the standard placement position on either the left side or the right side, and move and place the character string placed in this standard placement position in the placement area (entire extent in Fig. 4) in simulated length units. repeat.

In step S4, an overlap check is performed. this is,
As shown in FIG. 6, which will be described later, a character string is placed in a standard placement position and moved in a simulated length unit in the placement area (whole extent) to be placed and simulated with figures, line segments, and other character strings. Check the number of overlapping point sequences of length L unit.

In step S5, it is determined whether or not the arrangement position overlaps with another figure. If YES, there is an overlap, so S
Go to 6. In the case of NO, there is no overlap, so S
At 8, the character string is arranged, and the process ends.

In step S6, it is determined whether or not the search has been completed for all the disposable areas. This determines whether or not all the layout-enabled areas have been searched according to the simulation order. If YES, the character string is arranged at a position where the degree of overlap is low in S7. This was done by checking the overlap for all according to the simulation order, but it was found that they overlap, so place the character string in the position with the lowest degree of overlap,
finish. Then, S1 to S8 are similarly repeated for other character strings. Further, similarly, the process is repeated until the number of times the character string has been moved exceeds the specified number of times, or the convergence condition for ending the process or the maximum number of repetitions is exceeded.
On the other hand, in the case of NO in S6, S3 and subsequent steps are repeated.

As described above, the simulation order is automatically calculated in accordance with the external designation of the parameter, and the simulation order is arranged in the standard arrangement position and the search range (in all extents) according to the simulation order. When there is an overlap in the arranged position and there is overlap, calculate the degree of overlap with the number of point sequences of simulated length unit, repeat placing at the position with the smallest number of point sequences of simulated length unit, It ends when all the strings can be arranged without overlapping, or when the convergence condition is satisfied or the maximum number of iterations is exceeded. With these, by simply specifying external parameters, it is possible to automatically arrange the character string in a position where the figure is easy to see, and to arrange the character string in a position as sparse as possible according to the simulation order. It becomes possible to do.

FIG. 3 shows an example of external parameters of the present invention.
FIG. 3A shows the arrangement direction priority. Here, "radio station names" (character strings) are arranged on the upper side, the lower side, the left side, and the right side of the station symbol (graphic), respectively. At this time, the arrangement direction priority is designated by the operator from the outside as shown below, for example, as shown in the figure.

: Upper side arrangement: Lower side arrangement: Left side arrangement: Right side arrangement FIG. 3B shows the simulated length. This is referred to as a simulated length L, for example, when the character string "radio station name" arranged on the left side of the station symbol is moved in parallel by a constant value as shown in the figure. Therefore, the character string "wireless station name" is sequentially moved in parallel for each simulated length L, and the position where there is no overlap with other figures or character strings at that time,
Alternatively, the position with the lowest overlap is searched and searched. At this time, if the simulation length L is designated to be long, the time required for the search can be shortened, but the layout is roughly arranged. If the simulation length L is specified to be short, the time required for the search becomes long, but the search can be performed with high accuracy.

FIG. 4 shows a layout explanatory view of the present invention. Figure 4
(A) indicates a character string arrangement area. The arrangement area of the character string is the entire extent, which is a rectangular area including the standard arrangement position designated in advance. Here, the central black square is a symbol extent that represents the station in a rectangular area.

FIG. 4B shows a character string layout simulation. As shown in the left-sided layout extent, the character string is arranged in units of the simulated length L from the standard layout position to the bottom of the entire extent here.
Similarly, as for the right-sided extent, a character string is arranged in the simulated length L unit from the top to the bottom in the entire extent as shown in the figure. Similarly, for the upper extents and the lower extents, character strings are arranged in units of simulated length L as shown in the figure.

FIG. 4C shows an automatic search for an empty area. In this case, for each area in FIG. 4B, the character string "wireless station name" is sequentially arranged in units of the simulated length L, and the degree of overlap at that time is searched.

FIG. 5 shows an example of determining the simulation rank of the present invention. FIG. 5A shows the weight value of the original drawing. The weight value in this case is the connection from the own station to another station (line route)
In the direction in which is growing, the simulation rank is lowered. In the case of this original map, as shown in the right side, since the wiring (line route) extends to the upper side and the right side as described on the right side, the simulation order in this direction is set to low "1", and the upper side 1 lower side 0 left side 0 Right side 1

FIG. 5B shows the most sparse weight value of the original drawing. In this case, the most sparse weight value has a higher simulation rank in the direction in which the connection (line route) from the own station to the other station is the most sparse (the simulation order in the dotted line direction is higher). In the case of this original diagram, as shown in the right side, the weight value is the direction of the sparsest from the upper and right connections (line route) is the direction of the dotted line, so the simulation order of this direction is high and is “0”. And upper side 1 lower side 1 left side 0 right side 1.

FIG. 5C shows a weight value designated externally. In this case, the weight value specified externally is the simulation order specified by the operator. In this case, the upper side 1 lower side 2 left side 3 right side 4 shown.

FIG. 5D shows the combination of the weighting items (the combination of (a), (b), and (c)). here,
As illustrated, from (a), (b), and (c), the upper side 111, the lower side 012, the left side 003, and the right side 114 are obtained. If these are arranged in ascending order, the simulation order is 003: left side 012: lower side 111: upper side 114: right side. Therefore, the simulation order is left → down →
The order is from top to right, and the searchable area is searched in this order.

FIG. 6 shows an overlapping check explanatory diagram of the present invention. In the overlap check, the overlap check with other character strings, figures, etc. existing in this rectangle within the entire extent described in FIG. 4 is performed as follows.

FIG. 6A shows a line segment overlap check. This is the line segment information (start point coordinates,
(Direction unit vector, line segment length), extent information for each direction (lower left coordinate, upper right coordinate), assuming a sequence of points on the line that crosses the rectangular area from the simulated length, and overlapping depending on the presence or absence of the sequence of points in the name extent. To check. For example, as shown on the left side of the figure, in the case of a name extent arranged at a standard arrangement position by assuming a series of points on a connection in units of simulated length, two points of ● exist within a rectangle. For this reason, if the character string position is moved to the left by two points, the overlap disappears as described on the right.

FIG. 6B shows an overlapping check of station names. This is the information (coordinate information,
The overlapping area is obtained from the character height, width, space) and extent information for each direction (lower left coordinate, upper right coordinate). A point sequence is assumed using the simulated length in this area, and the overlap is checked by the presence or absence of the point sequence. For example, as shown on the left side of the drawing, when the point sequence is the standard arrangement position, four points of ● exist in the rectangle. Therefore, if the character string position is moved to the left by four points of ●, the overlap is eliminated as described on the right.

FIG. 6C shows the station symbol overlap check. In this, coordinate values are extracted from the information (line segment information, character information, etc.) of figures that form station symbols of other stations, and a rectangular area including these is obtained. A point sequence is assumed using the simulated length in this rectangular area, and the overlap check is performed depending on the presence or absence of the point sequence. For example, as shown on the left side of the drawing, when the point sequence is the standard arrangement position, four points of ● exist in the rectangle. Therefore, if the character string position is moved to the left by four points of ●, the overlap is eliminated as described on the right.

FIG. 7 shows an automatic layout explanatory view of the present invention.
FIG. 7A shows the initial state. In this initial state,
The wireless station name of station A and the wireless station name of station B, the wireless station name of station B and the wireless station name of station C overlap as shown.

FIG. 7B shows an example of movement. Here, from the initial state of (a):-The wireless station name of station C moves to the lower side-The wireless station name of station B does not change. The wireless station name of station A moves to the left side. This eliminates the overlap.

FIG. 7C shows the next movement example. Here, each station is moved in parallel to the standard arrangement position from the state where (b) is no longer overlapped, and the radio station name of station C moves to the left side. The radio station name of station B moves to the left side. The radio station name of station A remains unchanged. Here, it is considered as converged if it stops moving together with the wireless station names of the stations A, B, and C.

Also, it is possible to finish before that by setting the maximum number of iterations and convergence conditions. FIG. 8 is a diagram illustrating a specific example of the present invention. This is the case of FIG. 9 and FIG. 10, the station symbol is ○, the station names are “Tochigi branch” and “New Tochigi hen”, and the line segment is the line route.

FIG. 9 shows a display before proper placement displayed by using these, and FIG. 10 shows a proper placement according to the present embodiment. FIG. 9 shows an example of a proper arrangement according to the present invention. In this example of proper arrangement, the station name is described in an arbitrary vicinity of each station symbol ◯ in FIG. 8, and it cannot be said that it is easy to see.

FIG. 10 shows an example after proper placement. this is,
The pre-appropriate placement example of FIG. 9 is shown by applying the above-described processing of FIGS. 2 to 7 and the post-proper placement example. In this proper placement example, the overlap is reduced as much as possible, the station names are placed in the most sparse direction, and the operator sets weights in the order of upper side, lower side, left side, and right side. It was arranged in order, and the station name was automatically arranged for easy viewing.

[0040]

As described above, according to the present invention,
Place the character string in the standard placement position according to the simulation order and place it in the simulated length unit in the search range to check for overlap, and place it at the position where it does not overlap or where it overlaps the least. Since the configuration is repeated for the character strings, the character strings can be efficiently arranged automatically so that they do not overlap each other on the figure, and can also be arranged automatically in a sparse area. With these, when arranging a character string on a drawing, the character string or line segment is assumed to be a point sequence, the overlapping check of each figure is processed in a simulated order, and the character string is efficiently overlapped on the figure. It can be automatically arranged so that it does not occur, and even if there is no empty area in all areas, it can be arranged in a more sparse area depending on the number of overlapping point sequences.

[Brief description of drawings]

FIG. 1 is a principle block diagram of the present invention.

FIG. 2 is a processing flowchart of automatic arrangement of character strings according to the present invention.

FIG. 3 is an example of an external input parameter of the present invention.

FIG. 4 is an arrangement explanatory view of the present invention.

FIG. 5 is an example of determining a simulation rank of the present invention.

FIG. 6 is an explanatory diagram of an overlap check according to the present invention.

FIG. 7 is an explanatory diagram of automatic arrangement according to the present invention.

FIG. 8 is a diagram illustrating a specific example of the present invention.

FIG. 9 shows an example of proper placement of the present invention.

FIG. 10 is a diagram showing an example after proper placement of the present invention.

[Explanation of symbols]

 1: Automatic arrangement device for character strings 2: Input means 3: Simulated order determination means 4: Arrangement means 5: Overlap degree check means 6: Database

 ─────────────────────────────────────────────────── ─── Continuation of front page (72) Inventor Mayumi Sato 1015 Kamiodanaka, Nakahara-ku, Kawasaki-shi, Kanagawa Fujitsu Limited

Claims (3)

[Claims] 1. An automatic arrangement device for arranging character strings so that they do not overlap each other on a figure, the character string to be arranged in correspondence with the figure is designated in advance on the upper side, the lower side, the left side, or the right side of the figure. Arrangement means (4) for arranging at the standard arrangement position and the degree of overlap of the number of simulation lengths designated in advance when the character string overlaps with the figure or another character string at each of these arranged positions. And an overlapping degree check means (5) for calculating the above, and when there is no overlap, a character string is arranged at the standard arrangement position or that position within the search range, while when there is overlap, the smallest overlap simulation calculated above is performed. An automatic character string arranging device comprising: a rearrangement means for arranging a character string at a number of long positions. 2. As the simulation order, the simulation order of the upper, lower, left and right sides of the line segment extending from the figure is lowered, and the upper and lower sides of the line segment extending from the figure are the sparsest. The simulation order determination means (3) for increasing the simulation order of the side, the left side, and the right side, setting the simulation order of the upper side, the lower side, the left side, and the right side of the figure as parameters in advance, and determining them in this order. ) Is provided, The automatic arrangement device of the character string according to claim 1 characterized by things. 3. The character string according to claim 1 or 2, wherein the search range is a rectangle including predetermined standard arrangement positions of upper side, lower side, left side, and right side. Automatic placement device.