JP5741207B2 - Deformation map display device - Google Patents

Description

  The present invention relates to a deformed map display device for deforming a map.

  In a railway route map or an expressway map displayed on a car navigation system, a deformed deformed route map is used so that it is easy to understand and easy to see. Deformed route maps and road maps need to be deformed while maintaining the positional relationship between the routes and roads. For this reason, deformed route maps and road maps designed in advance are often used. However, for example, when a route map or a road map is deformed in accordance with the position on the map of the user, manual design is impossible because there are infinite deformation patterns. Therefore, for example, there is a system in which the system automatically adjusts the interval between route maps and road maps as in Patent Document 1. (Patent Document 1).

JP 2004-361828 A

  The conventional technology is for adjusting the distance between routes, and it does not cause a significant change of nodes, so high-speed deformation processing was possible even with low-resource arithmetic devices such as embedded devices. There has been a problem that it is difficult to perform processing in which a large number of nodes are moved in real time using a low-resource arithmetic unit.

  The present invention has been made in order to solve the above-described problems. Of the deformation processing, the graphic accelerator includes a movement determination process and a drawing process for determining whether or not a node can be moved with a large number of trials. It is an object of the present invention to enable real-time processing of deformation and drawing processing of a larger number of nodes by performing processing with hardware called “H”.

The present invention is based on the movement determination request from the computing means, and the line connecting the destination of the stored node and the node is moved by a predetermined distance in the storage means, the nodes stored in said storage means It determines whether or not to intersect with a route including other nodes except for, and if it does not intersect, the movement determination means for storing the position information of the movement destination in the storage means as the position information of the node, and the drawing command from the calculation means based on, in which a drawing means for drawing the deformed view using the data including position information of the node stored in the storage means.

According to the present invention, on the basis of the movement determination request from the computing means, and the line connecting the destination of the stored node and the node is moved by a predetermined distance in the storage means, stored in said storage means and said determining an intersection whether the route including the other nodes except the node stored in the storage unit the location information of the destination if not intersect as the position information of the node, based on a drawing command from said computing means Since the deformed diagram is drawn using the data including the position information of the node stored in the storage means, the movement determination process with a large number of trials is executed by hardware different from the calculation means in the deformation process. As a result, the processing load on the computing means can be reduced.

Explanatory drawing about a node and an edge. 1 is a configuration diagram of a deformed map drawing device in Embodiment 1. FIG. 3 is a flowchart showing a flow of processing in the first embodiment. 6 is an explanatory diagram of a peripheral route search method in Embodiment 1. FIG. FIG. 7 is a flowchart when the result of the movement determination process in the first embodiment is used for the movement of the next node. The figure which implemented the periphery edge search in the case of moving the node P30 in the route A in Embodiment 1 to the point P31. The figure which implemented the movement determination of the node which belongs to a route after the periphery edge search in Embodiment 1. FIG. FIG. 7 shows the result of the movement determination when the node P32 on the route B where the movement determination is impossible is moved to the point P33 using the movement determination result of FIG. The movement determination process result at the time of using the movement determination result of FIG. Explanatory drawing which shows the process of the movement determination by the intersection determination of the node and edge in Embodiment 1. FIG. Explanatory drawing which shows the process of the movement determination by the inside / outside triangle determination of the node in Embodiment 1. FIG. FIG. 3 is a diagram showing a configuration of data stored in a storage device 300 according to the first embodiment. 5 is a flowchart for performing a movement determination process from the data structure stored in the storage unit 300 according to the first embodiment. 5 is a flowchart for performing an automatic drawing process as seen from the data structure of the storage unit 300 according to the first embodiment. FIG. 3 is an example of a data configuration diagram of a layer data area 502 according to the first embodiment. 5 is an example of a route decorated based on the data format of the decoration data area 504 according to the first embodiment. 6 shows an example of the data format of the decoration data area 504 in the first embodiment. The figure which shows the case where one route branches into two routes like the route 523 and the route 524. 4 shows an example of the data format of the node data area 505 in the first embodiment. 5 is a drawing example of a route when the corners are rounded in the first embodiment. The figure explaining the route width area | region 602 enclosed with a dotted line, when the width w602 is set to the route 601 in Embodiment 2. FIG. An example of movement determination when the minimum separation width in the second embodiment is set. The figure which showed the result of having moved the node from P40a of FIG. 22 to P40b. The figure which showed the result of having moved the node from P40a of FIG. 22 to P40c. 10 is a flowchart of route overlap determination processing performed by the drawing unit 230 when a minimum separation width is set in the second embodiment. FIG. 26 is an execution example of an overlap determination process in S64 of FIG. 25 in the second embodiment. The example which performed the movement determination using the route width area | region in Embodiment 2, and displayed the station on the route. The example of the map before correction at the time of applying the route in Embodiment 3, a station, a station name, and route information to a movement determination. The example of the map which carried out correction drawing without the overlap area | region of FIG. The figure which shows the case where the node 700 on the route A in Embodiment 4 is moved to the point 701. FIG. The figure which shows the node data and route of the route B which show the case where the node 700 on the route A in Embodiment 4 is moved to the point 701. The figure which shows the case where the node 700 on the route A in Embodiment 5 cannot be moved to the point 701. FIG. The figure which shows the case where the node 700 on the route A in Embodiment 5 can be moved to the point 701. FIG. The figure which showed the example which complements and draws the intermediate state of a deformation | transformation, when transforming from the route map before deformation deformation of Embodiment 6 to the route map after deformation deformation. Explanatory drawing which showed the calculation method of the route map data of the intermediate state of the deformation | transformation of Embodiment 6. FIG.

In describing the following embodiments, definitions of nodes and edges will be described.
FIG. 1 is an explanatory diagram of nodes and edges.
A node indicates a point that becomes a corner of a route, and a line segment between the nodes is an edge.
Embodiment 1 FIG.
In the first embodiment, a deformed map drawing apparatus will be described in which a movement determination process and a drawing process for determining whether or not a node can be moved are processed by hardware.

FIG. 2 is a configuration diagram of the deformed map drawing apparatus according to the first embodiment.
In FIG. 2, a calculation unit 100 is a CPU or the like, and is a unit that makes a determination request for a drawing command or a node deformation process to the movement determination drawing unit 200.
The movement determination drawing unit 200 is a graphic accelerator or the like, and is a unit that performs movement determination processing and graphics drawing. The movement determination drawing unit 200 is configured by hardware (generally a graphic accelerator) different from the calculation unit 100, but even if these functions can be configured as another processing unit in the hardware of the calculation unit 100. It doesn't matter.
The storage means 300 is means for storing data necessary for graphics processing, in addition to node coordinate information and route decoration information, such as a DRAM.

Further, the movement determination drawing unit 200 includes a movement determination unit 210, an automatic drawing unit 220, and a drawing unit 230.
The movement determination unit 210 determines whether the node can be moved based on the movement determination request from the calculation unit 100.
Automatic drawing means 220, based on the drawing command from the arithmetic unit 100, the node coordinates data recorded in the storage unit 300, reads the drawing data from the decoration data route set as a drawing command, the drawing to the drawing unit 230 Run the instruction.
The drawing unit 230 executes the drawing command of the deformed diagram from the automatic drawing unit 220 and also executes the drawing of the vector figure from the calculation unit 100.

Next, the operation will be described.
FIG. 3 is a flowchart showing the flow of processing in the first embodiment.
As an initial state, initial node coordinate data and route decoration information are developed and stored in the storage means 300.
In S <b> 11, the calculation unit 100 issues a node movement determination command to the movement determination unit 210 for map deformation based on the node coordinate data stored in the storage unit 300.
In S12, the movement determination unit 210 determines whether the relative positional relationship of the movement target node with other nodes does not change. If the determination result indicates that the relative positional relationship with other nodes has changed and the movement is impossible, the computing unit 100 attempts to move the other nodes.
S13 The movement determination unit 210 rewrites the coordinates of the node coordinate data stored in the storage unit 300 and moves the node if the relative positional relationship with other nodes does not change and the determination result is movable. .
In S14, the above-described processing is executed until the desired transformation is completed.
In S15, when all the movements are completed, when the calculation unit 100 issues a drawing command to the automatic drawing unit 220, the automatic drawing unit 220 sets various parameters for the drawing unit 230, and then draws the drawing command. The means 230 is caused to execute drawing.

Hereinafter, the movement determination process by the movement determination unit 210 of the movement determination drawing unit 200 in S12 and the automatic map drawing process in S15 will be described in detail.
First, the movement determination process in S12 will be described.
The movement determination process in S12 includes a peripheral edge search and a movement determination process. The peripheral route search is a process that detects nodes and edges around the movement target node and limits the processing range of the movement determination. The movement determination process determines whether the relative positional relationship between the nodes does not collapse. It is processing to do.

First, the peripheral edge search will be described.
FIG. 4 is an explanatory diagram of a peripheral edge search method according to the first embodiment.
When the node to be moved is the node P1, an edge is detected that intersects the side of the square 400 whose one side is 2r with the node P1 as the center. At this time, the length 2r of one side can be set to an arbitrary length designated by the user.
The edge search range can be a variety of figures such as rectangles and circles in addition to squares.

Next, details of the movement determination process will be described.
FIG. 5 is a flowchart when the result of the movement determination process in the first embodiment is used for the movement of the next node.
In S <b> 21, the movement determination unit 210 receives a movement determination command from the calculation unit 100.
In S22, the movement determination unit 210 performs movement determination based on the movement determination command received. A specific movement determination method will be described later.
As a result, if the movement determination target node is movable, the movement determination unit 210 rewrites the coordinates of the node coordinate data stored in the storage unit 300 and moves the node in S23. Thereafter, the operation is repeated from S21 at the next target node.
If the movement determination target node is not movable, the detailed determination result made by the movement determination unit 210 is written in the storage unit 300 in S24.
In S25, the computing unit 100 refers to the detailed determination result described above, and resets it as a movement determination target of another node, that is, a node determined to intersect at the time of movement determination in S26. Thereafter, the operation is repeated from S21.
Therefore, the movement determination drawing unit 200 can perform the movement determination and the drawing based on the movement determination result based on the movement determination command of the calculation unit 100. In addition, the movement determination drawing unit 200 writes the detailed determination result in the storage unit 300, and when the movement determination target node cannot be moved, the calculation unit 100 similarly moves the cause node. Since the movement determination drawing unit 200 determines whether the determination is possible and draws based on the movement determination result, the detailed determination result can be notified to the calculation unit 100. Based on the determination result, the node movement determination and drawing can be performed with only the determination instruction of the next node movement, so that the processing load on the computing means 100 can be reduced.

Next, a specific example of peripheral edge search and movement determination processing will be described.
6 to 9 are specific examples of the peripheral edge search and movement determination process in the first embodiment.

  FIG. 6 is a diagram in which a peripheral edge search is performed when the node P30 on the route A in the first embodiment is moved to the point P31. A result of searching for a route included in the rectangular range 401 is written in the storage unit 300 as a search route result 402. This corresponds to the peripheral edge search for performing the movement determination process in S12 of FIG.

  Next, FIG. 7 is a diagram in which the movement determination of the nodes belonging to the route is performed after the peripheral edge search in the first embodiment. When the node P30 of the route A is moved to the point P31, the route A should be on the left side of the route B, but there is a section where the route A is on the right side of the route B due to the movement of the node. The positional relationship is broken. On the other hand, the relative positional relationship between the route C and the route D with respect to the route A is not broken. The above result is written in the movement determination result 403 of FIG. This corresponds to S22, S23, and S24 in FIG.

FIG. 8 shows the result of the movement determination when the node P32 on the route B where the movement determination is impossible is moved to the point P33 using the movement determination result of FIG.
In FIG. 7, when the node P30 of the route A is moved to the point P31, the determination result is that it intersects with the edge of the route B. The computing unit 100 uses the movement determination result 403 of FIG. 7 written in the storage unit 300 to determine whether or not the node P32 belonging to the route B determined to intersect the route A can be moved to P33. . Using the movement determination result means that a node belonging to a route determined to intersect with the previous movement determination result is a target of the next movement determination. This corresponds to S25, S26, and S21 in FIG.
In FIG. 8, it carries out similarly to FIG. 7, and next, the movement determination is impossible on the route C.

FIG. 9 shows a movement determination process result when the movement determination result of FIG. 8 is used. It is determined whether or not the node P34 on the route C is moved to the point P35 using the movement determination result of FIG. In this case, since the relative position with respect to other routes is not changed, the node can be moved. This corresponds to S22 and S23 in FIG.
As described above, after reaching S23 in FIG. 5, if there is another node to be moved, another node to be moved is selected.
As described above, a plurality of determination processes such as FIG. 7 and FIG. 8 exist by the process of the past determination result writing S24. In that case, each determination result can be written out as a determination result independently, or can be set to overwrite. It is also possible to set valid / invalid of the determination process.
However, although the next node selection method is arbitrary, it is also possible to store all the determination results indicating that the movement is impossible, and to select the movement target node based on the result determined that the previous movement is impossible. . In this case, P32 in FIG. 8 is the movement target node. Then, after it is determined that it can move, P30 in FIG. 7 that is determined to be unmovable becomes the movement target node.
Furthermore, according to the above-described determination method, by allowing the detailed determination result to be written independently, the arithmetic unit analyzes the determination result, and a flexible process that permits a modification that sometimes ignores the determination content There is also an effect that can be done.

Next, a specific method in the movement determination in S22 of FIG. 5 will be described.
FIG. 10 is an explanatory diagram illustrating movement determination processing based on node / edge intersection determination according to the first embodiment.
When determining to move the node P11 to the point P12, it is determined whether the edge L1 between the nodes P13 and P14 on the other routes and the line segment L2 connecting the node P11 and the point P12 intersect. When the edge L11 and the line segment L2 intersect as shown in FIG. 10, it is determined that the movement is impossible.

FIG. 11 is an explanatory diagram illustrating a movement determination process by determining whether a node is inside or outside a triangle according to the first embodiment.
When the determination of moving the node P20 to the point P21 is performed, it is determined whether or not the node P23 of another route exists within the triangle formed by the nodes P22 and P20 that are adjacent to the node P20 and the point P21. As shown in FIG. 11, when the node P23 of another route exists inside the triangle, it is determined that the movement is impossible.
Regarding the movement determination process, the above-described two types of determination process are shown, but there are a plurality of other methods. Of course, determination processing other than the two methods described above may be used.

Next, the configuration of data stored in the storage unit 300 will be described.
FIG. 12 is a diagram illustrating a configuration of data stored in the storage unit 300 according to the first embodiment. From this data, node movement determination and route automatic drawing processing are performed.
The global setting area 501 is an area for setting data to be applied to the whole. You can set the coordinate transformation matrix to be applied to the final map as a whole and specify the number of routes.
A layer data area 502 is an area for setting a drawing order of routes. This is an area for drawing a route according to the set layer number.
The pointer data area 503 is an area for designating the start position of the decoration data and node data for each route stored in the decoration data area 504 and the node data area 505.
The decoration data area 504 is an area for setting the decoration of the route. A line decoration is expressed by drawing lines with different line widths and colors.
The node data area 505 is an area that stores node coordinate data. Based on the data in this area, the above-mentioned movement determination is performed, and at the same time, the drawing coordinates of the route are designated.

A configuration example of data stored in the storage unit 300 is shown below.
FIG. 15 is an example of a data configuration diagram of the layer data area 502 according to the first embodiment. A layer number for each route is assigned to the layer data area 502. The route is drawn in ascending or descending order of the layer number.
In a branch / merging route, it is conceivable that the other route affects movement determination while one route is undergoing deformation processing. In order to prevent this, it is only necessary to perform the above-described setting so that the movement determination of the other route is ignored during the deformation process of one route in the branch / merging route.
Therefore, when the layer number has a special value such as a negative value as in the route E510, the route can be set as an invalid route so that movement determination and drawing are not performed.

FIG. 17 shows an example of the data format of the decoration data area 504 in the first embodiment.
Since the decoration of a route can be expressed by overlapping the lines, a plurality of line parameters can be set for one route. The decoration parameter includes a line width, a color, a blurring degree for expressing a shadow, an offset for expressing a shift degree of the shadow, and the like. At the time of the drawing command, it is executed from above the decoration data of the route. Each time the automatic drawing unit 220 finishes setting a parameter for one line, the drawing command is executed, and the drawing unit 230 draws. When the decoration of one route ends, a route drawing end command is clearly indicated.
FIG. 16 is an example of a route decorated based on the data format of the decoration data area 504 in the first embodiment. The shadow 520 is expressed as a line whose coordinates are shifted from the original line segment after being blurred. If the lines are drawn in the order of the shadow 520, the thick line 521, and the thin line 522, a route with a shadowed decoration can be expressed.
FIG. 18 is a diagram illustrating a case where one route branches into two routes such as a route 523 and a route 524.
In the decoration data area 504, as shown in FIG. 18, there is a case where the route branches into two routes. Therefore, it is not always necessary to prepare decoration data for each route, and a plurality of routes use one decoration data. Also good.

FIG. 19 shows an example of the data format of the node data area 505 in the first embodiment.
Node data is constructed from the coordinate data of each node. When the coordinate value is a special value such as a negative value as in the node D530, the node can be set as an invalid node and ignored at the time of drawing.
In the data format of the node data described above, since the node data can be linearly arranged in the storage means 300, there is an effect that it can be handled as a node data array from the arithmetic unit.
FIG. 20 is a drawing example of a route when the corners are rounded in the first embodiment.
When a radius R is rounded at the corner of the route, a curve 543 such as a spline is drawn with on-curve points 541 and 542 as points that have advanced from the original node 540 in the forward and backward node directions by R and off-curve points. The rounded corner R is not included in the node data area 505 or the like, but is specified uniformly by another means, for example, register access from the arithmetic means 100.

FIG. 13 is a flowchart when the movement determination process is performed from the data structure stored in the storage unit 300 according to the first embodiment.
In S41, a route effective for the search is searched from the layer data area 502. This corresponds to route extraction in the peripheral edge search in FIG. 6, and corresponds to the peripheral edge search for performing the movement determination process in S12 in response to the movement determination command in S11 of FIG.
In S42, the node data start position of each route in the target node data region of the route that is the search result is acquired from the pointer data region 503.
In step S43, target node coordinate data is read from the node data area 505.
If the determination of all routes is not completed in S44, the process returns to the effective route search in S41, and the determination is continued. If the determination of all routes is completed, the determination process is terminated.

Next, S15 in FIG. 3 and automatic map drawing processing will be described in detail.
When the movement determination unit 210 repeats the node movement determination and the movement process to the storage unit 300, the calculation unit 100 issues a deformation diagram drawing command to the automatic drawing unit 220. The automatic drawing means 220 that has received the drawing command sets decoration parameters from the decoration data of the route recorded in the storage means 300, and sends the drawing parameters to the drawing means 230 along the node coordinate data re-stored after the movement determination. Then, the route is drawn.

FIG. 14 is a flowchart for performing automatic drawing processing as seen from the data structure of the storage unit 300 according to the first embodiment.
In S51, the drawing setting set in the global setting area 501 is validated.
In S <b> 52, the calculation unit 100 searches for the route of the lower layer according to the layer order set in the layer data area 502.
In S53, the pointer data of the route searched by the search in S41 of FIG. 13 is acquired.
In S54, the automatic drawing means 220 reads the decoration data in the decoration data area 504 from the pointer data of the searched route, and sets parameters.
In S55, when the decoration setting in S54 is completed, the drawing unit 230 reads node data including node data re-stored after the movement determination from the node data area 505, and draws a route according to the node coordinates.
In S56, it is determined whether or not the decoration of the route in S55 is completed. If the decoration of the route is not completed, the process returns to the decoration parameter setting process in S54 and another decoration process is executed. If the decoration of the route has been completed in S56, the drawing completion determination for all routes in S57 is executed. If it is determined that the drawing of all routes has not been completed, the process returns to S52, and if all the routes have been drawn, the processing ends.

Therefore, in this embodiment, in order to draw a deformed diagram for the node stored in the storage unit 300 based on the movement determination request from the calculation unit 100, it is stored in the storage unit 300 by the movement of a predetermined distance. a movement determining section 210 determines the intersection whether the other nodes, the node coordinates data recorded in the storage unit 300 based on the drawing command from the arithmetic unit 100, an automatic drawing means for drawing settings from decorations data routes 220 and a drawing unit 230 that draws a deformed diagram based on a drawing command from the automatic drawing unit 220, the movement determination process is performed by a configuration on the drawing side different from the calculation unit 100. The movement determination / drawing process is speeded up.

  Further, by writing the detailed result of the movement determination performed by the movement determination unit 210 in the storage unit 300, the calculation unit 100 can designate the intersected node for the next movement determination based on the result. The effect that the processing burden of 100 can be reduced is obtained.

Embodiment 2. FIG.
In the first embodiment, the route is regarded as a line having no width. In the present embodiment, a case will be described in which the route is given a width in order to improve the readability of the line. A mode in which the minimum separation width set for each route is used for the movement determination process will be described. Other items have the same functions as those of the first embodiment.

  FIG. 21 is a diagram illustrating the route width region 602 surrounded by a dotted line when the width w602 is set for the route 601 in the second embodiment. By setting the width w 602 along the route 601, the line width region 602 is set. At the end point of the route 601, the line width region 602 is set in a semicircular shape.

  FIG. 22 is an example of movement determination when the minimum separation width is set in the second embodiment. Consider a case where the node P40a in the line width region 610 is moved to a point P40b and a point P40c, respectively.

The above-described movement determination considering the minimum separation width may be performed using the overlapping of the routes using the drawing unit 230.
FIG. 25 is a flowchart of route overlap determination processing by the drawing unit 230 when the minimum separation width is set in the second embodiment.
In S <b> 61, the drawing unit 230 stores the drawn data in the primary storage address for screen display of the storage unit 300 in the line width region having the edge having the end point as the movement determination target node and the minimum separation width. .
Next, in S62, the movement determination unit 210 performs the same process as the peripheral edge search which is a part of the movement determination process in FIG. 3 and S12 of the first embodiment.
Next, in S63, the line width area having the minimum separation width from the edge of the peripheral route node searched by the peripheral edge search is stored as drawn data at the primary storage address for screen display. 300.
Next, in S64, the movement determination unit 210 stores the line width region having the minimum separation width of the edge including the movement target node stored in the storage unit 300 and the line having the minimum separation width of the edge including the node of the peripheral route. It is determined whether or not the width area overlaps.
Next, in S65, the determination result in S64 is written. The format is the same as in the first embodiment. If the movement is OK, the movement determination unit 210 stores the data after the movement in the storage unit 300. Finally, in S66, it is checked whether the determination has been completed for all the surrounding routes. If so, the process returns to S63, and if completed, the process ends.

FIG. 23 is a diagram illustrating a result of moving the node from P40a to P40b in FIG. In this case, since there is no area where the line width area 610 and the line width area 611 overlap, it is determined that the movement is possible.
FIG. 24 is a diagram illustrating a result of moving a node from P40a to P40c in FIG. In this case, since the overlapping area 612 of the route width area 610 and the route width area 611 is generated, it is determined that the movement is impossible.

FIG. 26 is an execution example of the overlap determination process in S64 of FIG. 25 in the second embodiment.
In accordance with the flowchart of FIG. 25, the route width area 620 including the movement target node is drawn (S61). After the peripheral edge search (S62), the route width area 621 of the peripheral route is drawn (S63). In S64, if the data of the drawing destination route width area 620 is read from the storage means 300 at the time of drawing the route width area 621, the route width area 620 previously drawn and stored by the storage means 300 can be detected.

In particular, when applied to railway maps, it is necessary to display a station on a route.
FIG. 27 is an example in which a station is displayed on a route by making a movement determination using the route width region in the second embodiment.
A station 632 is drawn on the route 630, and a station 635 is drawn on the route 633. The station display is expressed as a double circle. Stations 632 and 635 are transfer stations to which different routes can be transferred, and can be expressed explicitly as transfer stations by displaying a double circle of the station display adjacent to each other. At this time, if the route width area is set to the same width as the diameter of the double circle of the station display, the route width 631 is set to the route 630 and the route width 634 is set to the same width as the diameter of the double circle of the station display. be able to.

Therefore, in this embodiment, in order to draw a deformed diagram for the node stored in the storage unit 300 based on the movement determination request from the calculation unit 100, it is stored in the storage unit 300 by the movement of a predetermined distance. drawing and movement determining means 210 determines, using the line width region for cross whether the other nodes, the node coordinates data recorded in the storage unit 300 based on the drawing command from the arithmetic unit 100, the decoration data routes Since the automatic drawing means 220 for setting and the drawing means 230 for drawing the deformation diagram based on the drawing command from the automatic drawing means 220 are provided, the movement determination process is performed by a drawing side configuration different from the calculation means 100. As a result, the load on the calculation means 100 is reduced and the function of the drawing means 230 is used, so that the scale of the entire apparatus is reduced. There is an effect.

Embodiment 3 FIG.
In the present embodiment, an embodiment will be described in which overlap determination is performed for other display objects such as character strings to be entered on a map. Other matters have the same functions as those in the first and second embodiments.

In the second embodiment, when the overlap determination is performed in consideration of the route width region, in FIG. 26, if the data of the route width region 620 that is the drawing destination is read from the storage unit 300 when the route width region 621 is drawn, It is shown that the route width area 620 drawn and stored in the storage means 300 can be detected.
By applying this, when the movement determination unit 210 determines overlap, not only the route width area stored for drawing in the storage unit 300 but also a map such as a background or object stored in advance in the storage unit 300 for drawing is used. By detecting the character string entered above, it is possible to detect overlap of display objects by the movement determination means 210.

FIG. 28 is an example of a map before correction when the route, the station, the station name, and route information in the third embodiment are applied to the movement determination.
In FIG. 28, the station name 640 overlaps the route 641, the station name 642 overlaps the station display 643, and the route information display 644 overlaps the route 645.
Therefore, as described above, as in the second embodiment, the overlapping area of the route information display 644 can be detected by reading data from the drawing data stored in the storage unit 300 for drawing.
FIG. 29 is an example of a map that is corrected and drawn without the overlapping area of FIG.

The overlapping region 643 is generated because a rounded corner is set on the route 645. That is, when the rounding of the corner is drawn by the drawing unit 230 and the calculation unit 100 determines the display overlap as in the conventional technique, the rounding of the corner needs to be calculated again by the calculation unit 100, and the processing time is long. Take it.
Therefore, if the movement determination unit 210 performs overlap determination detection using drawing data drawn by the drawing unit 230 and stored in the storage unit 300 for drawing, processing by the calculation unit 100 is not necessary. The effect of increasing the speed is obtained.

Therefore, in the present embodiment, in order to draw a deformed diagram for the nodes stored in the storage unit 300 based on the movement determination request from the calculation unit 100, the storage unit 300 stores a display for display by movement of a predetermined distance. automatic drawing performing the movement determining unit 210 determines the overlap of the display objects, the node coordinates data recorded in the storage unit 300 based on the drawing command from the arithmetic unit 100, a drawing setting from decorations data routes Since the apparatus 220 and the drawing means 230 for drawing the deformed diagram based on the drawing command from the automatic drawing means 220 are provided, the movement determination process is performed by a configuration on the drawing side different from the calculation means 100, so that the calculation means Since the load of 100 is reduced and the function of the drawing unit 230 is used, there is an effect of reducing the scale of the entire apparatus.

Embodiment 4 FIG.
In the first embodiment, as shown in FIG. 14, a route that is not used for movement determination can be selected by layer data, but this will not be described for each edge.
Other matters have the same functions as those of the first to third embodiments.

FIG. 30 is a diagram illustrating a case where the node 700 on the route A in the fourth embodiment is moved to the point 701. In this state, it is determined that the movement is impossible due to the positional relationship with the route B.
Therefore, if the node coordinate value shown in the node data area 505 stored in the storage unit 300 uses an absolute value, and if the positive / negative value is set to indicate whether or not the intersection determination is used, the coordinate information is impaired. In addition, it is possible to identify the presence or absence of use for movement determination for each edge.

FIG. 32 is a diagram illustrating node data and a route of a route B illustrating a case where the node 700 on the route A in the fourth embodiment is moved to a point 701 as illustrated in FIG. 31.
As shown in FIG. 31, in the route B node data, two points from the top are displayed as negative, and the edge between these two points is excluded from the overlap determination with other lines. Accordingly, the movement determination unit 210 performs the determination by ignoring the edge 704 of the route B from the determination, so that the node 702 of the route A can be moved to 703 and the drawing unit 230 can move and rewrite it.

  Therefore, in the present embodiment, the coordinates of the node coordinate data use absolute values, and positive / negative can be used to identify whether or not overlap determination is used, thereby enabling overlap determination for each edge.

Embodiment 5 FIG.
In the first embodiment, it is possible to set the drawing or movement determination not to be performed according to the value of the layer data area 502 as in the route E510 in FIG. 14, but it is possible to draw a less important route by another method. The form for selecting not to perform a movement determination is shown. In addition to speeding up drawing and movement determination, this method can improve readability by deleting excess information.
Other matters have the same functions as those of the first to fourth embodiments.

FIG. 32 is a diagram illustrating a case where the node 700 on the route A according to the fifth embodiment cannot be moved to the point 701.
The layer data area 502 stores an allowable failure frequency table 702. The allowable failure frequency table 702 is a table indicating the number of times that individual routes can be determined to be unmovable by the movement determination when intersecting in the movement determination. The numerical value is set for each route.
As shown in FIG. 32, when the node 700 is moved to the point 701, the route B is caught in the movement determination. At this time, the movement determination unit 210 updates the value of the allowable failure frequency table 702 in the layer data area 502 by subtracting one from the numerical value of the route B recorded in the allowable failure frequency table 702. In the allowable number-of-failures table, a route having a numerical value of 0 or less is set to be excluded from drawing and movement determination.
FIG. 33 is a diagram illustrating a case where the node 700 on the route A according to the fifth embodiment can be moved to the point 701. In the table shown in the allowable failure count table 702, since the route B is 0, the movement determination unit 210 excludes the determination from the drawing / movement determination of the route B705 when the node is moved from the node 703 to the point 704. Therefore, it can move as shown in FIG. It is also possible to perform a process of not displaying the route excluded from the movement determination.

  As described above, the allowable failure frequency table 702 is set in the layer data area 502, and when the number of times determined to be unable to move by the movement determination by the movement determination means 210 exceeds a predetermined number, the route of the deformed diagram In order to exclude and determine from the movement determination, by setting the route drawing priority, the route to be processed is deceived, the processing speed can be improved, and at the same time extra from the final deformed route map Information can be deleted, and the effect of improving the readability of the user can be expected.

Embodiment 6 FIG.
In the first embodiment, one route map is drawn from node data, decoration data, and the like. Next, before and after deformation, the data before and after the deformation is complemented to smoothly move the data before and after the deformation. The form for displaying an intermediate image is shown. Other matters have the same functions as those of the first to fourth embodiments.

  FIG. 34 is a diagram showing an example in which the intermediate state of the deformation is complemented and drawn when the route map before deformation deformation of the sixth embodiment is deformed to the route map after deformation deformation. Consider a case where the node 706 is moved to a point 707 in the left diagram. In the center of the figure, a route map in the intermediate state of the obtained deformation is displayed. The route 708 has a slightly deformed display, and the route 709 is a route for which drawing is omitted and is drawn in a light color. The right figure is a figure when the deformation is completely completed.

FIG. 35 is an explanatory diagram showing a method of calculating route map data in the intermediate state of the modification of the sixth embodiment. The drawing unit 230 stored in the storage unit 300 prepares data before and after transformation for data including decoration data and node data. The drawing means 230 is created by copying drawing data 710 that is actually used for drawing from the untransformed data. The difference data 711 prepared by the drawing unit 230 is data obtained by dividing the post-deformation data and the pre-deformation difference data by a certain transformation time in order to draw the route while performing the transformation operation. New drawing data 712 is obtained by adding the difference data 711 to the drawing data 710 each time the screen is updated. The drawing data 712 is data that is actually drawn on the display screen.
The above deformation time can be specified by the user.
In the case of a route in which drawing is omitted as in the example of the route 709 in FIG. 33, difference data is obtained by setting the transparency of the color of the route after deformation to 100%.
In addition, all the effects can be enjoyed by configuring the deformed map drawing device that combines the first to sixth embodiments, which are all the embodiments.

100 arithmetic means 200 movement determination drawing means 210 movement determination means 220 automatic drawing means 230 drawing means 300 storage means 501 global setting area 502 layer data setting area 503 point data setting area 504 decoration data area 505 node data area

Claims (8)

Based on the movement determination request from the computing means, and the line connecting the destination of the stored node and the node is moved by a predetermined distance in the storage means, the other nodes except for the node stored in the storage means A movement determination unit that determines whether or not to intersect with a route including the line, and stores the position information of the movement destination in the storage unit as the position information of the node if not intersecting,
Based on the drawing command from said operation means, deformed map display device characterized by comprising a drawing means for drawing the deformed view using the data including position information of the node stored in the storage means . The movement determination means is based on whether or not the other node is included in a triangular area having vertices of the node of the movement source, a node adjacent to the node of the movement source, and the movement destination. The deformed map display device according to claim 1, wherein whether or not the movement source node is movable is determined. The determination result performed by the movement determination unit is stored in a storage unit, and the calculation unit sets a node included in a route determined to intersect based on the determination result as a target of the next movement determination. The deformed map display device according to any one of 1 and 2. It said movement determining means, claims, characterized in that to determine the drawing data using the route width region on route including the node after the mobile, cross whether the line width region of routes including the other nodes The deformed map display device according to any one of 1 to 3. Said movement determining means, characterized by determining the drawing data using the display object stored for display on the route including the node after the mobile, cross whether the route of the display object including the other nodes The deformed map display device according to any one of claims 1 to 4.   The movement determination means determines validity / invalidity of intersection determination of a predetermined route according to the sign of a plurality of route layers in the layer data area of the storage means. 6. The deformed map display device according to any one of 5 above.   The movement determination means determines validity / invalidity of an intersection determination between specific nodes on a predetermined route based on positive / negative of values of a plurality of nodes on the route that are stored in a node data area of the storage means. The deformed map display device according to any one of claims 1 to 6.   The movement determination means defines a predetermined number of times that it is possible to determine whether or not the intersection of the movement determination is possible depending on the number of allowable failures of a plurality of routes in the layer data area of the storage means. The deformed map display device according to any one of claims 1 to 7, wherein the intersection determination of a predetermined route is determined to be invalid.

Images