WO2012123986A1 - 文字列配置装置 - Google Patents
文字列配置装置 Download PDFInfo
- Publication number
- WO2012123986A1 WO2012123986A1 PCT/JP2011/001477 JP2011001477W WO2012123986A1 WO 2012123986 A1 WO2012123986 A1 WO 2012123986A1 JP 2011001477 W JP2011001477 W JP 2011001477W WO 2012123986 A1 WO2012123986 A1 WO 2012123986A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- unit
- character
- curve
- character string
- node
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/60—Editing figures and text; Combining figures or text
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
- G09B29/10—Map spot or coordinate position indicators; Map reading aids
- G09B29/106—Map spot or coordinate position indicators; Map reading aids using electronic means
Definitions
- the present invention relates to a character string arrangement device for arranging a character string such as a road name on a map.
- a character string such as a road name is arranged along a road line (hereinafter referred to as “road node string”) from a node (hereinafter referred to as “placement start node”) where the character string starts to be arranged.
- road node string a road line
- place start node a node
- a car navigation system equipped with a character string arrangement function is known (for example, see Patent Documents 1 to 3). If this character string arrangement function is used, characters are arranged in parallel with the road, so when arranging a character string straddling two links, an angle change of the road link (hereinafter referred to as “road angle change”), The change in the character arrangement angle (hereinafter referred to as “character angle change”) becomes equal.
- the character string displayed by using the character string arrangement function in the conventional character string arrangement device described above has the same change in the road angle and the change in the character angle. Therefore, as the change in the road angle increases, the change in the character angle also increases. There is a problem that the readability of the character string decreases.
- the present invention has been made to solve this problem, and an object of the present invention is to provide a character string arrangement device that improves the readability of a character string.
- a character string arrangement device includes a character string arrangement data acquisition unit that acquires character string arrangement data for arranging a character string along a road, and character string arrangement data acquired by the character string arrangement data acquisition unit
- a road node sequence decimation unit that decimates some of the nodes that constitute the road node sequence included in the road node sequence, and a control point sequence creation unit that creates a control point sequence from the road node sequence after decimation by the road node sequence decimation unit;
- a curve approximation unit that creates a node sequence that approximates the curve of the control point sequence created by the control point sequence creation unit with a straight line, and a curve approximation node that saves the node sequence created by the curve approximation unit as a curve approximation node sequence
- a string storage unit and a character string arrangement processing unit that performs character string arrangement processing based on the curve approximation node sequence stored in the curve approximation node sequence storage unit are provided.
- the character angle change can be reduced by arranging the character string on the curve created from the road link, so that the readability of the character string can be improved.
- FIG. 1 is a block diagram showing a configuration of a character string arrangement device according to Embodiment 1 of the present invention.
- the character string arrangement device includes a character string arrangement data storage unit 1, a character string arrangement data acquisition unit 2, a road node sequence thinning unit 3, a control point sequence creation unit 4, a curve approximation unit 5, a curve approximation node sequence storage unit 6, and A character string arrangement processing unit 13a is provided, and the character string arrangement processing unit 13a further includes a curve approximation node sequence acquisition unit 13, a character string arrangement calculation unit 14, a character string arrangement registration unit 15, and an output character string arrangement storage unit 16. It has.
- the character string arrangement data storage unit 1 stores character string arrangement data.
- the character string arrangement data includes data representing a plurality of characters constituting the character string, the vertical and horizontal widths of each character, the road node string along which the character string follows, and the arrangement start node of the character string.
- the character string arrangement data stored in the character string arrangement data storage unit 1 is read by the character string arrangement data acquisition unit 2.
- the character string arrangement data acquisition unit 2 reads out and acquires character string arrangement data from the character string arrangement data storage unit 1.
- the character string arrangement data acquired by the character string arrangement data acquisition unit 2 is sent to the road node sequence thinning unit 3.
- the road node sequence decimation unit 3 decimates some of the nodes constituting the road node sequence included in the character string arrangement data sent from the character string arrangement data acquisition unit 2.
- the road node sequence after some of the nodes are thinned out by the road node sequence thinning unit 3 is sent to the control point sequence creation unit 4.
- the trajectory of the character string can be smoothed by the thinning in the road node row thinning unit 3.
- the control point sequence creating unit 4 creates a control point sequence for generating a curve from the road node sequence sent from the road node sequence thinning unit 3 along with the character string.
- the control point sequence created by the control point sequence creation unit 4 is sent to the curve approximation unit 5.
- the curve approximation unit 5 creates a curve from the control point sequence sent from the control point sequence creation unit 4, and generates a node sequence by linearly approximating the created curve.
- the node sequence generated by the curve approximation unit 5 is sent to the curve approximation node sequence storage unit 6 as a curve approximation node sequence.
- the curve approximation node sequence storage unit 6 stores the curve approximation node sequence sent from the curve approximation unit 5.
- the curve approximation node sequence stored in the curve approximation node sequence storage unit 6 is read by the curve approximation node sequence acquisition unit 13.
- the curve approximation node sequence acquisition unit 13 reads out and acquires a curve approximation node sequence from the curve approximation node sequence storage unit 6.
- the curve approximation node sequence acquired by the curve approximation node sequence acquisition unit 13 is sent to the character string arrangement calculation unit 14.
- the character string arrangement calculation unit 14 calculates the arrangement position of the character string based on the curve approximation node sequence sent from the curve approximation node sequence acquisition unit 13.
- the character string arrangement position calculated by the character string arrangement calculation unit 14 is sent to the character string arrangement registration unit 15. Details of the character string arrangement calculation unit 14 will be described later.
- the character string arrangement registration unit 15 indicates the arrangement position of the character string sent from the character string arrangement calculation unit 14 and indicates that the determination result sent from the character string arrangement calculation unit 14 has reached the predetermined number of characters.
- the output character string arrangement storage unit 16 stores the arrangement position of the character string registered by the character string arrangement registration unit 15.
- FIG. 2 is a block diagram showing a detailed configuration of the curve approximation unit 5.
- the curve approximation unit 5 includes a curve approximation node registration unit 7, a straight line determination unit 8, an on-curve intermediate point creation unit 9, a first half curve approximation unit 10, a second half curve approximation unit 11, and a single line approximation unit 12.
- the curve approximation node registration unit 7 registers the curve approximation node sequence sent from the latter half curve approximation unit 11 or the single line approximation unit 12 in the curve approximation node sequence storage unit 6.
- the straight line determination unit 8 determines whether the curve created from the control point sequence sent from the control point sequence creation unit 4 can be approximated by a straight line, in other words, whether the curve is close to a straight line. If it is determined by the straight line determination unit 8 that the sequence is not close to a straight line, the sequence proceeds to the process at the intermediate point creation unit 9 on the curve. .
- the curve midpoint creation unit 9 creates a midpoint on the curve created from the control point sequence sent from the control point sequence creation unit 4.
- the intermediate point generated by the intermediate point generator 9 on the curve is sent to the first half curve approximation unit 10 and the second half curve approximation unit 11.
- the first half curve approximating unit 10 is a straight line that represents the curve before the intermediate point sent from the on-curve intermediate point creating unit 9 among the curves created from the control point sequence sent from the control point sequence creating unit 4. Approximate.
- the node sequence created by the straight line approximation in the first half curve approximation unit 10 is sent to the second half curve approximation unit 11.
- the second half curve approximation unit 11 is a straight line that is a curve after the intermediate point sent from the on-curve intermediate point creation unit 9 among the curves created from the control point sequence sent from the control point sequence creation unit 4. Approximate.
- the node sequence created by the straight line approximation in the second half curve approximation unit 11 is connected to the node sequence sent from the first half curve approximation unit 10 and sent to the curve approximation node registration unit 7 as a curve approximation node sequence.
- the single line approximation unit 12 approximates a curve created from the control point sequence sent from the control point sequence creation unit 4 with a single straight line.
- the node sequence created by the linear approximation in the single linear approximation unit 12 is sent to the curve approximation node registration unit 7 as a curve approximation node sequence.
- FIG. 3 is a block diagram showing a detailed configuration of the character string arrangement calculation unit 14.
- the character string arrangement calculation unit 14 includes a link angle calculation unit 17, a character arrangement unit 18, a character link outside determination unit 19, a duplication determination unit 20, a parameter update unit 21, and a character number determination unit 22.
- the link angle calculation unit 17 calculates an angle formed by a link at each node (hereinafter referred to as “link angle”) based on the curve approximation node sequence sent from the curve approximation node sequence acquisition unit 13.
- the link angle calculated by the link angle calculation unit 17 is sent to the character placement unit 18.
- the character arrangement unit 18 arranges characters based on the link angle sent from the link angle calculation unit 17.
- the characters arranged by the character arrangement unit 18 are sent to the character link out-of-link determination unit 19. Details of the character arrangement unit 18 will be described later.
- the character link out-of-link determination unit 19 determines whether or not the character sent from the character placement unit 18 is out of the link. The determination result in the character link out-of-character determination unit 19 is sent to the duplication determination unit 20.
- the overlap determination unit 20 determines whether or not characters overlap based on the determination result sent from the character link out-of-link determination unit 19.
- the determination result in the duplication determination unit 20 is sent to the parameter update unit 21.
- the parameter update unit 21 updates parameters used for character string arrangement according to the determination result sent from the duplication determination unit 20.
- the parameter updated by the parameter update unit 21 is sent to the character number determination unit 22.
- the character number determination unit 22 refers to the parameter sent from the parameter update unit 21 and determines whether or not the predetermined number of characters has been reached. The determination result in the character number determination unit 22 is sent to the character string arrangement registration unit 15.
- FIG. 4 is a block diagram showing a detailed configuration of the character arrangement unit 18.
- the character arrangement unit 18 includes an initial character determination unit 23, a character arrangement position determination unit 24, a character lower left coordinate calculation unit 25, and a next character arrangement distance update unit 26.
- the initial character determination unit 23 determines whether or not the character arranged based on the link angle sent from the link angle calculation unit 17 is the first character in the character string.
- the determination result in the initial character determination unit 23 is sent to the character arrangement position determination unit 24 and the character lower left coordinate calculation unit 25.
- the character arrangement position determination unit 24 determines the character arrangement position according to the determination result sent from the initial character determination unit 23 or according to the lower left coordinates of the character calculated by the character lower left coordinate calculation unit 25.
- the arrangement position determined by the character arrangement position determination unit 24 is sent to the character arrangement position determination unit 24 or the character lower left coordinate calculation unit 25.
- the character lower left coordinate calculation unit 25 calculates the lower left coordinate of the character according to the determination result sent from the initial character determination unit 23.
- the lower left coordinate of the character calculated by the character lower left coordinate calculation unit 25 is sent to the character arrangement position determination unit 24 or the next character arrangement distance update unit 26.
- the next character arrangement distance update unit 26 determines the distance to the next character based on the lower left coordinates of the character calculated by the lower left character calculation unit 25 and updates the character spacing.
- the character spacing updated by the next character arrangement distance update unit 26 is sent to the character link out-of-link determination unit 19.
- FIG. 5 is a flowchart showing the operation of the character string arrangement device.
- the character string arrangement data includes the width and width of each character in the character string “String” and the road node string along which the character string “String” follows, and the character string “String” in the character string “String”
- Each character has a vertical width of 10 and a horizontal width of 5.
- SEPARATE_NUM indicating the number of links when a curve is approximated by a straight line is 2, and it is determined whether to approximate a curve with one link or to approximate a curve with a plurality of links.
- SEPARATE_THRESHOLD which is the boundary of the distance used, is 15, and STRAIGHT_THRESHOLD, which is the boundary of the angle change used to determine whether the curve is approximated by one link or the curve is approximated by a plurality of links, is 10. It is assumed that CULLING_THRESHOLD, which is a distance boundary for determining whether thinning is possible, is 10, and STEP_SIZE, which is an increment of range, is 1.
- FIG. 6 shows an example of the relationship between nodes and links in the road node sequence.
- character string data is acquired (step ST11). That is, the character string arrangement data acquisition unit 2 reads the character string arrangement data from the character string arrangement data storage unit 1 and acquires a road node string along which the character string follows and a character string arrangement start node. In this example, a road node string along which the character string “String” is aligned and a node that starts arrangement of the character string “String” are acquired.
- step ST12 the road node train is thinned out (step ST12). That is, the road node sequence thinning unit 3 thins out some of the nodes constituting the road node sequence included in the character string arrangement data acquired by the character string arrangement data acquisition unit 2 in order to create a smooth curve. .
- the road node sequence thinning unit 3 details of the road node sequence thinning process performed by the road node sequence thinning unit 3 will be described with reference to the flowchart shown in FIG.
- nodes included in the road node sequence are sequentially scanned, and nodes satisfying all the following three conditions are thinned out from the road node sequence.
- the node is not the placement start node or placement end node of the road node sequence
- the previous node is not thinned out
- the distance from the previous node is less than or equal to CULLING_THRESHOLD
- the variable ir is initialized to 1 (step ST121).
- the variable ir is equal to or less than the number of road nodes.
- a loop is started (step ST122).
- the loop is started, first, it is checked whether or not the node P (ir) is an arrangement start node or an arrangement end node (step ST123). That is, in the road node sequence decimation unit 3, the node P (ir) in the road node sequence included in the character string arrangement data sent from the character string arrangement data acquisition unit 2 is an arrangement start node or an arrangement end node. Find out if.
- step ST123 If it is determined in step ST123 that the node P (ir) is an arrangement start node or an arrangement end node, the node P (ir) is thinned out because (1) of the above three conditions is not satisfied. Otherwise, the sequence proceeds to step ST127.
- step ST124 If it is determined in step ST123 that the node P (ir) is not an arrangement start node or an arrangement end node, it is then checked whether the node P (ir-1) has been thinned (step ST124). That is, the road node sequence thinning unit 3 checks whether or not the previous node P (ir-1) has been thinned. In this step ST124, if it is determined that the node P (ir-1) has been thinned out, (2) of the above three conditions is not satisfied, so the thinning out of the node P (ir) is not performed, and the sequence is It progresses to step ST127.
- step ST124 If it is determined in step ST124 that the node P (ir-1) has not been thinned out, then whether or not the distance between the node P (ir-1) and the node P (ir) is less than or equal to CULLING_THRESHOLD. It is examined (step ST125). That is, the road node sequence thinning unit 3 checks whether the distance between the previous node P (ir-1) and the current node P (ir) is equal to or less than CULLING_THRESHOLD (10 in this example).
- step ST125 If it is determined in step ST125 that the distance between the node P (ir-1) and the node P (ir) is not less than or equal to CULLING_THRESHOLD, the node P (ir) is not satisfied because (3) of the above three conditions is not satisfied. ) Is not thinned out, and the sequence proceeds to step ST127.
- step ST125 when it is determined in step ST125 that the distance between the node P (ir-1) and the node P (ir) is less than or equal to CULLING_THRESHOLD, it is recognized that all the above three conditions are satisfied.
- the node P (ir) is deleted (step ST126). That is, the road node sequence decimation unit 3 decimates the node (ir) in the road node sequence included in the character string arrangement data sent from the character string arrangement data acquisition unit 2. Thereafter, the sequence proceeds to step ST127. In step ST127, the variable ir is incremented. Thereafter, the process between step ST122 and step ST127 is repeated until the variable ir becomes larger than the number of road nodes.
- the nodes P (1) to P (5) are processed as follows. First, the possibility of thinning out the node P (1) is examined. Here, since the node P (1) is an arrangement start node of the road node row, it is not thinned out. Next, the possibility of thinning out of the node P (2) is examined. Here, the node P (2) is not the arrangement start node or the arrangement end node of the road node row, the previous node P (1) is not thinned, and the nodes P (1) and P (2) The distance between and is 5 and is 10 or less, which is CULLING_THRESHOLD. Accordingly, since all of the above three conditions are satisfied, the node P (2) is thinned out.
- node P (3) is not a road link arrangement start node or arrangement end node, but the previous node P (2) is thinned out, so the node P (3) is not thinned out.
- node P (4) and subsequent nodes are processed in the same manner.
- control point sequence creation unit 4 creates a control point sequence from the road node sequence after thinning.
- ic 1,..., The number of road nodes after thinning-2.
- step ST134 the variable ic is incremented, and thereafter, the process between step ST132 and step ST134, that is, the process of step ST133 is repeated until the variable ic becomes larger than “the number of road nodes after thinning ⁇ 2”.
- the set value of the control point A (ic) varies depending on the value of the variable ic as shown below.
- ic 1
- the node P ′ (1) is set at the control point A (ic)
- the variable ic is “the number of road nodes ⁇ 1”
- the node P ′ is set at the control point A (ic ⁇ 1).
- Ic is set.
- the midpoint of the control points B (ic) and B (ic ⁇ 1) is set to the control point A (ic).
- a straight line approximating the curve is then created as shown in the flowchart of FIG. 5 (step ST14). That is, the curve approximation unit 5 creates a straight line that approximates a curve from the control point sequence.
- a curve approximated node sequence details of a process of creating a straight line approximating a curve (hereinafter, a curve approximated node sequence) performed by the curve approximating unit 5 will be described with reference to a flowchart shown in FIG.
- variable ia is first initialized to 1 (step ST151).
- a loop is started (step ST153).
- the loop is started, it is checked whether or not the angle change between the link (A (ia), B (ia)) and the link (B (ia), A (ia + 1)) ⁇ STRAIGHT_THRESHOLD (step ST154). That is, the straight line determination unit 8 determines whether or not a quadratic Bezier curve (hereinafter simply referred to as “Bezier curve”) created by the control points A (ia), B (ia), and A (ia + 1) can be approximated by a straight line. Determine.
- Bezier curve quadratic Bezier curve
- the angle change between the link (A (ia), B (ia)) and the link (B (ia), A (ia + 1)) is less than STRAIGHT_THRESHOLD.
- the variable ia indicates the index of the control point sequence, and the angle change ⁇ between the link (A (ia), B (ia)) and the link (B (ia), A (ia + 1)) is as shown in FIG. , The absolute value of the difference between the direction of the link (A (ia), B (ia)) and the direction of the link (B (ia), A (ia + 1)).
- the directions of the links (A (ia), B (ia)) are declinations when the x-axis is 0 ° and the y-axis is 90 °.
- step ST154 If it is determined in step ST154 that the angle change between the link (A (ia), B (ia)) and the link (B (ia), A (ia + 1)) ⁇ STRAIGHT_THRESHOLD, a curve is obtained for one link. Is approximated (step ST155). That is, the singular line approximation unit 12 approximates a Bezier curve created by the control points A (ia), B (ia), and A (ia + 1) with links (A (ia), A (ia + 1)). In this example, a Bezier curve created by control points A (1), B (1) and A (2) is approximated by links (A (1), A (2)).
- step ST156 node registration is performed (step ST156). That is, the curve approximation node registration unit 7 saves, in the curve approximation node sequence storage unit 6, nodes other than the registered A (1) among the links sent from the single line approximation unit 12 as curve approximation nodes. To do. In this example, control point A (2) is stored. Thereafter, the sequence proceeds to step ST166.
- step ST154 If it is determined in step ST154 that the angle change between the link (A (ia), B (ia)) and the link (B (ia), A (ia + 1)) ⁇ STRAIGHT_THRESHOLD is not satisfied, the sequence proceeds to step ST157.
- the straight line determination unit 8 determines the angle between the link (A (2), B (2)) and the link (B (2), A (3)). It is checked whether the change is less than STRIGHT_THRESHOLD.
- the direction of the link (A (2), B (2)) is 0 ° and the direction of the link (B (2), A (3)) is 135 °.
- step ST154 it is determined that the angle change between (A (2), B (2)) and the link (B (2), A (3)) is equal to or greater than STRAIGHT_THRESHOLD. Therefore, NO is determined in step ST154, and the sequence proceeds to step ST157, in which processing for approximating the Bezier curve created at control points A (2), B (2) and A (3) with a plurality of straight lines is performed. .
- step ST157 a point MP (ia) that is an intermediate point on the curve is calculated. That is, the curve midpoint creation unit 9 calculates the point MP (ia) on the Bezier curve according to the following equation (2).
- step ST158 it is checked whether or not the distance between the point MP (ia) on the curve and the control point A (ia) ⁇ SEPARATE_THRESHOLD (step ST158). That is, the first half curve approximation unit 10 checks whether or not the distance Dist1 between the control point A (ia) obtained by the following equation (3) and the point MP (ia) on the curve is smaller than SEPARATE_THRESHOLD.
- step ST158 If it is determined in step ST158 that the distance between the point MP (ia) on the curve and the control point A (ia) is smaller than SEPARATE_THRESHOLD, the curve is approximated by one link (step ST159). . That is, the singular line approximation unit 12 approximates a Bezier curve between the control point A (ia) and the point MP (ia) on the curve with one link (A (ia), MP (ia)).
- step ST160 node registration is performed (step ST160). That is, the curve approximation node registration unit 7 stores the node approximated by one link sent from the single line approximation unit 12 in the curve approximation node sequence storage unit 6. Thereafter, the sequence proceeds to step ST162.
- step ST158 when it is determined in step ST158 that the distance between the point MP (ia) on the curve and the control point A (ia) is not ⁇ PARATE_THRESHOLD, that is, it is determined that the distance Dist1 is greater than or equal to SEPARATE_THRESHOLD. Then, the Bezier curve between the control point A (ia) and the point MP (ia) on the curve is approximated by the number of links indicated by SEPARATE_NUM (step ST161).
- step ST161 Details of the processing performed in step ST161 will be described with reference to the flowchart shown in FIG. In this process, first, the variable im is initialized to 1 (step ST171). Next, if the variable im is equal to or less than SEPARATE_NUM, a loop is started (step ST172). When the loop is started, first, a node on the curve is calculated (step ST173). That is, the first-half curve approximation unit 10 calculates a node on the curve between the point MP (ia) on the curve and the control point A (ia) according to the following equation (4).
- t (im) in the equation (4) is a value shown in the equation (5)
- BP (ia, im) is between the control point A (ia) and the point MP (ia) on the curve. This is the im-th node created on the Bezier curve.
- step ST174 node registration is performed (step ST174). That is, the curve approximation node registration unit 7 registers, in the curve approximation node sequence storage unit 6, nodes on the curve other than the nodes already registered among the nodes calculated by the first half curve approximation unit 10. Subsequently, the variable im is incremented, and thereafter, the process between step ST172 and step ST175 is repeated until the variable im becomes larger than SEPARATE_NUM. In this iterative process, when the variable im becomes larger than SEPARATE_NUM, the sequence proceeds to step ST162 shown in FIG.
- Dist1 is 11.18, which is less than or equal to SEPARATE_THRESHOLD. Therefore, the curve between the control point A (2) and the point MP (2) on the curve is approximated by the link (A (2), MP (2)). In this case, in node registration, the point MP (2) on the curve is saved.
- step ST162 it is checked whether or not the distance between the point MP (ia) on the curve and the control point A (ia + 1) is smaller than SEPARATE_THRESHOLD. That is, the second half curve approximation unit 11 checks whether the distance Dist2 between the point MP (ia) on the curve calculated according to the following equation (6) and the control point A (ia + 1) is smaller than SEPARATE_THRESHOLD.
- step ST162 If it is determined in step ST162 that the distance between the point MP (ia) on the curve and the control point A (ia + 1) is smaller than SEPARATE_THRESHOLD, the curve is approximated by one link (step ST163). . That is, the singular line approximation unit 12 approximates a Bezier curve between a point MP (ia) on the curve and a control point A (ia + 1) with one link (MP (ia), A (ia)).
- step ST164 node registration is performed (step ST164). That is, the curve approximation node registration unit 7 stores the node approximated by one link sent from the single line approximation unit 12 in the curve approximation node sequence storage unit 6. Thereafter, the sequence proceeds to step ST166.
- step ST162 determines whether the distance between the point MP (ia) on the curve and the control point A (ia + 1) ⁇ SEPARATE_THRESHOLD, that is, the distance Dist2 is greater than or equal to SEPARATE_THRESHOLD.
- a Bezier curve between MP (ia) and control point A (ia + 1) is approximated by the number of links indicated by SEPARATE_NUM (step ST165). Thereafter, the sequence proceeds to step ST166.
- step ST165 Details of the processing performed in step ST165 will be described with reference to the flowchart shown in FIG. In this process, first, the variable im is initialized to 1 (step ST171). Next, if the variable im is equal to or lower than SEPARATE_NUM, a loop is started (step ST172). When the loop is started, first, a node on the curve is calculated (step ST173). That is, the first half curve approximation unit 10 calculates a node on the curve between the point MP (ia) on the curve and the control point A (ia) according to the above equation (4).
- t (im) in the equation (4) is a value shown in the equation (7)
- BP (ia, im) at this time is a point MP (ia) on the curve and a control point A (ia + 1). Is the im-th node created on the Bezier curve.
- step ST174 node registration is performed (step ST174). That is, the curve approximation node registration unit 7 registers, in the curve approximation node sequence storage unit 6, nodes on the curve other than the already registered nodes among the nodes calculated by the second half curve approximation unit 11. Subsequently, the variable im is incremented, and thereafter, the process between step ST172 and step ST175 is repeated until the variable im becomes larger than SEPARATE_NUM. Thereafter, the sequence proceeds to step ST166.
- step ST166 the variable ia is incremented, and the process between step ST153 and step ST166 is repeated until the variable ia becomes larger than “the number of road nodes after thinning ⁇ 2”. In this way, curve approximation nodes obtained by linear approximation of the curve created from the control point sequence are sequentially stored in the curve approximation node sequence storage unit 6.
- the first half curve approximation unit 10 and the second half curve approximation unit 11 are the same processing except for the calculation method of t (im), and therefore between the MP (ia) and the control point A (ia) of the first half curve approximation unit 10. Is equal to or greater than SEPARATE_THRESHOLD and the distance between MP (ia) and the control point A (ia + 1) of the second-half curve approximation unit 11 is equal to or greater than SEPARATE_THRESHOLD.
- character string data is acquired (step ST15). That is, the character string arrangement data acquisition unit 2 reads the character string arrangement data from the character string arrangement data storage unit 1 and acquires a plurality of characters constituting one character string and the vertical width and horizontal width of each character. In this case, the characters “S”, “t”, “r”, “i”, “n”, “g” of the character string “String”, and the vertical and horizontal widths of each character in “String” are acquired. Is done.
- a curve approximate node sequence is acquired (step ST16). That is, the curve approximation node sequence acquisition unit 13 acquires a curve approximation node sequence from the curve approximation node sequence storage unit 6.
- step ST17 character strings are arranged. That is, the character string arrangement calculation unit 14 arranges a character string.
- the character string arrangement calculation unit 14 arranges a character string.
- a loop is started (step ST182).
- an infinite loop is further started in this loop (step ST183).
- the is-th character (hereinafter referred to as “character is”) is arranged (step ST185). That is, the character placement unit 18 determines the placement of the character is based on the link direction ⁇ ′ and the character spacing range.
- the details of the character arrangement process for determining the arrangement of the character is will be described with reference to the flowchart shown in FIG.
- the character arrangement position determining unit 24 arranges the character is at the node P ′′ (1) and ends the character arrangement process within the character link. More specifically, first, the lower left of the character is The coordinate LD (is) is set to the node P ′′ (1) (step ST201). That is, the character arrangement position determining unit 24 sets the lower left coordinate LD (is) of the character is to the node P ′′ (1).
- the character arrangement position determination unit 24 arranges the character is at the lower left coordinate LD (is) of the character is.
- the character arrangement means that the lower left coordinate LD (is) of the character is is set to the node P ′′ (1), and then the upper left coordinate LT (is), the lower right coordinate RD (is), and the upper right coordinate RT of the character is.
- (Is) refers to processing for setting the value obtained by the following equation (8), where W (is) and H (is) in equation (8) indicate the horizontal and vertical widths of the character is, respectively.
- step ST200 If it is determined in step ST200 that is not equal to 1, the lower left coordinate LD (is) at a position separated by the range from the lower left coordinate LD (is-1) of the character is-1 is calculated (step ST203). ).
- step ST204 it is checked whether the lower left coordinate LD (is) of the character is is within the link (step ST204). If it is determined in step ST204 that the lower left coordinate LD (is) of the character is is within the link, the character is is placed at the lower left coordinate LD (is) of the character is (step ST205). That is, the character arrangement position determination unit 24 arranges the character is at the lower left coordinate LD (is) of the character is, and ends the character arrangement process within the character link.
- step ST204 When it is determined in step ST204 that the lower left coordinate LD (is) of the character is is not within the link, the distance from the lower left coordinate LD (is) of the character is to the node P (ip + 1) is set as a range (step ST206). Thereafter, the character placement process is terminated outside the character link.
- step ST186 it is then checked whether or not the character is is outside the link as shown in FIG. 16 (step ST186). That is, the character link out-of-link determining unit 19 determines whether the arrangement result in the character arrangement position determining unit 24 is out of the character link. If it is determined in this step ST186 that the character is is in the link, an overlap with the character is-1 is determined (step ST187). That is, the duplication determination unit 20 determines whether or not the character is and the character is ⁇ 1 are overlapping.
- step ST186 range is set to the distance between the node P ′′ (ip + 1) and the lower left coordinate LD (is) (step ST193).
- the parameter update unit 21 sets the range to the distance between the node P ′′ (ip + 1) and the lower left coordinate LD (is). Thereafter, the sequence proceeds to step ST194 and exits the infinite loop. Thereafter, in step ST194, ip is incremented, and the process between step ST182 and step ST194 is repeated.
- the character placement unit 18 proceeds to the process of placing the character is. In this process, it is determined that is not 1 in step ST200.
- the lower left coordinate LD (is) of the character is is obtained by the lower left character calculation unit 25. That is, the character lower left coordinate calculation unit 25 obtains a position that is far from the lower left coordinate LD (is-1) of the character is-1 by the following equation (9), and sets it as the lower left coordinate LD (is) of the character is.
- the character arrangement position determination unit 24 performs the lower left coordinate in the same manner as described above.
- the upper left coordinate LT (2), the lower right coordinate RD (2), and the upper right coordinate RT (2) other than the coordinate LD (2) are calculated, and then the process is terminated within the character link.
- LT (2) (5, 20)
- RD (2) (10, 10)
- RT (2) (10, 20)
- step ST186 it is determined by the character link out-of-link determining unit 19 that the character is is in the link, and then in step ST187, the overlap determining unit 20 determines the overlap with the character is-1.
- the character arranging unit 18 arranges the character 2 as described above.
- the duplication judgment unit 20 judges the duplication of the character is and the character is-1.
- the parameter update unit 21 proceeds to the process of updating the parameter.
- a character string as shown in FIG. 20 is arranged.
- the character 6 is placed on the link (P ′′ (1), P ′′ (2)).
- the character lower left coordinate calculation unit 25 calculates the character lower left coordinate.
- the lower left coordinate LD (6) (34, 10).
- the distance 4 between the range of the range from the lower left coordinate LD (6) to the node P ′′ (2), ip is It is updated from 1 to 2, and the processing is terminated outside the character link, and then the processing is terminated outside the character link, so that the character is placed in the next link.
- the link (P ′′ (2), P "(3)) character 6 is arranged.
- the character string can be arranged so that the change in the character arrangement angle is smaller than that in the past.
- the change in the character angle can be reduced as compared with the conventional case, the character string can be easily recognized.
- the curve created from the road link is configured to approximate a plurality of straight lines, the distance calculation on the curve can be omitted when determining the position of the character, compared with the technique disclosed in Patent Document 1.
- the character position can be determined at high speed.
- any component of the embodiment can be modified or any component of the embodiment can be omitted within the scope of the invention.
- This invention improves the readability of character strings and can perform character positioning at high speed, and is therefore suitable for map display performed in a car navigation system or a portable device.
- 1 character string arrangement data storage unit 1 character string arrangement data storage unit, 2 character string arrangement data acquisition unit, 3 road node sequence thinning unit, 4 control point sequence creation unit, 5 curve approximation unit, 6 curve approximation node sequence storage unit, 7 curve approximation node registration unit, 8 straight line determination unit, 9 curve halfway point creation unit, 10 first half curve approximation unit, 11 second half curve approximation unit, 12 single straight line approximation unit, 13a character string arrangement processing unit, 13 curve approximation node sequence acquisition unit, 14 character string arrangement Calculation unit, 15 character string arrangement registration unit, 16 output character string arrangement storage unit, 17 link angle calculation unit, 18 character arrangement unit, 19 non-character link determination unit, 20 duplication determination unit, 21 parameter update unit, 22 character number determination unit , 23 initial character determination unit, 24 character arrangement position determination unit, 25 character lower left coordinate calculation unit, 26 next character arrangement distance update unit.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Business, Economics & Management (AREA)
- Mathematical Physics (AREA)
- Educational Technology (AREA)
- Image Generation (AREA)
- Controls And Circuits For Display Device (AREA)
- Navigation (AREA)
- Processing Or Creating Images (AREA)
- Instructional Devices (AREA)
Abstract
Description
実施の形態1.
図1は、この発明の実施の形態1に係る文字列配置装置の構成を示すブロック図である。この文字列配置装置は、文字列配置データ記憶部1、文字列配置データ取得部2、道路ノード列間引き部3、制御点列作成部4、曲線近似部5、曲線近似ノード列記憶部6および文字列配置処理部13aを備えており、さらに、文字列配置処理部13aは、曲線近似ノード列取得部13、文字列配置算出部14、文字列配置登録部15および出力文字列配置記憶部16を備えている。
(1)ノードが道路ノード列の配置開始ノードまたは配置終了ノードでない
(2)前のノードを間引きしていない
(3)前のノードとの距離がCULLING_THRESHOLD以下である
ここで、ic=1,…,間引き後の道路ノード数-2である。
ここで、(4)式中のt(im)は(5)式に示す値であり、BP(ia,im)は制御点A(ia)と曲線上の点MP(ia)との間のベジエ曲線上に作成されるim番目のノードである。
ここで、(4)式中のt(im)は(7)式に示す値であり、このときのBP(ia,im)は曲線上の点MP(ia)と制御点A(ia+1)との間のベジエ曲線上に作成されるim番目のノードである。
Claims (5)
- 文字列を道路に沿って配置するための文字列配置データを取得する文字列配置データ取得部と、
前記文字列配置データ取得部で取得された文字列配置データに含まれる道路ノード列を構成するノードの一部を間引きする道路ノード列間引き部と、
前記道路ノード列間引き部で間引きされた後の道路ノード列から制御点列を作成する制御点列作成部と、
前記制御点列作成部で作成された制御点列による曲線を直線で近似したノード列を作成する曲線近似部と、
前記曲線近似部で作成されたノード列を曲線近似ノード列として保存する曲線近似ノード列記憶部と、
前記曲線近似ノード列記憶部に保存された曲線近似ノード列に基づき文字列の配置処理を行う文字列配置処理部
とを備えた文字列配置装置。 - 曲線近似部は、
制御点列作成部で作成された制御点列による曲線を直線で近似できるか否かを判定する直線判定部と、
前記直線判定部において直線で近似できないことが判定された場合に、前記制御点列作成部で作成された制御点列による曲線上の中間点を作成する曲線上中間点作成部と、
前記制御点列作成部からの制御点列による曲線のうち、前記曲線上中間点作成部で作成された中間点より前の曲線を直線で近似して作成されたノード列を出力する前半曲線近似部と、
前記制御点列作成部からの制御点列による曲線のうち、前記曲線上中間点作成部で作成された中間点より後の曲線を直線で近似して作成されたノード列を、前記前半曲線近似部で直線を近似して作成されたノード列に繋げて出力する後半曲線近似部と、
前記直線判定部において直線で近似できることが判定された場合に、前記制御点列作成部で作成された制御点列による曲線を1本の直線で近似して作成されたノード列を出力する単数直線近似部と、
前記後半曲線近似部からのノード列、または、前記単数直線近似部からのノード列を曲線近似ノード列として曲線近似ノード列記憶部に登録する曲線近似ノード登録部
とを備えたことを特徴とする請求項1記載の文字列配置装置。 - 文字列配置処理部は、
曲線近似ノード列記憶部から文字列が沿うノード列を取得する曲線近似ノード列取得部と、
前記曲線近似ノード列取得部で取得された曲線近似ノード列に基づき文字列の配置位置を算出する文字列配置算出部と、
文字列の配置位置を保存する出力文字列配置記憶部と、
前記文字列配置算出部で算出された文字列の配置位置を前記出力文字列配置記憶部に登録する文字列配置登録部
とを備えたことを特徴とする請求項1記載の文字列配置装置。 - 文字列配置算出部は、
曲線近似ノード列取得部で取得された曲線近似ノード列に基づいて、各ノードにおいてリンクにより形成されるリンク角度を算出するリンク角度算出部と、
前記リンク角度算出部において算出されたリンク角度に基づき文字を配置する文字配置部と、
前記文字配置部で配置された文字がリンク外であるか否かを判定する文字リンク外判定部と、
前記文字リンク外判定部でリンク外でないことが判定された場合に文字同士が重複するか否かを判定する重複判定部と、
前記重複判定部での判定結果に応じてパラメータを更新するパラメータ更新部と、
前記パラメータ更新部で更新されたパラメータに基づき既定の文字数に達したか否かを判定し、既定の文字数に達したことが判定された場合に処理を終了させる文字数判定部
とを備えたことを特徴とする請求項3記載の文字列配置装置。 - 文字配置部は、
リンク角度算出部で算出されたリンク角度に基づき配置された文字が文字列中の1番目の文字であるか否かを判定する初期文字判定部と、
前記初期文字判定部における判定結果に応じて、文字の左下座標を算出する文字左下座標算出部と、
前記初期文字判定部による判定結果または文字左下座標算出部で算出された文字の左下座標に応じて文字の配置位置を決める文字配置位置決定部と、
前記文字左下座標算出部で算出された文字の左下座標に基づき次の文字までの距離を決める次文字配置距離更新部
とを備えたことを特徴とする請求項4記載の文字列配置装置。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2011/001477 WO2012123986A1 (ja) | 2011-03-14 | 2011-03-14 | 文字列配置装置 |
US14/000,292 US9317949B2 (en) | 2011-03-14 | 2011-03-14 | String arrangement device |
JP2013504397A JP5496415B2 (ja) | 2011-03-14 | 2011-03-14 | 文字列配置装置 |
CN201180069255.8A CN103430226B (zh) | 2011-03-14 | 2011-03-14 | 字符串配置装置 |
DE112011105035.6T DE112011105035T5 (de) | 2011-03-14 | 2011-03-14 | Folgenanordnungsvorrichtung |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2011/001477 WO2012123986A1 (ja) | 2011-03-14 | 2011-03-14 | 文字列配置装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012123986A1 true WO2012123986A1 (ja) | 2012-09-20 |
Family
ID=46830126
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2011/001477 WO2012123986A1 (ja) | 2011-03-14 | 2011-03-14 | 文字列配置装置 |
Country Status (5)
Country | Link |
---|---|
US (1) | US9317949B2 (ja) |
JP (1) | JP5496415B2 (ja) |
CN (1) | CN103430226B (ja) |
DE (1) | DE112011105035T5 (ja) |
WO (1) | WO2012123986A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2016118702A (ja) * | 2014-12-22 | 2016-06-30 | 株式会社ゼンリンデータコム | 情報処理装置、プログラム、描画方法 |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106844288B (zh) * | 2015-12-07 | 2022-03-22 | 创新先进技术有限公司 | 一种随机字符串生成方法及装置 |
WO2017188259A1 (ja) * | 2016-04-26 | 2017-11-02 | アイシン・エィ・ダブリュ株式会社 | 地図表示システムおよび地図表示プログラム |
US10726598B2 (en) * | 2016-05-19 | 2020-07-28 | Toyota Jidosha Kabushiki Kaisha | Map display system and map display program |
US10621889B2 (en) | 2016-05-20 | 2020-04-14 | Aisin Aw Co., Ltd. | Map display system and map display program |
CN109427238B (zh) * | 2017-09-04 | 2021-07-30 | 阿里巴巴(中国)有限公司 | 一种道路文字标注位置确定方法及装置 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH04326478A (ja) * | 1991-04-26 | 1992-11-16 | Toshiba Corp | 図形作成装置 |
JPH06259525A (ja) * | 1993-03-03 | 1994-09-16 | Hitachi Ltd | 文字配置方式 |
JPH08194432A (ja) * | 1995-01-17 | 1996-07-30 | Nippondenso Co Ltd | 地図表示装置 |
JP2000029450A (ja) * | 1998-07-09 | 2000-01-28 | Alpine Electronics Inc | 文字列表示方法 |
JP2002297025A (ja) * | 2001-03-29 | 2002-10-09 | Clarion Co Ltd | 地図表示装置及び方法並びに地図表示用ソフトウェア |
Family Cites Families (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4523294A (en) * | 1982-05-27 | 1985-06-11 | Southwest Research Institute | Character spaced justification method and apparatus |
US5109352A (en) * | 1988-08-09 | 1992-04-28 | Dell Robert B O | System for encoding a collection of ideographic characters |
US5241654A (en) * | 1988-12-28 | 1993-08-31 | Kabushiki Kaisha Toshiba | Apparatus for generating an arbitrary parameter curve represented as an n-th order Bezier curve |
US5408598A (en) * | 1991-05-23 | 1995-04-18 | International Business Machines Corporation | Method for fast generation of parametric curves employing a pre-calculated number of line segments in accordance with a determined error threshold |
US5590247A (en) * | 1993-08-31 | 1996-12-31 | Casio Computer Co., Ltd. | Character string outputting method and apparatus capable of varying sizes of characters |
US6278445B1 (en) * | 1995-08-31 | 2001-08-21 | Canon Kabushiki Kaisha | Coordinate input device and method having first and second sampling devices which sample input data at staggered intervals |
EP1783724A2 (en) * | 1996-06-19 | 2007-05-09 | Matsushita Electric Industrial Co., Ltd. | Road area extracting apparatus for extracting a road area from a block map, deformed map automatic generation system for generating a deformed map from road area data obtained by the road area extracting apparatus, map information providing system, geographical information providing system and geographical information describing method |
EP1103949A4 (en) * | 1999-04-20 | 2005-06-22 | Mitsubishi Electric Corp | DEVICE AND METHOD FOR DISPLAYING CHARACTERS |
JP3642514B2 (ja) * | 2001-09-13 | 2005-04-27 | 松下電器産業株式会社 | 簡易型交通情報の生成方法と装置 |
JP2005115174A (ja) * | 2003-10-09 | 2005-04-28 | Navitime Japan Co Ltd | 地図表示装置、地図表示方法および地図表示プログラム |
US20050089237A1 (en) * | 2003-10-24 | 2005-04-28 | Jaehwa Park | Method and apparatus for bezier curve approximation data compression |
WO2006006243A1 (ja) * | 2004-07-14 | 2006-01-19 | Pasco Corporation | 文字列最適配置プログラム |
JP2006330112A (ja) * | 2005-05-23 | 2006-12-07 | Pioneer Electronic Corp | 情報生成装置、その方法、そのプログラム、および、そのプログラムを記録した記録媒体 |
JP4086060B2 (ja) * | 2005-08-17 | 2008-05-14 | トヨタ自動車株式会社 | 点列の近似方法および点列の近似装置 |
ATE447160T1 (de) * | 2006-03-31 | 2009-11-15 | Research In Motion Ltd | Verfahren und vorrichtung zur dynamischen kennzeichnung von kartenobjekten in visuell angezeigten karten mobiler kommunikationsvorrichtungen |
JP2008076593A (ja) | 2006-09-20 | 2008-04-03 | Hirotsu Sokichi | 略地図生成装置および略地図生成方法 |
JP4306755B2 (ja) * | 2007-03-28 | 2009-08-05 | 株式会社デンソー | ストリート検索方法およびカーナビゲーション装置 |
JP2011081763A (ja) * | 2009-09-09 | 2011-04-21 | Sony Corp | 情報処理装置、情報処理方法及び情報処理プログラム |
-
2011
- 2011-03-14 JP JP2013504397A patent/JP5496415B2/ja not_active Expired - Fee Related
- 2011-03-14 WO PCT/JP2011/001477 patent/WO2012123986A1/ja active Application Filing
- 2011-03-14 CN CN201180069255.8A patent/CN103430226B/zh not_active Expired - Fee Related
- 2011-03-14 US US14/000,292 patent/US9317949B2/en not_active Expired - Fee Related
- 2011-03-14 DE DE112011105035.6T patent/DE112011105035T5/de not_active Ceased
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH04326478A (ja) * | 1991-04-26 | 1992-11-16 | Toshiba Corp | 図形作成装置 |
JPH06259525A (ja) * | 1993-03-03 | 1994-09-16 | Hitachi Ltd | 文字配置方式 |
JPH08194432A (ja) * | 1995-01-17 | 1996-07-30 | Nippondenso Co Ltd | 地図表示装置 |
JP2000029450A (ja) * | 1998-07-09 | 2000-01-28 | Alpine Electronics Inc | 文字列表示方法 |
JP2002297025A (ja) * | 2001-03-29 | 2002-10-09 | Clarion Co Ltd | 地図表示装置及び方法並びに地図表示用ソフトウェア |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2016118702A (ja) * | 2014-12-22 | 2016-06-30 | 株式会社ゼンリンデータコム | 情報処理装置、プログラム、描画方法 |
Also Published As
Publication number | Publication date |
---|---|
JP5496415B2 (ja) | 2014-05-21 |
JPWO2012123986A1 (ja) | 2014-07-17 |
US20130321429A1 (en) | 2013-12-05 |
CN103430226B (zh) | 2016-03-30 |
DE112011105035T5 (de) | 2014-01-02 |
CN103430226A (zh) | 2013-12-04 |
US9317949B2 (en) | 2016-04-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5496415B2 (ja) | 文字列配置装置 | |
JP5001617B2 (ja) | 地図更新データ供給装置、バージョンテーブル、地図データ更新システム、地図更新データ供給プログラム、及び地図データ更新プログラム | |
JP5216665B2 (ja) | 地図データ更新システム及び地図データ更新プログラム、並びにこれを利用したナビゲーション装置及び車両制御装置 | |
JP3275190B2 (ja) | 地図情報再生装置 | |
US20130166205A1 (en) | Navigation apparatus | |
JP4757752B2 (ja) | 地図情報処理装置 | |
KR102300713B1 (ko) | 고정밀 벡터지도 제공 방법 | |
JP2013036930A (ja) | ナビゲーション装置およびこれを備えたナビゲーションシステム | |
CN102538815A (zh) | 一种道路名称动态显示的方法及装置 | |
JP4580255B2 (ja) | 車両ナビゲーション装置および仮道路地図データの登録方法 | |
JP5335853B2 (ja) | 地図情報処理装置 | |
JP2018004560A (ja) | 情報処理装置、情報処理方法、情報処理システムおよびプログラム | |
JP4929255B2 (ja) | デフォルメ地図作成装置及びその方法 | |
JP5180715B2 (ja) | ナビゲーション装置 | |
JP2004139485A (ja) | 要約地図生成装置、道路地図変換装置、該プログラム、及び要約地図サービスシステム | |
CN114445575A (zh) | 一种基于路口拓扑信息的不同地图之间的匹配方法及*** | |
KR100967921B1 (ko) | 네비게이션의 3차원 링크 저장 방법 및 매칭 방법 | |
JP4786492B2 (ja) | 経路情報表示装置および経路情報表示方法 | |
CN111383446A (zh) | 电子地图道路信息的制作方法和设备 | |
JP3950230B2 (ja) | 現在位置算出装置 | |
CN111524203B (zh) | 基于gpx数据的面状矢量图生成方法及*** | |
JP2000329571A (ja) | ナビゲーション装置 | |
JP6107527B2 (ja) | 地図表示システム、方法およびプログラム | |
JPH06288780A (ja) | 車両位置検出装置 | |
CN113535747B (zh) | 地图更新方法、装置、电子设备及可读存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201180069255.8 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11861062 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2013504397 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14000292 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 112011105035 Country of ref document: DE Ref document number: 1120111050356 Country of ref document: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 11861062 Country of ref document: EP Kind code of ref document: A1 |