WO2011010340A1 - Dispositif pour dessiner des cartes - Google Patents

Dispositif pour dessiner des cartes Download PDF

Info

Publication number
WO2011010340A1
WO2011010340A1 PCT/JP2009/003401 JP2009003401W WO2011010340A1 WO 2011010340 A1 WO2011010340 A1 WO 2011010340A1 JP 2009003401 W JP2009003401 W JP 2009003401W WO 2011010340 A1 WO2011010340 A1 WO 2011010340A1
Authority
WO
WIPO (PCT)
Prior art keywords
map
map data
scale ratio
vertex
processing unit
Prior art date
Application number
PCT/JP2009/003401
Other languages
English (en)
Japanese (ja)
Inventor
笹山琴由
田中昭二
大津留誠
Original Assignee
三菱電機株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 三菱電機株式会社 filed Critical 三菱電機株式会社
Priority to PCT/JP2009/003401 priority Critical patent/WO2011010340A1/fr
Priority to JP2011523485A priority patent/JP5377646B2/ja
Publication of WO2011010340A1 publication Critical patent/WO2011010340A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3804—Creation or updating of map data
    • G01C21/3833—Creation or updating of map data characterised by the source of data
    • G01C21/3856—Data obtained from user input
    • 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 map drawing apparatus for drawing a map, and more particularly to a technique for creating map data having an intermediate scale ratio and using it for drawing based on a plurality of types of map data having different scale ratios.
  • a map drawing device used in a car navigation system or PND can display a map at an arbitrary scale according to the purpose of the user. For example, a wide-area map is used to confirm all routes to the destination, and a detailed map is used to confirm road conditions around the current location, such as traffic jam information.
  • a map drawing device in order to draw a map at a scale according to the user's purpose, a plurality of types of independent maps are drawn in the storage device inside the map drawing device in order to draw a map having different scales. Data is prepared in advance.
  • the map drawing device uses different map data for drawing according to the scale ratio requested by the user. However, since there is a limit to the storage capacity, it is practically impossible to store map data corresponding to each infinite scale.
  • map data with a scale ratio that is not prepared using map data with a scale ratio that is prepared For example, when map data with a scale ratio of 1 / 10,000 and 1 / 20,000 is prepared in advance, in a conventional map drawing apparatus, in order to draw a map with a scale ratio of 1 / 1,000, A map having an intermediate scale ratio is drawn by reducing a map having a scale ratio of 1 / 10,000 or by enlarging a map having a scale ratio of 1 / 20,000.
  • Patent Document 1 discloses a stepless scale map that can display a map with an intermediate scale ratio with appropriate map information with a small amount of data using map data with a plurality of scale ratios.
  • a display device is disclosed.
  • this stepless scale map display device in order to draw a map having an intermediate scale ratio, map data used for drawing is appropriately switched according to the amount of data on the screen.
  • it comprises a map data selection means for creating map data having an intermediate scale ratio and a setting means for setting a selection condition for determining the scale ratio of the map data, and is selected from the storage means based on the selection condition. Determine the scale ratio of the map data to be read.
  • the selection conditions are based on map information such as the number of characters drawn on the screen and the number of roads, and the map data having a larger scale ratio and the map data having a smaller scale ratio according to the amount of the map information.
  • the setting means has a selection condition for each of the map enlargement operation and the reduction operation, and has a selection condition for each range environment for each scale ratio range.
  • the conventional map drawing apparatus increases the processing load because it draws redundant map elements when a detailed map is reduced to draw a map with an intermediate scale ratio, and it is necessary to enlarge a wide area map. Unable to draw map elements. For example, in a detailed map, when a road composed of apex rows having different coordinates is reduced to draw a map with an intermediate scale ratio, the coordinates of a plurality of vertices may coincide. In this case, a straight line or a curve is drawn between the same coordinates, which is redundant. On the other hand, when a map with an intermediate scale ratio is drawn by enlarging a wide area map, the amount of data is less than the optimum data as a map with an intermediate scale ratio, and necessary data is insufficient.
  • the problem is that, for example, a 1 / 10,000 scale map is used at a scale ratio of 1 / 10,000 to 1 / 10,000, and a 1 / 20,000 scale scale ratio is used at a scale ratio of 1/2000 to 1/15000.
  • the map data to be used cannot be solved no matter how appropriately the scale ratio required, the user's operation status, and other rules are selected.
  • the present invention has been made to solve the above-described problems.
  • the problem is that discontinuous screen switching is not performed when the scale ratio is changed, and a map can be quickly displayed with data that is not excessive or insufficient.
  • a map drawing apparatus capable of drawing may be provided.
  • a map drawing apparatus includes an input value conversion unit that converts an input scale factor into a value used internally, a map data storage unit that stores a plurality of types of map data having different scale factors, and map data
  • the map data selection unit that selects the map data that creates a map with an intermediate scale ratio that is not stored in the storage unit from the map data that is stored in the map data storage unit, and the map data selection unit are selected.
  • a processing unit that generates map data having an intermediate scale ratio using the map data and values obtained by conversion by the input value conversion unit is provided.
  • discontinuous screen switching is not performed when the scale ratio is changed.
  • the amount of data can be adjusted, it is possible to quickly draw a map with data having no excess or deficiency.
  • FIG. 1 It is a block diagram which shows the structure of the map drawing apparatus which concerns on Embodiment 1 of this invention. It is a flowchart which shows operation
  • FIG. 1 is a block diagram showing a configuration of a map drawing apparatus according to Embodiment 1 of the present invention.
  • the map drawing apparatus includes an input value conversion unit 101, a map data storage unit 102, a map data selection unit 103, a processing unit 104, and a memory 105.
  • the input value conversion unit 101 converts information such as a scale factor input using an input device (not shown) into a value (for example, distance or curvature) used in the internal processing of the map drawing device.
  • the value obtained by the conversion in the input value conversion unit 101 is sent to the map data selection unit 103.
  • the map data storage unit 102 includes, for example, an external storage device that stores data such as maps and programs, such as ROM (Read Only Memory) or RAM (Random Access Memory).
  • the map data storage unit 102 has a plurality of types for drawing a map having a specific scale ratio, such as, for example, a 1 / 10,000 map, a 1/2000 map, a 1 / 40,000 map,. Stores map data.
  • the map data stored in the map data storage unit 102 is read by the map data selection unit 103.
  • the map data selection unit 103 selects map data necessary for creating a map having an intermediate scale ratio from a plurality of types of map data stored in the map data storage unit 102. For example, when a map having an intermediate scale ratio of 1 / 1,000,000 is newly created, a plurality of types of map data stored in the map data storage unit 102, that is, 1 / 10,000 / 10,000 Map data with a scale ratio close to a scale ratio of 1 / 3,000 from map data of 1 / 40,000,. And map data having a scale ratio smaller than 1 / 1,000,000 is selected one by one. In this example, map data having a scale ratio of 1/10000 and 1/2000 is selected. The map data selected by the map data selection unit 103 is sent to the processing unit 104 and the memory 105.
  • the processing unit 104 processes the map data sent from the map data selection unit 103 and creates map data having an intermediate scale ratio.
  • the map data created by the processing unit 104 is sent to the outside for drawing a map.
  • the memory 105 for example, is composed of a high-speed reading and writing are possible cache memory, together with the temporarily stores MAP data selected by the map data selection unit 103, is created in the processing unit 104 The original data when extracting map data having an intermediate scale ratio is stored. The contents of the memory 105 are read by the processing unit 104.
  • the scale ratio is input (step ST201). That is, the user inputs the scale of the map to be drawn.
  • the scale factor is input not only by the user of the map drawing apparatus but also by a drawing request from an internal process such as all route display.
  • step ST202 it is checked whether or not the scale is existing (step ST202). That is, the input value conversion unit 101 uses the existing scale ratio, that is, the scale data that is stored in the map data storage section 102, as the scale ratio input in step ST201 (hereinafter referred to as “required scale ratio”). Find out if it is a rate.
  • the map data is selected from a plurality of types of map data.
  • One is extracted (step ST203). That is, the map data selection unit 103 selects the map data having the requested scale ratio input in step ST201 from the map data storage unit 102, and sends it to the outside through the processing unit 104 as drawing data.
  • step ST202 If it is determined in step ST202 that the scale is not an existing scale, in other words, if it is determined that the map data of the required scale ratio does not exist in the map data storage unit 102, then the required scale ratio is set to each parameter. It is converted into a threshold value (step ST204). That is, the input value conversion unit 101 converts the requested scale ratio into a distance and curvature threshold value, and sends it to the map data selection unit 103.
  • step ST205 it is checked whether or not a hierarchical graph has been created. That is, the map data selection unit 103 checks whether a hierarchical graph already exists. A hierarchical graph is used to generate map data having an intermediate scale ratio. Details of this hierarchical graph will be described later.
  • step ST206 one or more map data to be extracted are selected (step ST206). That is, the map data selection unit 103 determines which scale data of the map data stored in the map data storage unit 102 is to be used for creating the hierarchical graph. Select more than one type of map data. For example, in step ST206, when the requested scale ratio is an intermediate scale ratio of 1 / 1,000,000, map data selection section 103 has map data at a scale ratio of 1 / 10,000 from map data storage section 102. The map data is flexibly selected in accordance with the scale ratio or the transition state inside the map drawing device, such as selecting map data with a scale ratio of 1/2000.
  • map data is extracted (step ST207). That is, the map data selection unit 103 extracts the map data selected in step ST206 from the map data storage unit 102 and sends it to the processing unit 104.
  • a hierarchical graph is created (step ST208). That is, the processing unit 104 creates a hierarchical graph based on the map data extracted in step ST207.
  • the hierarchical graph is stored (step ST209). That is, the processing unit 104 stores the created hierarchical graph data in the memory 105. Thereafter, the sequence proceeds to step ST210.
  • step ST210 a node to be drawn is selected from the hierarchical graph. That is, the processing unit 104 selects a vertex to be drawn from the hierarchical graph saved in step ST209 based on the threshold obtained in step ST204. This completes the process of creating map data for drawing a map with an intermediate scale ratio.
  • step ST205 When it is determined in step ST205 that the hierarchical graph has been created, the map data selection unit 103 determines that there is no need to correct or recreate the hierarchical graph because the hierarchical graph has already been saved. Since the hierarchical graph that has already been created can be reused, the processing of creating the hierarchical graph from step ST206 to step ST209 is skipped, and the sequence proceeds to step ST210.
  • map data having a scale ratio of 1 / 10,000 and 1 / 20,000 exists in the map data storage unit 102, and gradually zooms out from a map of 1/10000 to a scale ratio of 1 / 20,000.
  • the timing at which the processing unit 104 creates a hierarchical graph is as follows. When drawing map data having a scale ratio of 1 / 10,000, the scale ratio of 1/10000 is not an intermediate scale ratio, and therefore the processing unit 104 does not need to create a hierarchical graph.
  • the processing unit 104 needs to create a hierarchical graph. Thereafter, the processing unit 104 does not need to create a hierarchical graph until the scale ratio is continuously changed to reach a scale ratio of 1 / 20,000. That is, for example, in creating map data having an intermediate scale ratio such as 1 / 13,000, 1 / 15,000 or 1 / 1999,000, the processing unit 104 is set to 1,000,000 minutes. Drawing data can be created by reusing a hierarchical graph created when drawing map data having a scale ratio of 1. The same applies when zooming in. That is, the process part 104 can abbreviate
  • step ST204 the process of converting the required scale ratio into a threshold is a hierarchical graph in step ST210 immediately after it is determined in step ST202 that the required scale ratio does not exist in the map data storage unit 102. Can be performed at any timing until the process of selecting the vertex to be drawn is executed.
  • a hierarchical graph is not created. Even when drawing map data having a scale rate that matches the scale rate of the map data existing in the map data storage unit 102, a hierarchical graph is created, and drawing vertices are extracted from this hierarchical graph. You can also.
  • FIG. 3 is a diagram for explaining the processing from step ST208 to step ST210.
  • FIG. 3 shows a state in which a hierarchical graph is created using a virtually created intermediate map, and map data having an intermediate scale ratio is created.
  • 3A is a diagram for explaining the processing in step ST208
  • FIG. 3B is a diagram for explaining the processing in step ST209
  • FIG. 3C is a diagram for explaining the processing in step ST210.
  • the processing unit 104 is intermediate between the 1 / 20,000 wide area map selected by the map data selecting unit 103 and the 1/1000 detailed map. Define a map virtually. The number of intermediate maps to be defined can be determined as necessary. In other words, the processing unit 104 can define a plurality of intermediate maps as necessary, and does not have to define one if not necessary.
  • FIG. 3A shows an example in which the processing unit 104 defines one intermediate map. Further, the map data of the intermediate map can be created by extracting from the vertices that are the feature points of the map including the intersections and the points whose coordinates coincide with the wide area map.
  • the processing unit 104 creates a hierarchical graph based on three types of maps such as a wide area map, an intermediate map, and a detailed map.
  • This hierarchical graph shows that a lower vertex cannot be reached unless a higher vertex is traced. However, this is not the case when the vertex of the intermediate map does not exist after tracing the edge from one vertex to another vertex.
  • the processing unit 104 creates a hierarchical graph from two levels of maps, a wide area map and a detailed map. Further, before performing the process of FIG. 3C, the processing unit 104 specifically weights each edge in either FIG. 3A or FIG. 3B. .
  • the processing unit 104 scans the hierarchical graph and extracts drawing vertices. That is, the processing unit 104 compares the threshold uniquely determined by the scale ratio with the weight for each edge, and sequentially traces edges having a value equal to or greater than the threshold. Then, the processing unit 104 repeats this processing from the start point to the end point of the edge, and extracts the traced vertex of the edge as a drawing vertex.
  • the amount of map data having an intermediate scale ratio of 1 / 1,000,000 created using this map drawing apparatus is created by reducing a map having a scale ratio of 1/10000. Although it is smaller than the data amount of the map having a scale ratio of 1 / 50,000, it is larger than the data amount of the map created by enlarging the scale ratio of 1 / 20,000. As described above, the map drawing apparatus can adjust the data amount according to the scale ratio.
  • step ST208 and step ST210 details of the processes executed in step ST208 and step ST210 will be described using specific examples with reference to FIGS.
  • FIG. 4 is a flowchart showing a flow of processing for calculating the edge value of each link, which is executed in step ST208 of the flowchart shown in FIG.
  • a wide area map and a detailed map are input (step ST401). That is, the processing unit 104 inputs the wide area map and the detailed map selected by the map data selection unit 103.
  • an intermediate map is created (step ST402). That is, the processing unit 104 virtually creates an intermediate map based on the map input in step ST401.
  • the values of each edge of the wide area map, detailed map, and intermediate map are calculated (step ST403). That is, the processing unit 104 calculates the value of each edge of the three maps such as the wide area map, the intermediate map, and the detailed map.
  • FIG. 5 is a diagram showing values of each edge of the wide area map, intermediate map, and detailed map calculated by the processing unit 104 in step ST403 of the flowchart shown in FIG.
  • the distance between vertices is used as the edge value.
  • the distance between the vertices is as follows: A-B: 2, B-C: 3, C-D: 3, D-E: 2, EF: 2, FG: 1, G Between -H: 5, Between HI: 6, Between I-J: 5, Between J-K: 3, Between KL: 2, Between A-C: 4, Between CE: 4, G- Between I: 9, Between IJ: 5, Between JL: 4, Between AE: 7, Between EG: 3, Between IL: 8
  • FIG. 6 is a flowchart showing the flow of processing (see FIG. 3A) in which the processing processing unit 104 adds a hierarchy to each vertex of the detailed map in step ST208 of the flowchart shown in FIG.
  • the processing unit 104 compares the coordinates of the vertices of the wide area map, the intermediate map, and the detailed map to check whether or not the vertex coordinates are coordinates that exist only in the detailed map.
  • step ST602 If it is determined in step ST602 that the vertex exists only in the detailed map, that is, the vertex coordinate is a coordinate that exists only in the detailed map, the hierarchy is determined to be low (step ST603). That is, the processing unit 104 sets the level of the vertex to “low”. On the other hand, if it is determined in step ST602 that the vertex does not exist only in the detailed map, that is, a vertex having the same coordinates as the vertex coordinates exists in addition to the detailed map, It is checked whether or not there is (step ST604). That is, the processing unit 104 compares the vertex coordinates of the wide area map and the intermediate map, and checks whether the vertex coordinates exist only in the intermediate map.
  • step ST604 If it is determined in this step ST604 that the vertex coordinates exist only in the intermediate map, the hierarchy is set in (step ST605). That is, the processing unit 104 sets the level of the vertex of the corresponding detailed map to “medium”. On the other hand, if it is determined in step ST604 that the vertex coordinates are not present only in the intermediate map, that is, the vertex coordinates are also present in the wide area map, the hierarchy is set high (step ST606). That is, the processing unit 104 sets the level of the vertex of the corresponding detailed map to “high”.
  • step ST607 it is checked whether or not the loop for the number of vertices has been completed. If not, the sequence returns to step ST602 and the above-described processing is repeated. If it is determined in step ST607 that the number of vertices has ended, the process ends. Thereby, a weight of “high”, “medium” or “low” is given to all the vertices.
  • FIG. 3B details of a process in which the processing unit 104 creates a hierarchical graph as shown in FIG. 3B will be described.
  • ABCBCDEFFGHHIJJKL is referred to as the original vertex sequence.
  • a hierarchical graph is created based on the vertices that make up the detailed map.
  • a hierarchical graph is created by connecting a plurality of vertices with edges.
  • vertices to be connected are vertices existing behind themselves in the detailed map vertex arrangement.
  • the process of connecting a plurality of vertices with edges will be described with reference to the flowcharts shown in FIGS. How to connect edges varies depending on the own hierarchy. In the following, the case where the own hierarchy is “high”, “medium”, and “low” will be described separately.
  • FIG. 7 is a flowchart showing a process of creating a hierarchical graph when the own hierarchy is “high”.
  • this process when a loop until reaching the end point is started (step ST701), first, an adjacent vertex and edge are connected (step ST702). That is, the processing unit 104 adds an edge toward the vertex existing next to the original vertex of the detailed map.
  • step ST703 it is checked whether the level of the adjacent vertex is high. That is, the processing unit 104 checks whether or not the hierarchy of the vertex next to the back allocated by the process shown in the flowchart of FIG. 6 is “high”. If it is determined in this step ST703 that the vertex hierarchy is not “high”, it is checked whether or not the number of vertices has ended (step S704). If not, the sequence goes to step ST702. Returning, the process described above is repeated. If it is determined in step ST704 that the number of vertices has ended, the process ends.
  • step ST703 if it is determined in step ST703 that the layer of the adjacent vertex is “high”, the process ends.
  • the search is repeated while shifting the target vertex to be examined backward until the next adjacent vertex becomes “high”, and it is determined that the next vertex is “high”. , One edge to the vertex is added, and the process ends.
  • FIG. 8 is a flowchart showing a process of creating a hierarchy graph when the own hierarchy is “medium”.
  • the adjacent hierarchy is examined (step ST802). That is, the processing unit 104 checks whether the hierarchy of the vertices existing next to the original vertex list of the detailed map is “high”, “medium”, or “low”.
  • step ST803 if it is determined that the hierarchy of vertices existing next to the back is “high”, the adjacent vertices are connected by an edge (step ST803). That is, the processing unit 104 adds an edge toward the vertex existing next to the original vertex of the detailed map. Thereafter, the process ends.
  • step ST804 If it is determined in step ST802 that the hierarchy of vertices existing next to the back is “medium”, it is then checked whether or not there is an edge toward the vertex in the hierarchy (step ST804). If it is determined in step ST804 that there is no edge toward the top vertex in the hierarchy, the next vertex is connected by an edge (step ST805). That is, the processing unit 104 adds an edge toward the vertex existing next to the original vertex of the detailed map. Thereafter, the sequence proceeds to step ST808. If it is determined in step ST804 that there is an edge toward the top of the hierarchy, the sequence proceeds to step ST808.
  • step ST802 If it is determined in step ST802 that the hierarchy of vertices existing next to the back is “low”, it is then checked whether or not there is an edge connected to the vertex in the hierarchy (step ST806). If it is determined in step ST806 that there is no edge toward the top vertex in the hierarchy, the next vertex is connected with the edge (step ST807). That is, the processing unit 104 adds an edge toward the vertex existing next to the original vertex of the detailed map. Thereafter, the sequence proceeds to step ST808. If it is determined in step ST804 that there is an edge toward the top of the hierarchy, the sequence proceeds to step ST808.
  • step ST808 it is checked whether or not the loop for the number of vertices has been completed. If not, the sequence returns to step ST802 and the above-described processing is repeated. In other words, the search is repeated by shifting the target vertex to be examined backward until the next adjacent vertex becomes “high”. If it is determined in step ST808 that the number of vertices has ended, the process ends.
  • FIG. 9 is a flowchart showing a process of creating a hierarchy graph when the own hierarchy is “low”.
  • step ST901 when a loop until the end point is started (step ST901), it is first checked whether or not the immediately adjacent hierarchy is low (step ST902).
  • the processing unit 104 checks whether or not the level of the vertex that is directly adjacent to the original vertex list of the detailed map is “low”. If it is determined in step ST902 that the immediately adjacent hierarchy is not low, the sequence proceeds to step ST904.
  • step ST902 if it is determined in step ST902 that the immediately adjacent hierarchy is low, it is then checked whether or not there is an edge toward a vertex whose hierarchy is low (step ST903). If it is determined in step ST903 that there is no edge toward a vertex having a lower hierarchy, the next vertex is connected to the edge (step ST904). In other words, the processing unit 104 adds an edge toward the vertex that is directly adjacent to the original vertex of the detailed map. Thereafter, the sequence proceeds to step ST909. Even when it is determined in step ST903 that there is an edge toward a vertex having a lower hierarchy, the sequence proceeds to step ST909.
  • step ST905 it is checked whether the adjacent layer is middle or high.
  • the processing unit 104 checks whether or not the hierarchy of the vertices existing next to the original vertex list of the detailed map is “medium” or “high”. If it is determined in step ST905 that the adjacent hierarchy is not middle or high, the sequence proceeds to step ST909.
  • step ST905 if it is determined in step ST905 that the adjacent hierarchy is middle or high, it is then checked whether or not there is an edge toward the vertex where the hierarchy is inside (step ST906). If it is determined in step ST906 that there is an edge toward the top vertex in the hierarchy, the process ends. On the other hand, if it is determined in step ST906 that there is no edge toward a vertex whose hierarchy is in the middle, it is then checked whether there is an edge toward a vertex whose hierarchy is high (step ST907). If it is determined in step ST907 that there is an edge toward the top of the hierarchy, the process ends.
  • step ST907 if it is determined in step ST907 that there is no edge toward a vertex having a higher hierarchy, the next vertex is connected to the edge (step ST908). That is, the processing unit 104 adds an edge toward the vertex existing next to the original vertex of the detailed map. Thereafter, the sequence proceeds to step ST909.
  • step ST909 it is checked whether or not the number of vertices has ended. If not, the sequence returns to step ST902 and step ST905, and the above-described processing is repeated. If it is determined in step ST909 that the number of vertices has been completed, the process ends.
  • an edge to a vertex having a “low” level is added only when the level immediately behind the self is “low”.
  • the loop between step ST902 and step ST905 and step ST909 is repeated until the edge toward the vertex whose hierarchy is "medium” or "high” is added, and the edge toward the vertex having a hierarchy higher than its own hierarchy When one is added, the process ends.
  • FIG. 10 is a diagram illustrating a hierarchical graph created by the processing unit 104.
  • the processing unit 104 assigns the edge values shown in FIG. 5 to each edge, and stores them in the memory 105 as data representing a hierarchical graph.
  • FIG. 11 is a flowchart showing the flow of processing for extracting vertices to be drawn by scanning the hierarchical graph created by the processing processing unit 104 as shown in FIG.
  • the input value conversion unit 101 Before executing the processing shown in the flowchart of FIG. 11, in step ST204 of the flowchart shown in FIG. 2, the input value conversion unit 101 must determine the threshold value using an evaluation function using the required scale factor as a parameter. I must.
  • step ST1101 it is checked whether or not there is an edge connected to a lower hierarchy.
  • the processing unit 104 checks whether there is an edge from the vertex toward the vertex having the “low” hierarchy. If it is determined in step ST1101 that there is no edge connected to the lower hierarchy, that is, there is no edge from the vertex toward the vertex having the “low” hierarchy, the sequence proceeds to step ST1104.
  • step ST1101 if it is determined in step ST1101 that there is an edge connected to the lower layer, that is, an edge from the vertex toward the vertex having the “low” layer, the value of the edge is equal to or greater than the threshold value. Whether or not (step ST1102). That is, the processing unit 104 checks whether the edge value is equal to or greater than a threshold value. If it is determined in step ST1102 that the edge value is not greater than or equal to the threshold value, the sequence proceeds to step ST1104. On the other hand, if it is determined in step ST1102 that the edge value is equal to or greater than the threshold value, a vertex connected to an edge having a lower hierarchy is selected as a drawing vertex (step ST1103). That is, the processing unit 104 selects a vertex connected to an edge that is equal to or greater than the threshold value as a drawing vertex. Thereafter, the process ends.
  • step ST1104 it is checked whether there is an edge connected to the middle layer.
  • the processing unit 104 checks whether there is an edge from the vertex toward the vertex having the “middle” hierarchy. If it is determined in step ST1104 that there is no edge connected to the middle layer, that is, there is no edge from the vertex toward the vertex having the “middle” layer, the sequence proceeds to step ST1107.
  • step ST1104 determines whether there is an edge connected to the middle layer, that is, there is an edge from the vertex to the vertex having the “middle” layer. If it is determined in step ST1105). That is, the processing unit 104 checks whether the edge value is equal to or greater than a threshold value. If it is determined in step ST1105 that the edge value is not greater than or equal to the threshold value, the sequence proceeds to step ST1107. On the other hand, if it is determined in step ST1105 that the edge value is equal to or greater than the threshold value, the vertex connected to the edge in the hierarchy is selected as the drawing vertex (step ST1106). That is, the processing unit 104 selects a vertex connected to an edge that is equal to or greater than the threshold value as a drawing vertex. Thereafter, the process ends.
  • step ST1107 a vertex connected to an edge having a higher hierarchy is selected as a drawing vertex. That is, the processing unit 104 selects a vertex having a “high” hierarchy as a drawing vertex.
  • the process part 104 repeats the process of step ST1101 to step ST1107 until it reaches the end point L from the starting point A.
  • FIG. 12 is a diagram illustrating an example of map data having an intermediate scale ratio created by the processing unit 104.
  • the value obtained by converting the required scale factor into the parameter threshold is “4”.
  • 12A is a drawing vertex row on the hierarchical graph
  • FIG. 12B is a diagram showing a map having an intermediate scale ratio drawn using the extracted drawing vertices.
  • the processing unit 104 extracts the drawing vertices by comparing the value of the edge with the threshold value, and extracts only the vertices connected to the edge of the threshold “4” or more as the drawing vertices.
  • the distance is used as a parameter for the threshold used for scanning the hierarchical graph.
  • the processing unit 104 includes curvature, density, position information, and one link. Information that may be important for vertex weighting, such as the number of existing points, can also be used. Vertex density is particularly useful when investigating the distance between vertices of separate links.
  • the map data selection unit 103 is stored in the map data storage unit 102 when selecting map data in step ST206 of the flowchart shown in FIG. From the map data, two map data of the scale scale closest to the desired scale ratio were selected, one each from the wide area map and the detailed map. However, in this step ST206, the map data selection unit 103 may select one or more map data stored in the map data storage unit 102, and the number thereof is arbitrary. When creating a hierarchical graph using only one type of map data, the processing unit 104 also virtually generates a wide area map shown in FIG.
  • the map data selection unit 103 does not limit the scale rate of the map data to be selected to the two scale factors before and after, but uses map data at other scale rates. You can also.
  • the scale ratio of the map data stored in the map data storage unit 102 is 1 / 10,000, 1 / 20,000, 40,000, 1 / 80,000 and 1 / 160,000
  • the map data used to create the virtual map data with an intermediate scale ratio of 1 / 50,000 is the map data with the scale ratio of the wide area map and the closest scale ratio of 1 / 20,000, It is not limited to the map data which has the scale ratio of a detailed map with the scale ratio of the nearest 1 / 10,000.
  • the map data selection unit 103 has map data having a scale ratio of 1 / 40,000 and a scale ratio of 1 / 160,000 when creating map data of 1 / 1,000,000. Map data can also be selected. That is, in step ST206, the map data selection unit 103 selects the map data so as to satisfy the condition of selecting one or more types of independent map data from the map data stored in the map data storage unit 102. select. However, for map drawing having an intermediate scale ratio when a similar transition occurs in the map drawing apparatus, map data of the same scale ratio is selected, and the map data to be drawn is the same. For example, when the user requests to draw a map having a scale ratio of 1 / 10,000 to 1 / 160,000, the map drawing apparatus according to Embodiment 1 Draw a map with the same intermediate scale factor, regardless of the operation.
  • a process when a user requests a rapid scale change to draw a scale ratio of 1 / 160,000 is described below.
  • the map having a scale ratio of 1 / 1,000,000 drawn by the map drawing device in each case may be a different map.
  • the map drawing device changes the scale ratio in order, such as 1/1000, 1 / 10,000, 1 / 20,000, 1 / 5,000, and so on, even when the scale is suddenly changed.
  • the map drawing device When drawing map data having an intermediate scale ratio of 1 / 15,000 and 1 / 25,000, the map drawing device, for example, 1 / 10,000, 1 / 20,000, 1 / 20,000, It is better to create a hierarchical graph using map data with a scale ratio of 1 / 10,000 and 1 / 160,000 than to create a hierarchical graph created with map data having a scale ratio of 1 / 10,000.
  • the time required to create a map with an intermediate scale can be reduced.
  • the map drawing apparatus can shorten the response time up to the scale ratio desired by the user by reducing the number of hierarchical graph creations.
  • the map data selection unit 103 can also select map data other than the two types of scales before and after the hierarchical graph. In some cases, the map data selection unit 103 can use map data of several stages wide or several stages in detail. According to this method, the number of hierarchical graphs created by the processing unit 104 is reduced, so that high-speed drawing is possible and it is possible to respond quickly to user requests.
  • the map drawing apparatus generates map data having an intermediate scale ratio, thereby intermittently outputting the map data selected by the map data selection unit 103. Since the scale ratios can be complemented, sudden screen switching when gradually changing the scale ratios can be prevented, and unnaturalness can be eliminated.
  • the map drawing apparatus can adjust the amount of data according to the scale ratio, the time required for drawing can be suppressed within a certain time at any scale ratio. That is, the drawing processing load can be reduced.
  • the map drawing apparatus can omit the time required to create a hierarchy graph by reusing the once created hierarchy graph within a range of a certain scale ratio. Since the time required can be shortened, information can be quickly supplied to the user.
  • the map drawing device can draw a map with an optimal data amount corresponding to a desired scale ratio, compared with a case where an intermediate map is drawn by reducing a detailed map, The amount of data to be drawn is reduced, and the drawing time can be shortened.
  • the map drawing apparatus extracts drawing vertices in consideration of the wide-area feature points of the map and the feature points when viewed locally, the drawing is performed while maintaining the map shape. The number of vertices can be reduced.
  • the present invention can be used in a navigation system that displays a map at a high speed at a scale desired by a user.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Mathematical Physics (AREA)
  • Business, Economics & Management (AREA)
  • Educational Administration (AREA)
  • Educational Technology (AREA)
  • Instructional Devices (AREA)
  • Processing Or Creating Images (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

Un dispositif pour dessiner des cartes comprend un convertisseur de valeur d'entrée (101), qui convertit une échelle qui a été entrée en une valeur utilisée en interne, une unité de stockage de données de carte (102), qui stocke de nombreux types de données de carte ayant des échelles différentes, un sélecteur de données de carte (103), qui sélectionne des données de carte parmi les données de carte stockées dans l'unité de stockage de données de carte afin de créer une carte avec une échelle intermédiaire qui n'est pas stockée dans l'unité de stockage de données de carte, et un processeur de travail (104) qui utilise les données de carte sélectionnées par le sélecteur de données de carte et la valeur, obtenue par conversion par le convertisseur de valeur d'entrée, pour produire des données de carte ayant une échelle intermédiaire.
PCT/JP2009/003401 2009-07-21 2009-07-21 Dispositif pour dessiner des cartes WO2011010340A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/JP2009/003401 WO2011010340A1 (fr) 2009-07-21 2009-07-21 Dispositif pour dessiner des cartes
JP2011523485A JP5377646B2 (ja) 2009-07-21 2009-07-21 地図描画装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2009/003401 WO2011010340A1 (fr) 2009-07-21 2009-07-21 Dispositif pour dessiner des cartes

Publications (1)

Publication Number Publication Date
WO2011010340A1 true WO2011010340A1 (fr) 2011-01-27

Family

ID=43498831

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2009/003401 WO2011010340A1 (fr) 2009-07-21 2009-07-21 Dispositif pour dessiner des cartes

Country Status (2)

Country Link
JP (1) JP5377646B2 (fr)
WO (1) WO2011010340A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10122887A (ja) * 1996-10-22 1998-05-15 Zanavy Informatics:Kk ナビゲーション装置
JPH10187033A (ja) * 1996-10-22 1998-07-14 Zanavy Informatics:Kk 地図データベース装置
JP2000029383A (ja) * 1998-07-08 2000-01-28 Sumitomo Electric Ind Ltd 図形表示方法、図形表示装置及び記録媒体

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10122887A (ja) * 1996-10-22 1998-05-15 Zanavy Informatics:Kk ナビゲーション装置
JPH10187033A (ja) * 1996-10-22 1998-07-14 Zanavy Informatics:Kk 地図データベース装置
JP2000029383A (ja) * 1998-07-08 2000-01-28 Sumitomo Electric Ind Ltd 図形表示方法、図形表示装置及び記録媒体

Also Published As

Publication number Publication date
JPWO2011010340A1 (ja) 2012-12-27
JP5377646B2 (ja) 2013-12-25

Similar Documents

Publication Publication Date Title
JP5919950B2 (ja) 経路探索方法、経路探索装置、及びプログラム
EP1122626B1 (fr) Méthode de visualisation d'une intersection, unité de visualisation d'une carte et support d'enregistrement pour réaliser la méthode
JP4613075B2 (ja) 地図処理装置、ナビゲーション装置及び地図表示方法
JP4715353B2 (ja) 画像処理装置、描画方法および描画プログラム
KR101901958B1 (ko) 휴리스틱 함수의 학습을 이용한 고속 경로를 탐색을 위한 장치 및 그 방법
JP5028790B2 (ja) 情報処理装置、情報処理方法、およびプログラム
KR20130040773A (ko) 3차원 지도 묘화 시스템
CN1609913A (zh) 在三维地图中显示多级文本数据的方法
US20090204892A1 (en) Positioning map views to show more optimal route information
JP6037758B2 (ja) 案内地図作成装置、案内地図作成方法および案内地図作成プログラム
JP5377646B2 (ja) 地図描画装置
CN105373538B (zh) 一种多边形对象的显示层级确定方法及装置
US8456474B2 (en) Method for rendering outline of polygon and apparatus of rendering outline of polygon
JP5556526B2 (ja) 地図表示装置、地図表示方法およびプログラム
WO2004099719A1 (fr) Procede et systeme permettant de fournir des informations cartographiques a un dispositif mobile
JP5242038B2 (ja) 地図データ生成方法及び地図表示装置
US9208593B1 (en) Proximity-based detail reduction of geographic data
JP5312967B2 (ja) 地図表示装置、地図表示システム及び地図表示方法
JP5290138B2 (ja) メッシュ変更装置、メッシュ変更方法、およびプログラム
JP5777736B2 (ja) 地図データ作成装置、地図データ作成方法および記憶媒体
JP2007101767A (ja) 要約地図生成装置
JP5583178B2 (ja) 重要領域決定装置及び方法及びプログラム
Lehto et al. OGC API Features HTML-output as a Feature Dashboard
KR20230095770A (ko) 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법
JP2009015165A (ja) 地点設定装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09847527

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2011523485

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09847527

Country of ref document: EP

Kind code of ref document: A1