CN1480867A - Method for preparing electronic maps and display method - Google Patents
Method for preparing electronic maps and display method Download PDFInfo
- Publication number
- CN1480867A CN1480867A CNA021308853A CN02130885A CN1480867A CN 1480867 A CN1480867 A CN 1480867A CN A021308853 A CNA021308853 A CN A021308853A CN 02130885 A CN02130885 A CN 02130885A CN 1480867 A CN1480867 A CN 1480867A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- circuit
- user
- additional information
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Images
Abstract
The invention sets up parameters for determining regions: subzone, node, link, additional information, virtual node, floating link and appending field information as well as modifies incorrect displayed location caused by simplification of electric map. Shortest tree between starting point and end point is calculated out under constraint condition and weighted directed graph in condition of considering or not considering traffic status. Thus, the invention calculates out shortest distance route and shortest time route, providing method of forecasting and leading traffic flow as well as recording routes of vehicles for traffic control Dept. the said shortest distance route and shortest time route can be output in graphic or text format for guidance or relevant information can be broadcasted out for people to use.
Description
Technical field
The present invention relates to the method for making and the display packing of a kind of electronic chart, particularly a kind of electronic chart.
Background technology
At present, known electronic chart is based on generalized information system, its data processing model is to be based upon on the magnanimity stages of digital geographical background figure, form special-purpose arrangenent diagram through each professional icon of stack, utilize built-in or plug-in relevant database then, reference record under the query statistic graphical symbol is for use in the use of relevant industries such as planning, municipal administration, native pipe, electric power, telecommunication, tap water, traffic.The electronic chart of Zhi Zuoing by this way, what store is the huge figures of a series of data volumes, utilize the computer platform of specialty that built-in or plug-in relevant database is connected with it, but the relation in relation between each map and the same map between the different information can not directly reflect, and is difficult to inquiry information needed rapidly.Simultaneously, in this way the electronic chart of Zhi Zuoing though pay attention to the accuracy in geographic position, must be paid the huge cost of memory space simultaneously, application units also need to bear the expensive expense of relevant database platform except needs are born the expensive expense of GIS speciality platform.Based on the terminal of such system, cost is difficult to descend.
(application number: propose 02124155.4): the user of professional electronic chart is not interested in all geography information of its survey region to applicant in the application of another patent of invention, and only be concerned about partial information, therefore do not need all geography information are all accurately described, and only need accurately to describe customizing messages.According to this thinking, application for a patent for invention 02124155.4 has proposed a kind of method for making of electronic chart, the method for making of this electronic chart is divided into following steps, the layer-management information → setting of parameter → establishment, setting and the storing electronic map of node, link and the additional information of the electronic chart layering → setting electronic chart of the information classification that constitutes electronic chart → needs are made is organized into the parameter → demonstration electronic chart of critical facility, unit information and advertising message in the electronic chart.
From a high precision, detailed written map or GIS map, the information that at first will constitute electronic chart is divided into two classes, i.e. frame information and additional information.Frame information is a road information, and it constitutes the profile of electronic chart, and frame information is made of node and link.Additional information comprises geography information and advertising message, and it describes the details of electronic chart, and additional information is made up of place name, coordinate, absolute name, classification and ad content.
To the electronic chart layering that needs are made, the frame information of low layer can constitute high-rise additional information.When the user does when observing on a large scale electronic chart, only show high-rise frame information and additional information, when the user does details and observes electronic chart, just show the frame information of low layer.
Information on map is classified into node, link and additional information, and by behind the territory of regular layering, subregion and each layer of setting, begins to set the parameter in each node, link, additional information, floor, district and territory.
The parameter of node, link and the additional information of electronic chart storage contains index part, classified part and declaratives respectively.Wherein index part is made of place name, structure name and absolute name.Classified part is made of numeral and letter.The declaratives of node are made of coordinate, type and annotation information.The declaratives of link are made of start node, terminal node, shape, length, direction, type, annotation information and traffic related information.The declaratives of additional information are constituted by coordinate, place link, direction with apart from distance, type, the annotation information of node.After above-mentioned parameter is set, be stored in the storer respectively.
After the parameter in floor, district and territory also is set and stores, can retrieve and show electronic chart.During demonstration, this electronic chart link is shown as line, and node and additional information are shown as a little.During start, at first access high-rise node, link and additional information parameter, show high-rise map then, mode with literal or figure is mapped out most important facility or unit simultaneously, also the mode of available comment marks most important facility or unit in the edge of screen, or to roll and the literal of migration and centre or the edge that graphics mode is presented at most important advertisement screen.The user can be by successively consult a map details or directly retrieve of touch-screen, mouse or keyboard then.The information of retrieving and showing comprises that the place that need search reaches the title of service facility, building, unit on the way; The annotation information that also comprises the customer requirements such as traffic map, mailing address, telephone number, service item, the scope of business of this service facility, building, unit when the information of explicit user retrieval, shows on the way or corresponding advertising message simultaneously.
The electronic chart that adopts this method to make is well arranged, be easy to retrieval, information is extensive and practical, and little, the used mobile terminal cost of the storage space that takies is low.
But application for a patent for invention 02124155.4 fails to solve following problem:
02124155.4 of application for a patent for invention at be a kind of electronic chart of simplification, during demonstration, real road is shown as line, and represent the node in a zone or additional information may be a point, like this, when the coordinate of having determined the user with some method, and during by the position of this coordinate explicit user on electronic chart, this position may not dropped on the actual residing node of this user, link or the additional information.Above-mentioned electronic chart does not have to solve after the starting point and terminal point of known users yet, according to traffic, determines the concrete grammar of subscriber's line.Do not solve after subscriber's line and customer location are determined the problem of this circuit and position being exported with which kind of suitable method simultaneously.
Summary of the invention
The technical problem to be solved in the present invention is: based on application for a patent for invention 02124155.4, a kind of method for making of electronic chart is provided, rely on this method, the user coordinates that can provide by external positioning equipment is determined user's road of living in, crossing, residential quarter or other facilities; According to traffic, automatically calculate the generic line and the circuit that saves time most that arrive the destination, and provide a kind of means of predicting the magnitude of traffic flow and channel traffic for vehicle supervision department.
Another object of the present invention is to provide a kind of method that shows electronic chart with figure and mode word for the user, show traffic and traffic limited case, to satisfy the needs of user by electronic map query generic line, the circuit that saves time most, own present position and this position advertisement.
For reaching the technical scheme that this order takes be: a kind of method for making of electronic chart comprises: the parameter → demonstration electronic chart that the layer-management information → setting of parameter → establishment, setting and the storing electronic map of node, link and the additional information of the electronic chart layering → setting electronic chart of the information classification that constitutes electronic chart → needs are made is organized into critical facility, unit information and advertising message in the electronic chart; Wherein, be that information with electronic chart is divided into frame information and additional information two classes to the information classification that constitutes electronic chart, frame information is for constituting the road information of electronic chart profile; Additional information is for constituting the geography information and the advertising message of electronic chart details, and described frame information is made up of node and link, and described additional information is made up of place name, coordinate, absolute name, classification and ad content, it is characterized in that further comprising the steps of,
The first step, the parameter of setting electronic chart:
1), to being distributed in each cell setting coordinate range parameter of every layer;
2), to the coordinate range parameter of node, link and additional information setting coarse;
3), node, link and additional information are set the precise coordinates range parameter;
4), to link setting traffic weight parameter;
5), to link and unsteady link setting from this link to each travelling of connected link mutually whether by the parameter of forbidden, forbidden vehicle and forbidden time;
6) whether be one-way road or forbidden line, forbidden vehicle and the parameter of forbidden time, to link and unsteady link setting;
7), to link and unsteady link setting road conditions coefficient Z
i
8), the advertisement parameter is set in product/image advertising, to positioning advertising setting coordinate parameters;
In second step, the traffic weight that vehicle supervision department is issued stores in the storer of electronic chart;
The 3rd step, determine user coordinates by outside locating device, and compare with sub-district, node, additional information, link coordinates scope, successively in rough range and accurate scope, judge the concrete node in user place, link or additional information, when having determined that the user is on which node or additional information, the coordinate of this node or additional information is made as the displaing coordinate of user on electronic chart; When the user is in certain bar link center line (x
d, y
d) during the position, then with this position (x
d, y
d) be made as user's displaing coordinate; When user coordinates was not on above-mentioned node, link or additional information, then the user may depart from regular link, the output warning message, and user coordinates is made as displaing coordinate;
The 4th step, if the user is on certain link, store this link name, storage user arrive and leave this link time, store the traffic weight of this link on this direction, the title of this link is exportable to be stored in the distance pen recorder of motor vehicle;
If the user does not use outside locating device, ignored for the 3rd step and the 4th step;
The 5th goes on foot, and determines the starting point and the terminal point of search path,
Determine starting point: with the position as starting point, or input starting point coordinate, or select node, link and additional information as starting point;
Determine terminal point: the input terminal point coordinate, or select node, link and additional information as terminal point;
The 6th step, determine, search and the calculating generic line and the circuit that saves time most,
1), the layer that uses at present according to the user or the starting point of selecting according to the user and terminal point or the starting point of selecting according to the user and the relative position of terminal point, determine which layer search track at electronic chart;
2), after the employed layer of electronic chart is determined, at first determine the scope of search track, pass through the generic line of following parameter searching origin-to-destination then: by input user type of vehicle, by importing current date and time, by being in node and the link in the search area, by link traffic jam weight, traffic limited case and road conditions coefficient Z in the search area
i
3), zequin arrives the generic line of terminal point in such a way: by link in the search area and starting point, terminal point and node constitute a weighted and directed diagraph that does not have negative loop, starting point, terminal point and node are as the summit of weighted and directed diagraph, link constitutes the arc of weighted and directed diagraph, one way link constitutes an arc, two-way link constitutes the opposite arc of a pair of direction, as two internodal links more than one, one way link of then every increase, increase an arc, every increase by one two-way link increases a pair of arc, if certain direction of certain bar link is by forbidden, then represent the arc of this this direction of link in weighted and directed diagraph, not occur, calculate the shortest path of origin-to-destination in this weighted and directed diagraph with Graph-theoretical Approach, obtain generic line, in computation process, linkage length is the power of arc, and the traffic limited case constitutes the constraint condition of aforementioned calculation process;
4), as the above-mentioned the 3rd) do not find the generic line of origin-to-destination, enlarge search area, repeat the 2nd), the 3rd), up to the generic line of finding out origin-to-destination;
5), determine, search and calculate the circuit that saves time most, its step with determine, search with to calculate generic line identical, under the situation of not considering road, will be wherein " linkage length " be changed to " linkage length * traffic jam weight ", considering under the situation of road, will be wherein " linkage length " be changed to " linkage length * traffic jam weight * road conditions coefficient ";
6), after generic line and the circuit that saves time are most determined, use P1 respectively, V1, P2, V2 ..., Pm, Vm, PT, the form of LT is exported its result of calculation;
In the 7th step, storage generic line and the circuit that saves time most send starting point and endpoint information to vehicle supervision department, or send the circuit that selected circuit link name or the user's selection on the way that save time most travelled;
The 8th step, list generic line and the circuit that saves time most on the link name, retrieve electronic map historical record, the averaging time or the scheduled time of calculating these links of process under existing traffic weight, as can't directly calculating under existing traffic weight averaging time through a certain or some bar in the above-mentioned link, can calculate the averaging time under other traffic weights, method with interpolation converses under existing traffic weight, the averaging time of process this or these link, addition averaging time with all links of process under the existing traffic weight draws the scheduled time through this circuit;
The 9th step, if user no show destination still after after a while, electronic chart requires the user to redefine starting point and terminal point automatically, calculate the new generic line and the circuit that saves time most, if the user need recomputate, send new starting point and terminal point to vehicle supervision department, or send save time most circuit or user and select the circuit that travels.
A kind of display packing of electronic chart is divided into following steps:
Which layer electronic chart be the first step determine to use;
Second step, access the type parameter of retrieval node, link and additional information, 1. finding out should be in the node and the additional information of this layer demonstration, and at the coordinate place with the point represent, 2. access this layer link range parameter, and link up with broken line and to represent, 3. show its place name with literal on the next door of main node, link and important additional information;
In the 3rd step, input user type of vehicle reads current date and time from clock circuit automatically; Access link traffic limited case parameter,, determine the traffic limited case and the demonstration of display layer according to user's type of vehicle, current date and time;
The 4th step accessed product/image advertising, showed the literal or the visual advertisement of product/image advertising on the screen next door;
The 5th step, when customer requirements shows traffic, the traffic weight of representing link with the line of different brightness, different flash speed, different thicknesses or different color, each link can represent that with two identical or different lines the single line of also available that represent traffic situation weighted mean is represented according to the traffic weight of each direction;
The 6th step, after receiving the user coordinates that outside locating device is determined, with form explicit user position and near the main additional information this coordinate, the positioning advertising etc. of bright spot, point of scintillation or colored bright spot or distinctive marks, its manifestation mode can be: at the additional information place, positioning advertising coordinate place marks, aside marks, broadcasts with the rolling written form or broadcast with the voice synthesized form on the next door of display screen with fixing written form with the form of bright spot, point of scintillation or colored bright spot or distinctive marks;
The 7th step, as receive customer requirements demonstration oneself after the instruction of which node, additional information or any bar link, displaing coordinate the user marks customer location, or mark user place link, or show the title of this node, link or additional information, simultaneously, search near the main additional information of user's displaing coordinate, positioning advertising and demonstration;
The 8th step, do not use outside locating device as the user, electronic chart is the explicit user position not, wish to show as the user, manually the position of input oneself is determined user's displaing coordinate and is shown that near main additional information, the positioning advertising the search user displaing coordinate also shows;
The 9th step, when customer requirements inquiry circuit, at first import starting point and terminal point, inquire that then the user will inquire about the generic line circuit that still saves time most, after obtaining above-mentioned two questions answer, begin to calculate, after calculating the result, show the generic line or the circuit that saves time most, or access the title of link on the way, explain circuit with explanatory note, also can explain circuit, when showing above-mentioned information, can show this Route Length and the scheduled time of passing through simultaneously by phonetic synthesis;
The tenth step, search generic line or circuit main additional information, the positioning advertising on the link on the way that save time most, if the user has used external positioning system, the user coordinates position by showing shows by said method; If the user does not use external positioning system, press the order of link on the way, according to the scheduled time of process link under existing traffic weight, the mode word demonstration positioning advertising to roll by screen;
The 11 step, when customer requirements is inquired about certain information, retrieve this information earlier, mark this information at this information coordinate place again, demonstration to the generic line of this information or the circuit that saves time most, and shows the situations such as address, telephone number, service item and the scope of business of this information from the present position on screen next door;
In the 12 step,, or indicate the zone of demonstration in detail by keyboard, configuration platform after, show with this position or zone to be following one deck electronic chart at center if the user double-clicks a certain position by touch-screen or mouse.
Advantage of the present invention is:
1, revised the display error that the simplification because of electronic chart brings.
2, make electronic chart seek the generic line and the circuit that saves time most that arrive the destination by analytical calculation.
3, can show traffic restricted information, traffic related information, and when calculating generic line and saving time circuit most, take into account.
4, make vehicle supervision department that the way of a kind of predict traffic conditions and channel traffic arranged.
The route of 5, can registration of vehicle passing by.
6, a kind of advertisement scheme, remarkable in economical benefits are provided at user's concrete condition.
Description of drawings
Fig. 1 is the process flow diagram that concerns of embodiment of the invention work.
Fig. 2 is the electric structural drawing of the embodiment of the invention.
Fig. 3 determines the process flow diagram of method for embodiment of the invention displaing coordinate.
Fig. 4 calculates generic line and a kind of legend of the circuit that saves time most for the present invention.
Fig. 5 calculates generic line and the process flow diagram of the circuit that saves time most for the present invention.
Fig. 6 is a kind of legend of display packing embodiment of the present invention.
Embodiment
The method for making of this electronic chart is divided into following steps:
The first step, the parameter of setting electronic chart.
1), gives coordinate range in each sub-district of every layer, in order to preliminary judgement user's position.Because the border of sub-district may be irregular, so each cell coordinate scope allows overlapping.Coordinate range adopts x
1≤ x≤x
2, y
1≤ y≤y
2Data mode.For the parameter of cell setting is { (x
1, x
2), (y
1, y
2).
2), to the coordinate range parameter of node, link and additional information setting coarse, with { (x
b, x
e), (y
b, y
e) expression.
3), node, link and additional information are set the precise coordinates range parameter.
In embodiments of the present invention, adopt 6 kinds of methods accurately to set the parameter of node or additional information scope:
Garden, ellipse, rectangle (containing square), polygon and combination thereof, the point that gathers on egress of giving successively in order or the additional information border, and provide following parameter respectively:
Garden: provide heart position, garden (x
0, y
0) and radius r
0Node or additional information setup parameter { garden, (x
0, y
0), r
0.
Oval: as to provide two focal position (x
1, y
1), (x
2, y
2) and longitudinal axis L.Node or additional information setup parameter { ellipse, (x
1, y
1), (x
2, y
2), L}.
Square and rectangle: with the coordinate (x that is parallel to its center line two ends on one side
1, y
1), (x
2, y
2), just (length) square length of side a or length and width a, b represents.Node or additional information setup parameter { rectangle, (x
1, y
1), (x
2, y
2), a, b}.
Polygon: the coordinate (x of polygon vertex
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n) expression.Here, polygon is the salient angle polygon.Node or additional information setup parameter { polygon, (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n).
Can not be with above-mentioned any diagrammatic representation as node or additional field information, the combination of also available two kinds or multiple figure is represented.Figure can be overlapping, and figure also divides positive figure and negative patterning, positive diagrammatic representation its interior subordinate's node or additional information, and negative nodal point represents that its inside does not belong to node or additional information.Node or additional information setup parameter { combination, {+garden, (x
0, y
0), r
0, {+ellipse, (x
1, y
1), (x
2, y
2), L}, { polygon, (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n).
Very complicated when node or additional field range of information, the point that gathers on node that provides successively in order or the additional information border marks the coordinate of each point, { (x successively
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (X
n, y
n).Be node or additional information setup parameter { frontier point, (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n).
For additional field information, it has several position (domain node) on electronic chart, and present embodiment adopts two kinds of ways to describe the additional field range of information:
There is same scope the sub-district of 1. whole additional field information representative, and is nearest from which domain node, and then which domain node is this part of sub-district belong to.
2. dividing into for a short time of additional field information representative is identical with domain node quantity piece, each piece comprises and only comprises a domain node, when the user is in this piece with this its position of domain node coordinate representation.
For the accurate scope of link, represent its center line with one group of end to end n section broken line among the embodiment, suppose that simultaneously same link has identical width d everywhere.The parameter of link marks the coordinate (x of n+1 broken line end points in the electronic chart
1, y
1), (x
2, y
2) ... (x
n, y
n), (x
N+1, y
N+1) and width d.The link setting parameter is { (x
1, y
1), (x
2, y
2) ... (x
n, y
n), (x
N+1, y
N+1), d}.
For each layer, the scope of the node that said method provides, link and additional information mutually can not be overlapping.
4), traffic that electronic chart is represented, set the traffic weight parameter.The traffic weight provides according to the link blockage, promptly gives big weight to stopping up serious link, gives less weight to stopping up not serious link, as traffic is divided into 1,2, and 3,4 grades, also availability coefficient 1,2, and 4,8.Wherein 1 expression was not blocked up by the time, and 2 expressions need 2 times of times to pass through, and 4 expressions need 4 times of times to pass through, and the rest may be inferred.The traffic weight also can provide according to the requirement of vehicle supervision department's guided vehicle vehicle line, adjustment link traffic conditions, promptly the link to hope increase flow gives less weight, and give bigger weight to the link of hope minimizing flow, give traffic weight positive infinity to interim forbidden link; The traffic weight parameter also can be the comprehensive parameters that traffic department provides according to the needs of adjusting traffic.
5), to link and unsteady link setting from this link to each travelling of connected link mutually whether by the parameter of forbidden, forbidden vehicle and forbidden time.The parametric representation that sets is { 2 of links, forbidden type of vehicle, forbidden start time, forbidden concluding time } (describing the forbidden parameter of link 1 to link 2).
6) whether be one-way road or forbidden line, forbidden vehicle and the parameter of forbidden time, to link and unsteady link setting.The parametric representation that sets is { single file/forbidden, forbidden type of vehicle, forbidden start time, forbidden concluding time }.
Following general designation the above-mentioned the 5th), the 6th) parameter of setting is the traffic limited case.The traffic limited case was upgraded at any time with vehicle and time, and is forbidden to lorry as certain highway section, but car is not limited, and certain link is at some time period single file, certain link at a time between section forbid turning left, turn right at certain node or craspedodrome etc.
7), to link and unsteady link setting road conditions coefficient Z
i, roads itself such as the width of this coefficient reflection link and flatness are to the influence of vehicle '.
8), advertising message is divided into product/image advertising and positioning advertising, to product/image advertising setting advertisement parameter, to positioning advertising setting coordinate parameters.
In second step, traffic department is according to the traffic that detects and predict and wish the circuit that the guiding user travels, real-time release traffic weight, and user's electronic chart receives the traffic weight and stores in the electronic chart.
In the 3rd step, determine that the user is on which node, additional information or the link.Used outside locating devices such as GPS, LBS true as the user, and determined that by this locating device (x y), uses x for user's coordinate
1≤ x≤x
2, y
1≤ y≤y
2Mode, according to the cell coordinate scope, the preliminary judgement user is in which or which sub-district, judge that according to rough range the user may be on which or which node of this sub-district or these several sub-districts, link or the additional information, judges further that with accurate scope the user specifically is on which node, link or the additional information at last then.
Judge the user whether the algorithm in certain node or additional information be:
Garden: (x-x
0)
2+ (y-y
0)
2≤ r
0 2
Oval: ((x-x
0)
2+ (y-y
0)
2)
1/2+ ((x-x
0)
2+ (y-y
0)
2)
1/2≤ L
For rectangle (to square a=b), a=((x is arranged
2-x
1)
2+ (y
2-y
1)
2)
1/2Relation exist, differentiation is that one group of two inequality is set up simultaneously:
0≤(x-x
1)(x
2-x
1)/a+(y-y
1)(y
2-y
1)/a≤a
-b/2≤-(x-x
1)(y
2-y
1)/a+(y-y
1)(x
2-x
1)/a≤b/2
For n limit type, be respectively (x as its apex coordinate of counting counterclockwise from certain vertex
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n) (as figure), then its differentiation is that one group of n inequality is set up simultaneously:
-(x-x
1)(y
2-y
1)/L
1+(y-y
1)(x
2-x
1)/L
1≥0
-(x-x
2)(y
3-y
2)/L
2+(y-y
2)(x
3-x
2)/L
2≥0
……
-(x-x
n-1)(y
n-y
n-1)/L
n-1+(y-y
n-1)(x
n-x
n-1)/L
n-1≥0
-(x-x
n)(y
1-y
n)/L
n+(y-y
n)(x
1-x
n)/L
n≥0
Wherein,
L
1＝((x
2-x
1)
2+(y
2-y
1)
2)
1/2
L
2＝((x
3-x
2)
2+(y
3-y
2)
2)
1/2
……
L
n-1＝((x
n-x
n-1)
2+(y
n-y
n-1)
2)
1/2
L
n＝((x
1-x
n)
2+(y
1-y
n)
2)
1/2
For the additional field information that a plurality of domain nodes are arranged, determine according to its scope which domain node method judgement user is in.
1. whole additional field information has same scope, and the domain node coordinate is respectively (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n), can compare that (x is y) apart from the distance ((x of each domain node
i-x)
2+ (y
i-y)
2)
1/2Size, i=1 wherein, 2 ..., n.Think that the user is in nearest domain node, all identical as the user with several domain node distances, can select one at random.
2. additional field information is divided into a plurality of scopes, each domain node is represented one, then can carry out the judgement of general node and additional information by the front.
When node, additional information can not be represented with above-mentioned garden, ellipse, rectangle (square) or salient angle polygon, and when needing to represent with above-mentioned multiple combination of shapes, available said method combination judges that criterion is that user coordinates is not in one of positive figure and in all negative patterning.
Use by clockwise or the point coordinate that gathers on node that counterclockwise provides successively or the additional information border when describing when node, additional information, its differentiation is:
1. can find two couples of consecutive point (x
I-1, y
I-1), (x
i, y
i) and (x
J-1, y
J-1), (x
j, y
j),
x
i-1≤x≤x
1，x
j-1≤x≤x
j
y
I-1≤ y≤y
J-1, y
i≤ y≤y
j, perhaps y
I-1〉=y 〉=y
J-1, y
i〉=y 〉=y
j
2. can find two couples of consecutive point (x
1-1, y
1-1), (x
1, y
1) and (x
K-1, y
K-1), (x
k, y
k),
x
1-1≤ x≤x
K-1, x
1≤ x≤x
k, perhaps x
1-1〉=x 〉=x
K-1, x
1〉=x 〉=x
k,
y
1-1≤y≤y
1，y
k-1≤y≤y
k，
3. above-mentioned two conditions must be set up simultaneously.For complex boundary, even above-mentioned two conditions are set up simultaneously, the user also may not be in above-mentioned node or the additional information, and conversely, above-mentioned two conditions are false, and the user also may be in this node or additional information.When using, must be noted that by clockwise or when gathering point coordinate description node or additional information on the border that counterclockwise provides successively.
When having determined that the user is on which node or the additional information, the coordinate of this node or additional information is exactly the displaing coordinate of user on electronic chart.
For the link of being made up of n bar broken line, then it is differentiated and to be n group inequality, stands as long as forms by one, organizes as i, just thinks that the user is on this link i section broken line:
-d/2≤-(x-x
1)(y
2-y
1)/L
1+(y-y
1)(x
2-x
1)/L
1≤d/2
0≤(x
2-x
1)(x-x
1)/L
1+(y
2-y
1)(y-y
1)/L
1≤L
1
(1)
-d/2≤-(x-x
2)(y
3-y
2)/L
2+(y-y
2)(x
3-x
2)/L
2≤d/2
0≤(x
3-x
2)(x-x
2)/L
2+(y
3-y
2)(y-y
2)/L
2≤L
2
(2)
……
-d/2≤-(x-x
n-1)(y
n-y
n-1)/L
n-1+(y-y
n-1)(x
n-x
n-1)/L
n-1≤d/2
0≤(x
n-x
n-1)(x-x
n-1)/L
n-1+(y
n-y
n-1)(y-y
n-1)/L
n-1≤L
n-1
(n-1)
-d/2≤-(x-x
n)(y
n+1-y
n)/L
n+(y-y
n)(x
n+1-x
n)/L
n≤d/2
0≤(x
n+1-x
n)(x-x
n)/L
n+(y
n+1-y
n)(y-y
n)/L
n≤L
n
(n)
Wherein,
L
1＝((x
2-x
1)
2+(y
2-y
1)
2)
1/2
L
2＝((x
3-x
2)
2+(y
3-y
2)
2)
1/2
……
L
n-1＝((x
n-x
n-1)
2+(y
n-y
n-1)
2)
1/2
L
n＝((x
n+1-x
n)
2+(y
n+1-y
n)
2)
1/2
In some cases, above-mentioned inequality has two and sets up simultaneously, and this is because occur overlapping at the above-mentioned judgment matrix of broken line end points; Accordingly, can occur that the user is in certain link but above-mentioned inequality all is false.Need do correction.As it is very little to form between the adjacent fold line of link angle, can do following correction to above-mentioned inequality group
-d/2≤-(x-x
1)(y
2-y
1)/L
1+(y-y
1)(x
2-x
1)/L
1≤d/2
0≤(x
2-x
1)(x-x
1)/L
1+(y
2-y
1)(y-y
1)/L
1≤L
1+Δ
1
(1)
-d/2≤-(x-x
2)(y
3-y
2)/L
2+(y-y
2)(x
3-x
2)/L
2≤d/2
-Δ
1≤(x
3-x
2)(x-x
2)/L
2+(y
3-y
2)(y-y
2)/L
2≤L
2+Δ
2
(2)
……
-d/2≤-(x-x
n-1)(y
n-y
n-1)/L
n-1+(y-y
n-1)(x
n-x
n-1)/L
n-1≤d/2
-Δ
n-1≤(x
n-x
n-1)(x-x
n-1)/L
n-1+(y
n-y
n-1)(y-y
n-1)/L
n-1≤L
n-1+Δ
n
(n-1)
-d/2≤-(x-x
n)(y
n+1-y
n)/L
n+(y-y
n)(x
n+1-x
n)/L
n≤d/2
-Δ
n≤(x
n+1-x
n)(x-x
n)/L
n+(y
n+1-y
n)(y-y
n)/L
n≤L
n
(n) wherein,
Δ
i＝d((y
i+2-y
i+1)(x
i+1-x
1)-(x
i+2-x
i+1)(y
i+1-y
i))/4L
iL
i+1
i＝1，2，……，n
When inequality group (i) when (i+1) setting up simultaneously, think the user on i section broken line, the coordinate that the user shows on electronic chart can be scaled (x
d, y
d), wherein,
x
d＝x
i+(x
i+1-x
i)
2(x-x
i)/L
i 2+(x
i+1-x
i)(y
i+1-y
i)(y-y
i)/L
i 2
y
d=y
i+ (x
I+1-x
i) (y
I+1-y
i) (x-x
i)/L
i 2+ (y
I+1-y
i)
2(y-y
i)/L
i 2But as (x
I+1-x
i) (x-x
i)/L
i+ (y
I+1-y
i) (y-y
i)/L
i≤ 0,
x
d=x
i, y
d=y
iAs (x
I+1-x
i) (x-x
i)/L
i+ (y
I+1-y
i) (y-y
i)/L
i〉=L
I,
x
d＝x
i+1，y
d＝y
i+1
Be on which node, the additional information as draw the user through aforementioned calculation, then this node, additional information coordinate are exactly user's displaing coordinate, and as through aforementioned calculation, the user is in the (x of certain bar link center line
d, y
d) position, then (x
d, y
d) be exactly user's displaing coordinate.If calculate through said method, user coordinates does not satisfy the Rule of judgment of above-mentioned any node, link or additional information, and then the user may depart from regular link, the output warning message, and user coordinates is a displaing coordinate.
Said process embodiment adopts integrated circuit that algorithm is solidified, to accelerate arithmetic speed.
In the 4th step,, store time, storage user that this link name, storage user arrived and left this link traffic weight of this link on this direction on this link the time if the user is on the link.Wherein, can get its mean value according to user's arrival to the variation of leaving this link traffic weight.Link name also is output in the external equipment of the distance pen recorder of taxi or automobile running record and preserves.
If the user does not use outside locating devices such as GPS, LBS true, user coordinates can't be measured automatically, and the 4th step was ignored.As determining user coordinates without any method, the 3rd step was also ignored.
The 5th goes on foot, and determines the starting point and the terminal point of search path.
Embodiment determines starting point with two kinds of methods:
1), position that the user is present is as starting point, if a. user uses outside locating devices such as GPS, LBS, can use user coordinates, or use user place node, link or additional information as starting point.If it is true that b. the user does not use outside locating devices such as GPS, LBS, can't know the coordinate of oneself, do not know to lay oneself open on which node, link or the additional information yet, can import more significant road, building or facility title on every side, inquire about from electronic chart.
2), need not make starting point in present position, but input starting point coordinate, or by query node, link or additional information, select node, link or additional information as starting point.
Embodiment determines terminal point with two kinds of methods: a. input coordinate.B. by query node, link or additional information, select node, link or additional information as terminal point.
In the 6th step, calculate the generic line and the circuit that saves time most.
1), determines which layer search track at electronic chart.At the different layers of electronic chart, possible circuit is different, and the quality of related road (width) is also inequality.There are several method or principle to determine to use which layer.
1. just using which layer at present according to the user.If starting point and terminal point are not to provide by coordinate, then unification is represented with additional information, node or the link of this layer.
2. starting point and the terminal point of selecting according to the user.Starting point of selecting as the user and terminal point use terminal point place layer not with one deck the time, and use above-mentioned demonstration location way to make starting point and terminal point be in same layer.
3. which layer the relative position of starting point of selecting according to the user and terminal point determines to use, and its principle is to make starting point and terminal point be in different districts in the layer that uses.
2), after the layer of the electronic chart that search to use is determined, determine the scope of search track.
1. be identified for deciding the position of two points of scope, (x
b, y
b), (x
e, y
e).
As starting point, terminal point or one is coordinate, and getting its coordinate is (x
b, y
b), (x
e, y
e).
As starting point, terminal point or one is node, and getting node coordinate is (x
b, y
b) and (x
e, y
e).
As starting point, terminal point or one is additional information, and then getting its place link respectively is (x from another point (starting point, terminal point) node coordinate far away
b, y
b) or (x
e, y
e).
As starting point, terminal point or one is link, and then getting respectively in its two end node from another point (starting point, terminal point) node coordinate far away is (x
b, y
b) or (x
e, y
e).
2. as (x
b, y
b) and (x
e, y
e) determine after, extract two parameter: L and S.
L is (x
b, y
b) and (x
e, y
e) between distance:
L＝((x
e-x
b)
2+(y
e-y
b)
2)
1/2
S is the change value, when starting point and terminal point or one are additional information, extracts the length of its place link, when starting point and terminal point or one are link, extracts linkage length, and the length of more above-mentioned one or two link is got the longest as S.
When starting point and terminal point were node, relatively the linkage length that connected of this two node was established the longest S ' that is,
As S '≤L/m, then get S=S ',
As S '＞L/m, then get S=L/m.
Wherein m is the map situation parameter relevant with the place layer.Embodiment gets m 〉=2.
3. (x
b, y
b), (x
e, y
e), after L and S determine, can determine search area.Adopt one of following several method to determine the scope of searching in the embodiment of the invention.
Garden: home position (x
0, y
0) and radius r
0
x
o＝(x
b+x
e)/2
y
0＝(y
b+y
e)/2
r
0＝L/2+S
Oval: two focal positions are (x
b, y
b), (x
e, y
e), major axis is L+2S.
Square and rectangle: (x
b, y
b) and (x
e, y
e) for being parallel to the coordinate of its center line two ends on one side, rectangular another length of side is 2S.
Rhombus: with (x
b, y
b), (x
e, y
e) be cornerwise a pair of summit, another diagonal angle line length 2S.Its scope judgment formula is :-S+S| (x
e-x
b) (x-(x
e+ x
b)/2)+(y
e-y
b) (y-(y
e+ y
b)/2) |/L
2≤-(y
e-y
b) (x-(x
e+ x
b)/2)/2L+ (x
e-x
b) (y-(y
e+ y
b)/2)/2L≤S-S| (x
e-x
b) (x-(x
e+ x
b)/2)+(y
e-y
b) (y-(y
e+ y
b)/2) |/L
2
3), after search area is determined, begin to search the generic line of origin-to-destination.
Search and carry out in the following manner:
1. import user's type of vehicle, current date, time.
2. find out all and be in the interior node of search area, according to all links of each node in the electronic cartography search area (comprising starting point O) connection and the node (comprising terminal point T) of the other end.Annotate: embodiment starting point O and terminal point T herein is exactly real starting point and terminal point, rather than (the x that uses when determining search area of front
b, y
b) and (x
e, y
e).Referring to table one and Fig. 4, in Fig. 4, thin arrow is represented the one-way road on the link, and traffic restricted informations such as craspedodrome are represented to reverse end for end, forbidden turning left, forbid to the hollow thick arrow in link next door, and the thin arrow in link next door is represented the traffic jam situation.Table one:
Sometimes the link from certain node to another node is more than one, as the dotted line between node among Fig. 34 and 8, also should mark in last table.For the one-way road, as P52, P95, P87, P58, the PT8 that arrow among Fig. 3 is represented, its reverse link P25, P59, P78, P85, P8T should not occur in Table 1.To the traffic weight is infinitely-great link direction, cancels in table.
| Sequence number | Node | Arrive link 1 | Node 1 | Arrive link 2 | Node 2 | Arrive link 3 | Node 3 | Arrive link 4 | Node 4 | Arrive link 5 | Node 5 |
| ??0 | ??V0 | ??P01 | ??V1 | ??P02 | ??V2 | ||||||
| ??1 | ??V1 | ??P12 | ??V2 | ??P14 | ??V4 | ??P15 | ??V5 | ||||
| ??2 | ??V2 | ??P21 | ??V1 | ||||||||
| ??3 | ??V3 | ??P34 | ??V4 | ??P37 | ??V7 | ||||||
| ??4 | ??V4 | ??P41 | ??V1 | ??P43 | ??V3 | ??P45 | ??V5 | ??P48 | ??V8 | ?P48′ | V8 |
| ??5 | ??V5 | ??P51 | ??V1 | ??P52 | ??V2 | ??P54 | ??V4 | ??P56 | ??V6 | ?P58 | V8 |
| ??6 | ??V6 | ??P65 | ??V5 | ??P610 | ??V10 | ||||||
| ??7 | ??V7 | ??P73 | ??V3 | ||||||||
| ??8 | ??V8 | ??P84 | ??V4 | ??P87 | ??V7 | ??P89 | ??V9 | ??P84′ | ??P4 | ||
| ??9 | ??V9 | ??P95 | ??V5 | ??P98 | ??V8 | ??P910 | ??V10 | ??P911 | ??V11 | ||
| ??10 | ??V10 | ??P106 | ??V6 | ??P109 | ??V9 | ||||||
| ??11 | ??V11 | ??P119 | ??V9 | ??P11T | ??VT |
2. according to electronic chart, top table one, user's type of vehicle, current date, time and traffic, provide link circuit condition table table two.Table two:
| Link | Length | Weight | Link 1 | Link 2 | Link 3 | Link 4 | Link 5 | |
| ?1 | ?P01 | ?2 | ?1 | ?P14 | ?P15 | ?P12 | ||
| ?2 | ?P02 | ?3 | ?1 | ?P21 | ||||
| ?3 | ?P12 | ?5 | ?1 | |||||
| ?4 | ?P14 | ?3 | ?8 | ?P43 | ?P48 | ?P45 | ?P48′ | |
| ?5 | ?P15 | ?6 | ?4 | ?P52 | ?P58 | ?P56 | ?P54 | |
| ?6 | ?P21 | ?5 | ?1 | ?P14 | ?P15 | |||
| ?7 | ?P34 | ?6 | ?8 | ?P41 | ?P48 | ?P48′ | P45 | |
| ?8 | ?P37 | ?4 | ?1 | |||||
| ?9 | ?P41 | ?3 | ?1 | ?P12 | ?P15 | |||
| ?10 | ?P43 | ?6 | ?1 | ?P37 | ||||
| ?11 | ?P45 | ?5 | ?1 | ?P51 | ?P52 | ?P56 | ?P58 | |
| ?12 | ?P48 | ?4 | ?1 | ?P87 | ?P89 | ?P84′ | ||
| ?13 | ?P48′ | ?6 | ?1 | ?P87 | ?P89 | ?P84 | ||
| ?14 | ?P51 | ?6 | ?1 | ?P12 | ?P14 |
| ??15 | ??P52 | ??7 | ??1 | ??P21 | ||||
| ??16 | ??P54 | ??5 | ??8 | ??P41 | ??P43 | ??P45 | ??P48 | ??P48′ |
| ??17 | ??P56 | ??7 | ??1 | ??P610 | ||||
| ??18 | ??P58 | ??7 | ??1 | ??P84 | ??P84′ | ??P87 | ??P89 | |
| ??19 | ??P65 | ??7 | ??4 | ??P51 | ??P52 | ??P54 | ??P58 | |
| ??20 | ??P610 | ??4 | ??1 | ??P109 | ||||
| ??21 | ??P73 | ??4 | ??1 | ??P34 | ||||
| ??22 | ??P84 | ??4 | ??8 | ??P41 | ??P43 | ??P48′ | ??P45 | |
| ??23 | ??P84′ | ??6 | ??4 | ??P41 | ??P43 | ??P48 | ??P45 | |
| ??24 | ??P87 | ??6 | ??1 | ??P73 | ||||
| ??25 | ??P89 | ??5 | ??1 | ??P95 | ??P910 | ??P911 | ||
| ??26 | ??P95 | ??4 | ??4 | ??P51 | ??P52 | ??P54 | ??P56 | ??P58 |
| ??27 | ??P98 | ??5 | ??1 | ??P84 | ??P84′ | ??P87 | ||
| ??28 | ??P910 | ??7 | ??1 | ??P106 | ??P109 | |||
| ??29 | ??P911 | ??5 | ??1 | ??P11T | ||||
| ??30 | ??P106 | ??4 | ??1 | ??P65 | ||||
| ??31 | ??P109 | ??7 | ??1 | ??P95 | ??P98 | ??P911 | ||
| ??32 | ??P119 | ??5 | ??1 | ??P95 | ??P98 | ??P910 | ||
| ??33 | ??P11T | ??5 | ??1 | ??PT8 |
Note during making table two, the traffic limited case should reflect in table, remove the one-way road and should be reflected in table, as P52 is that the one-way road can not be travelled P12 to P25, P95 is that the one-way road can not be travelled P15, P45 to P59, P58 is that the one-way road can not be travelled PT8, P48, P48 ', P98 to P85, and PT8 is that the one-way road can not be travelled P48, P48 ', P58, P98 to P8T, and P87 is that the one-way road can not be travelled P37 to P78.Forbidding turning left, turn right or keep straight in some crossing, perhaps allows tune should reflect that also forbid the P911 that keeps straight on as P59, P15 forbids the P54 that turns left, and P910 allows the P109 that turns around.The traffic limited case was upgraded at any time with vehicle, time, but table two data remain unchanged in calculating.Weight refers to the traffic jam weight in the table two.The traffic jam weight is upgraded at any time, but remains unchanged in each the calculating.To the link that floats, to form by n link as it, length is respectively P
i, i=1,2 ..., n, the traffic jam weight is respectively T
i, the traffic jam weight of the link that then should float is
∑
i＝1，nP
iT
i/∑
i＝1，nP
1
If electronic chart is imported, also add the road conditions coefficient Z of reflection road conditions in the traffic jam weight
i, last traffic comprehensive weight is T
iZ
I
4. according to table two, zequin is to the generic line of terminal point.
As in the search area except that Origin And Destination, total n node made the form of (n+1) * 2 (n+1), or array, matrix, begins seasonal form, array, the plain full sky of entry of a matrix, progressively inserts in following calculating.The calculating principle is as follows: link in the search area and starting point, terminal point, node constitute a weighted and directed diagraph that does not have negative loop, starting point, terminal point, node are the summit of digraph, link constitutes the arc of digraph, and one way link forms an arc, and two-way link constitutes the opposite arc of a pair of direction.As two internodal links more than one, one way link of then every increase increases every increase by one two-way link of arc, increases a pair of arc.If on behalf of the arc of this this direction of link, certain direction of certain bar link then do not occur in weighted and directed diagraph by forbidden.The process of searching the generic line of origin-to-destination is exactly the process of calculating in the oriented weighted graph from the origin-to-destination shortest path.Linkage length is the power of arc, and the traffic limited case of reflection constitutes the constraint condition of aforementioned calculation process in the table two.
Concrete computing method are: if P1, and V1, P2, V2 ..., Pm, Vm, PT, VT) the interior generic line of expression search area from origin-to-destination.Wherein P1 represents from the generic line of origin-to-destination, and from first section link lighting, V1 represents to connect the node of P1 and P2, PT represents the final stage link, and m represents on this circuit total m+1 bar link, then this circuit also be in the search area from starting point to this circuit on arbitrary node V
iGeneric line.
A. according to table two, list link and the node of starting point to connected node, each link and other end node account for delegation.
B. go on foot new-found node for a, with arrival link that this node passes through, table look-up and two see that it can arrive other nodes by which link, list the node of every circuit of such formation and arrival and calculate line length, for existing node in the form, Route Length in each bar circuit of this new generation of comparison and the form, shorter as existing line length in the form, the circuit of ignoring new generation, otherwise produce the circuit that the shortest circuit of length in the circuit replaces arriving in the form this node with new.For the node that does not have in the form, newly produce in the circuit and to arrive the shortest circuit of this node ' s length and be put in the form.
C. go on foot new-found node for b, with arrival link that this node passes through, table look-up and two see that it can arrive other nodes by which link, list the node of every circuit of such formation and arrival and calculate line length, for existing node in the form, Route Length in each bar circuit of this new generation of comparison and the form, shorter as existing line length in the form, the circuit of ignoring new generation, otherwise produce the circuit that the shortest circuit of length in the circuit replaces arriving in the form this node with new.As containing this node in certain bar circuit in the form but be not the circuit last point, can last link arrive the node of this node back in the original circuit of form in the comparison new line, as can, replace the circuit before this node in the original circuit of form with new line, otherwise keep original circuit constant.For the node that does not have in the form, newly produce in the circuit and to arrive the shortest circuit of this node ' s length and be put in the form.
D. go on foot new-found node for c, repeat the c step.
Repeat said process, appear in the form up to all nodes and terminal point.Then right column is the generic line of a behavior origin-to-destination of terminal point in the form.
Annotate: in (1), the above-mentioned line length comparison procedure,, get that to comprise node few as two-lines road equal in length; Also identical as two-lines circuit node number, then get a circuit at random.
(2), when producing the circuit that the shortest circuit of length in the circuit replaces arriving in the form this node with new, and contain this node in certain bar circuit in the form but be not the circuit last point, in this case, can not arrive the node that there is this node back in the circuit in form Central Plains as last link in the new line, keep this original circuit constant, and only change All other routes in the form, and will produce circle, this circuit may not be a generic line simultaneously.The correction way that embodiment adopts is as follows: a) produce in the subsequent calculations and arrive the shorter circuit of this node, and this circuit can arrive next node in the former form circuit, replaces this node previous section of the original circuit of form with new line; B) use all circuits from starting point to this node, the generic line that can arrive next node in the form replaces this node previous section of the original circuit of form.
(3), when all nodes and terminal point in the search area all appear at last row of the every row of table three respectively, the generic line of each node and terminal point is all found in then from the starting point to the search area, do not occur if any a node, then in search area, this node and starting point are disconnected, do not occur as terminal point, then need to enlarge search area, promptly increase the S value or change the method for selecting search area, repeat aforementioned calculation work then.
As shown in Figure 3, calculate the generic line of electronic chart, elliptical shape is represented search area among the figure, except that starting point and terminal point, has 11 nodes in the search area, makees the table three of 12*24.Table three:
I), two-lines road P01, P02 are arranged from starting point to other nodes, arrive V1, V2, put into first and second row of table three.
L1＝LP01＝2?????????????????????????????(V1-1)
L2＝Lp02＝3??????????????????????????(V2-1)
| P01 | ?V1 | ||||||||||
| P02 | ?V2 |
Ii), the node V1 that finds above, can arrive V4, V5 and V2 by P14, P15, P12,
L1+P14＝2+3＝5?????????????????????????(V4-1)
L1+P15＝2+6＝8?????????????????????????(V5-1)
L1+P12＝2+5＝7?????????????????????????(V2-2)
The node V2 that finds above can arrive V1 by P21,
L2+P21＝3+5＝8?????????????????????????(V1-2)
L4＝5，L5＝8
Arrive V1, the V2 circuit is constant, newly finds node V4, V5, it is as follows that circuit is inserted table three:
| P01 | ?V1 | ||||||||||
| P02 | ?V2 | ||||||||||
| P01 | ?V1 | ?P14 | ?V4 | ||||||||
| P01 | ?V1 | ?P15 | ?V5 |
Iii), the node V4 that finds above, can arrive V3, V8 and V5 by P43, P48, P48 ', P45,
L4+P43＝5+6＝11????????????????????(V3-1)
L4+P45＝5+5＝10????????????????????(V4-2)
L4+P48＝5+4＝9?????????????????????(V8-1)
L4+P48′＝5+6＝11??????????????????(V8-2)
The node V5 that finds above can arrive V2, V6, V8 by P52, P56, P58,
L5+P52＝8+7＝15????????????????????(V2-3)
L5+P56＝8+7＝15????????????????????(V6-2)
L5+P58＝8+7＝15????????????????????(V8-3)
L3＝11，L8＝9，L6＝15
Arrive V1, V2, V4, the V5 circuit is constant, newly finds node V3, V6, V8, it is as follows that circuit is inserted table three:
| P01 | ?V1 | ||||||||||
| P02 | ?V2 | ||||||||||
| P01 | ?V1 | ?P14 | ?V4 | ||||||||
| P01 | ?V1 | ?P15 | ?V5 | ||||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P43 | ?V3 | ||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ||||||
| P01 | ?V1 | ?P15 | ?V5 | ?P56 | ?V6 |
Iv), the node V3 that finds above, can arrive V7 by P37,
L3+P37＝11+4＝15??????????????????????(V7-1)
The node V6 that finds above can arrive V10 by P610,
L6+P610＝15+4＝19?????????????????????(V10-1)
The node V8 that finds above can arrive V4, V7, V9 by P84 ', P87, P89,
L8+P84′＝9+6＝15????????????????????????(V4-3)
L8+P87＝9+6＝15??????????????????????????(V7-2)
L8+P89＝9+5＝15??????????????????????????(V9-1)
L7＝15，L10＝19，L9＝14
Arrive V1, V2, V4, V5, V3, V6, the V8 circuit is constant, newly find node V7, V10, V9, it is as follows that circuit is inserted table three: the length that wherein arrives the two-lines road (V7-1) of V7 and (V7-2) is identical with the node number, an optional circuit (V7-1), and it is as follows to insert table three.
| P01 | ?V1 | ||||||||||
| P02 | ?V2 | ||||||||||
| P01 | ?V1 | ?P14 | ?V4 | ||||||||
| P01 | ?V1 | ?P15 | ?V5 | ||||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P43 | ?V3 | ||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ||||||
| P01 | ?V1 | ?P15 | ?V5 | ?P56 | ?V6 | ||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P43 | ?V3 | ?P37 | ?V7 | ||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P89 | ?V9 | ||||
| P01 | ?V1 | ?P15 | ?V5 | ?P56 | ?V6 | ?P610 | ?V10 |
V), the node V7 that finds above because V87 is the one-way road, therefore can not arrive other node again;
The node V10 that finds above can arrive V9 by P109,
L10+P109＝19+7＝26????????????????(V9-2)
L8+P87＝9+6＝15???????????????????(V7-2)
The node V9 that finds above can arrive V5, V10, V11 by P95, P910, P911,
L9+P95＝14+4＝18??????????????????(V5-2)
L9+P910＝14+7＝21?????????????????(V10-2)
L9+P911＝14+5＝19?????????????????(V11-1)
L11=19 arrives V1, V2, V4, V5, V3, V6, V8, V7, V10, the V9 circuit is constant, newly finds node V11, and it is as follows that circuit is inserted table three:
| V2 | ?P02 | ||||||||||
| V1 | ?P01 | ||||||||||
| V1 | ?P14 | ?V4 | ?P01 | ||||||||
| V1 | ?P15 | ?V5 | ?P01 | ||||||||
| V1 | ?P14 | ?V4 | ?P43 | ?V3 | ?P01 | ||||||
| V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P01 | ||||||
| V1 | ?P15 | ?V5 | ?P56 | ?V6 | ?P01 | ||||||
| V1 | ?P14 | ?V4 | ?P43 | ?V3 | ?P01 | ?P37 | ?V7 | ||||
| V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P01 | ?P89 | ?V9 | ||||
| V1 | ?P15 | ?V5 | ?P56 | ?V6 | ?P01 | ?P610 | ?V10 | ||||
| V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P01 | ?P89 | ?V9 | ?P911 | ?V11 |
Vi), the node V11 that finds above, can arrive VT by P11T,
L11+P11T＝19+5＝24?????????????????????(VT-1)
LT=24 arrives V1, V2, V4, V5, V3, V6, V8, V7, V10, V9, the V11 circuit is constant, newly finds node VT, and it is as follows that circuit is inserted table three:
| P01 | ?V1 | ||||||||||
| P02 | ?V2 | ||||||||||
| P01 | ?V1 | ?P14 | ?V4 | ||||||||
| P01 | ?V1 | ?P15 | ?V5 | ||||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P43 | ?V3 | ||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ||||||
| P01 | ?V1 | ?P15 | ?V5 | ?P56 | ?V6 | ||||||
| P01 | ?V1 | ?P14 | ?V4 | ?P43 | ?V3 | ?P37 | ?V7 | ||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P89 | ?V9 | ||||
| P01 | ?V1 | ?P15 | ?V5 | ?P56 | ?V6 | ?P610 | ?V10 | ||||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P89 | ?V9 | ?P911 | ?V11 | ||
| P01 | ?V1 | ?P14 | ?V4 | ?P48 | ?V8 | ?P89 | ?V9 | ?P911 | ?V11 | ?P11T | ?VT |
Vii), VT appears in the above table, and all nodes and terminal point all appear in the table three in all search areas, and the generic line of the behavior origin-to-destination of VT is arranged in the table three.
4), as the 3rd generic line that does not find origin-to-destination, enlarge search area, promptly increase S value or from said method, select a kind of scope that redefines else, repeat the 2nd then), the 3rd), up to the generic line of finding out origin-to-destination.
5), when calculate considering traffic, the search of the circuit that saves time most is identical with the generic line method for searching, a. does not consider road conditions, " linkage length " is changed to " linkage length * traffic jam weight " and gets final product; B. consider road conditions, only with " linkage length " being changed to " linkage length * traffic jam weight * road conditions coefficient ".If in existing search area, generic line can find, the circuit that then saves time most also one finds surely.
6), after generic line and the circuit that saves time are most found out, use P1 respectively, V1, P2, V2 ..., Pm, Vm, PT, the form output result of calculation of LT.Wherein P1 represents that on the generic line or the circuit that saves time most of origin-to-destination, from first section link lighting, V1 represents to connect the node of P1 and P2, PT represents the final stage link, and m represents total m+1 bar link on this circuit, and LT represents the physical length of this circuit.The result of the generic line of the origin-to-destination of path search module output is { P01, V1, P14, V4, P48, V8, P89, V9, P911, V11, P11T, 24} among Fig. 3.
The foregoing description adopts integrated circuit that algorithm is solidified, to accelerate arithmetic speed.
Fig. 5 summed up for the 5th step and the 6th step, promptly to the step of generic line and the circuit that saves time most search.
In the 7th step, storage generic line and the circuit that saves time most send the circuit that save time most circuit and link name or user's selection on the way of starting point and endpoint information or selection are travelled to vehicle supervision department.
The 8th step, list generic line and save time circuit uplink name most, retrieve electronic map historical record, calculating is under existing traffic weight, through the averaging time or scheduled time of these links,, can calculate the averaging time under other traffic weights as can't directly calculating under existing traffic weight averaging time through a certain or some bar in the above-mentioned link, method with method of interpolation converses under existing traffic weight the averaging time of process this or these link.Addition averaging time with all links of process generic line under the existing traffic weight draws the scheduled time through generic line.With under the existing traffic weight through addition averaging time of all links of the circuit that saves time most, draw scheduled time through the circuit that saves time most.
In the 9th step, if after after a while, the user is no show still, requires the user to redefine starting point and terminal point, calculates the new generic line and the circuit that saves time most.
Here refer to that through after a while marked change has taken place for traffic weight and traffic limited case, when traffic weight and traffic limited case do not change, as travelling along generic line, then every bit is constant to the generic line of terminal point in the driving process; Equally, as along the circuit that saves time most, then every bit is constant to the circuit that saves time most of terminal point in the driving process.Embodiment judges whether and should recomputate with several criterions.
1), the time parameter in the traffic limited case parameter of all links, node in the search search area, if have, relatively this time parameter and last computation start time, current time,, then require automatically to recomputate as: last computation start time≤this time parameter≤current time.
Traffic weight T when 2), relatively interior all the link last computation of search area begin
iWith current traffic condition weight T
i',
If ∑
I=1, k(T
1-T
i')
2〉=Δ
T, then recomputate.Wherein k is a number of links in the search area, Δ
TBe empirical value, embodiment is taken as 0.5k to 15k.
If the user recomputates, send new starting point, terminal point or save time most circuit or user select the circuit that travels to vehicle supervision department.
The display packing of this electronic chart is divided into following steps:
Which layer electronic chart be the first step determine to use.General this electronic chart of demonstration is top during start.
Second step, the type parameter of retrieval node, link and additional information, finding out should be in node, link and the additional information of this layer demonstration, as shown in Figure 6,
1. access this node layer, additional information coordinate, represent with point at the coordinate place;
2. access this layer link range parameter { (x
1, y
1), (x
2, y
2) ... (x
n, y
n), (x
N+1, y
N+1), d} represents (x with point
1, y
1), (x
2, y
2) ... (x
n, y
n), (x
N+1, y
N+1), with broken line these points are linked up again and represent link;
3. show its place name on main node, link, important additional information next door with literal.
In the 3rd step, input user type of vehicle reads current date and time from clock circuit automatically; Access link traffic limited case parameter { 2 of links, forbidden type of vehicle, the forbidden start time, the forbidden concluding time } and { single file/forbidden, forbidden type of vehicle, the forbidden start time, the forbidden concluding time }, according to user's type of vehicle, current date and time, determine the traffic limited case of display layer, the link of one-way road replaces broken line with the broken line of band arrow in the present embodiment, two links that link to each other as forbidden to another from a link, replace point to show the node that connects these two links with star-like or other remarkable marks, when the user passes through touch-screen, mouse, when keyboard or other modes are inquired about this node, the big figure that shows this node adds " * " hollow arrow with the arrow place and represents to forbid to keep straight on, turn left, traffic restriction such as turn right is represented to allow to turn around with hollow arrow, scheme greatly as the demonstration of forbidding among Fig. 6 turning left, or the symbolic representation traffic with the standard traffic sign limits near node location at link, allow to turn around etc.
The 4th step accessed product/image advertising, showed the literal or the visual advertisement of product/image advertising on screen next door, as among Fig. 6 " today, you mended x? "
The 5th step, when customer requirements shows traffic, the traffic weight of representing link with the line of different brightness, different flash speed, different thicknesses or different color, each link can represent that with two identical or different lines the single line of also available that represent traffic situation weighted mean is represented according to the traffic weight of each direction.
The 6th step, after receiving the user coordinates that the locating module that adds is determined, form explicit user position and near the main additional information this coordinate, positioning advertising etc. with bright spot or colored bright spot or other distinctive marks, its manifestation mode can be: at the additional information place, positioning advertising coordinate place marks, marks, broadcasts with the rolling written form on the display screen next door or broadcast with the voice synthesized form with fixing written form on the next door of bright spot with the form of bright spot, point of scintillation or colored bright spot or other distinctive marks, as " buying xx, " among Fig. 6 to 100.
The 7th step, as receive customer requirements demonstration oneself after the instruction of which node, additional information or any bar link, displaing coordinate place the user marks customer location with bright spot, point of scintillation or colored bright spot or other distinctive marks, or mark user place link, present embodiment with this link integral body on the electronic chart place highlight, add black, flicker, one of colored, significant state, show that the user is on this link.The title that shows this node, link or additional information simultaneously is as the customer location that marks among Fig. 6.
The 8th step did not have to use the locating module that adds as the user, and electronic chart is the explicit user position not.Wish to show as the user, need the manually own position of input.Embodiment adopts following method input or retrieval user position, searches the starting point and the terminal point of route:
One, passes through geographical name retrieval.
(1), input searching object name.General by keyboard, configuration platform, terminal etc.
(2), compare.Searching object may be additional information, link, node, dummy node, float link or additional field information.At first the place name with all information in searching object name and the basal layer compares.At this moment following several situation may appear:
1), have and have only the place name of an information identical with the searching object name, can think that this information is exactly searching object.
2), have the place name of n＞1 information identical with the searching object name, present embodiment is set the information of searching object correspondence by two kinds of modes.First kind: the realm name that accesses last layer in the structure name of these information, inquiry successively: " are you the xxx (searching object name) that will retrieve xx (realm name 1)? the xxx (searching object name) of xx (realm name 2)? ... the still xxx (searching object name) of xx (realm name n)? second kind: access and show in the information declaratives that this information is the crossing; road, viaduct, overpass, the face shop, hospital, parameter Mi (the i=1 of government etc., n), inquiry successively: " will you retrieve xx (M1) xxx (searching object name)? xx (M2) xxx (searching object name)? ... or xx (Mn) xxx (searching object name)? also can two kinds of modes use simultaneously.The user therefrom selects the correct information that oneself will be sought.
3), do not have the place name of information identical with the searching object name, 1. repeat above-mentioned comparison procedure at high one deck.2. as still not having the place name of information identical, repeat above-mentioned comparison procedure in higher level with the searching object name.3. as maximum layer, still do not have the place name of information identical, show " information that can not find your retrieval " with the searching object name up to this electronic chart.
(3), because the user may be wrong to the title memory of searching object, also the place name of possibility electronic chart use is different with the searching object name of user's custom, present embodiment adopts fuzzy method to compare the place name of searching object name and information, when retrieving, 1. replace each word in the place name respectively with phonetically similar word less than user inquiring information; 2. the user imports the part that name is called place name; 3. the user imports title and place name some overlaps; 4. use the three kinds of methods in front simultaneously; Attempt.
Two, retrieve about the part of information type by the structure name and the parameter declaration part of information.
List the title in all each districts of electronic chart earlier, allow the user select searching object to be in which district, allow the user select the searching object type simultaneously: crossroad, viaduct, overpass, road, hospital, shop, government, post office, telecommunication bureau (agency), residential quarter, shopping centre etc.After the user selects the searching object type, can list the place name of the information of selected all specified type of distinguishing, allow the user select.The sub-district that also can allow the user further select to hang down one deck subregion is to reduce the place name that the user need select.
After the user is in which node, additional information or which bar link and is determined, this node or additional information coordinate are exactly user's displaing coordinate, as determining the user on certain link by manual input, present embodiment with the intermediate point of this link coordinates scope as user's displaing coordinate.
With the form of bright spot, point of scintillation or colored bright spot or other distinctive marks in displaing coordinate explicit user position, when the user is on certain bar link, present embodiment makes one of states such as this link integral body is in highlight on the electronic chart, it is black to add, flicker, colour, shows that the user is on this link.The title of explicit user place node, link or additional information simultaneously, is searched near the main additional information of coordinate user's displaing coordinate, positioning advertising etc., shows with said method.
The 9th step, when customer requirements inquiry circuit,
1), requires input starting point and terminal point.Can be according to customer requirements, use active user's coordinate, or active user place node, link or additional information be as starting point, also can import starting point coordinate or node, additional information, link name by the user, requires the user to import terminal point coordinate or node, additional information, link name simultaneously.
2), the inquiry user will inquire about the generic line circuit that still saves time most,
3), obtain beginning to calculate after above-mentioned two questions answer, after the result comes out, access and represent the coordinate of link on the way, with thick line, add black line, bright line, add bright line, multi-color cord or significantly form be presented on the electronic chart, as shown in Figure 6, or access the title of link on the way, explain circuit with explanatory note, also available synthetic video explanation circuit; And show this Route Length and the scheduled time of passing through.
The tenth step, search generic line or save time circuit main additional information, the positioning advertising on the link on the way most, if the user has used external positioning system, show with said method by user's displaing coordinate position, if the user does not use external positioning system, press the order of link on the way, according to the scheduled time of process link under existing traffic weight mode word demonstration positioning advertising to roll by screen.
The 11 step, when customer requirements is inquired about certain information state, as inquire about shop, hospital, government department etc., method with the 8th step retrieves this information earlier, mark this information at this information coordinate place again, demonstration to the generic line of this information and the circuit that saves time most, and shows the situations such as address, telephone number, service item and the scope of business of this information from the present position on screen next door.
In the 12 step,, or after indicating the zone that needs to show in detail by the input of keyboard, configuration platform, show with this position or zone to be following one deck electronic chart at center if the user double-clicks a certain position by touch-screen and mouse.
As shown in Figure 1, it has illustrated the method for making, display packing of electronic chart and in a flowchart to the relation of the retrieval of storage data.As shown in Figure 2, it represents a kind of enforcement structure of this electronic chart.Node, link, the parameter of additional information, layer-management information, upgrade information and calculation procedure are placed on memory block ROM, among the FLASH, DRAM has write down computation process and result and has shown and used data, display screen and voice output partly are used to show electronic chart, touch-screen and button are used for input coordinate, Query Information, starting point, terminal point etc., calendaring module is used for determining date and time, the high frequency transceiver module is used for receiving in real time the traffic weight, the upgrading electronic chart, send starting point, the terminal point and the circuit that saves time most, the circuit that the user selects etc., USB interface be used to upgrade and the information of exporting the electronic chart record to external equipment, GPS/LBS positioning system interface is used to connect GPS, external positioning system such as LBS.
Claims (9)
1, a kind of method for making of electronic chart comprises: the parameter → demonstration electronic chart that the layer-management information → setting of parameter → establishment, setting and the storing electronic map of node, link and the additional information of the electronic chart layering → setting electronic chart of the information classification that constitutes electronic chart → needs are made is organized into critical facility, unit information and advertising message in the electronic chart; Wherein, be that information with electronic chart is divided into frame information and additional information two classes to the information classification that constitutes electronic chart, frame information is for constituting the road information of electronic chart profile; Additional information is for constituting the geography information and the advertising message of electronic chart details, and described frame information is made up of node and link, and described additional information is made up of place name, coordinate, absolute name, classification and ad content, it is characterized in that further comprising the steps of,
The first step, the parameter of setting electronic chart:
1), to being distributed in each cell setting coordinate range parameter of every layer;
2), to the coordinate range parameter of node, link and additional information setting coarse;
3), node, link and additional information are set the precise coordinates range parameter;
4), to link setting traffic weight parameter;
5), to link and unsteady link setting from this link to each travelling of connected link mutually whether by the parameter of forbidden, forbidden vehicle and forbidden time;
6) whether be one-way road or forbidden line, forbidden vehicle and the parameter of forbidden time, to link and unsteady link setting;
7), to link and unsteady link setting road conditions coefficient;
8), the advertisement parameter is set in product/image advertising, to positioning advertising setting coordinate parameters;
In second step, the traffic weight that vehicle supervision department is issued stores in the storer of electronic chart;
The 3rd step, determine user coordinates by outside locating device, and compare with sub-district, node, additional information, link coordinates scope, successively in rough range and accurate scope, judge the concrete node in user place, link or additional information, when having determined that the user is on which node or additional information, the coordinate of this node or additional information is made as the displaing coordinate of user on electronic chart; When the user is in certain bar link center line (x
d, y
d) during the position, then with this position (x
d, y
d) be made as user's displaing coordinate; When user coordinates was not on above-mentioned node, link or additional information, then the user may depart from regular link, the output warning message, and user coordinates is made as displaing coordinate;
The 4th step, if the user is on certain link, store this link name, storage user arrive and leave this link time, store the traffic weight of this link on this direction, the title of this link is exportable to be stored in the distance pen recorder of motor vehicle;
If the user does not use outside locating device, ignored for the 3rd step and the 4th step;
The 5th goes on foot, and determines the starting point and the terminal point of search path,
Determine starting point: with the position as starting point, or input starting point coordinate, or select node, link and additional information as starting point;
Determine terminal point: the input terminal point coordinate, or select node, link and additional information as terminal point;
The 6th step, determine, search and the calculating generic line and the circuit that saves time most,
1), the layer that uses at present according to the user or the starting point of selecting according to the user and terminal point or the starting point of selecting according to the user and the relative position of terminal point, determine which layer search track at electronic chart;
2), after the employed layer of electronic chart is determined, at first determine the scope of search track, pass through the generic line of following parameter searching origin-to-destination then: by input user type of vehicle, by importing current date and time, by being in node and the link in the search area, by link traffic jam weight, traffic limited case and road conditions coefficient Z in the search area
i
3), zequin arrives the generic line of terminal point in such a way: by link in the search area and starting point, terminal point and node constitute a weighted and directed diagraph that does not have negative loop, starting point, terminal point and node are as the summit of weighted and directed diagraph, link constitutes the arc of weighted and directed diagraph, one way link constitutes an arc, two-way link constitutes the opposite arc of a pair of direction, as two internodal links more than one, one way link of then every increase, increase an arc, every increase by one two-way link increases a pair of arc, if certain direction of certain bar link is by forbidden, then represent the arc of this this direction of link in weighted and directed diagraph, not occur, calculate the shortest path of origin-to-destination in this weighted and directed diagraph with Graph-theoretical Approach, obtain generic line, in computation process, linkage length is the power of arc, and the traffic limited case constitutes the constraint condition of aforementioned calculation process;
4), as the above-mentioned the 3rd) do not find the generic line of origin-to-destination, enlarge search area, repeat the 2nd), the 3rd), up to the generic line of finding out origin-to-destination;
5), determine, search and calculate the circuit that saves time most, its step with determine, search with to calculate generic line identical, under the situation of not considering road, will be wherein " linkage length " be changed to " linkage length * traffic jam weight ", considering under the situation of road, will be wherein " linkage length " be changed to " linkage length * traffic jam weight * road conditions coefficient ";
6), after generic line and the circuit that saves time are most determined, use P1 respectively, V1, P2, V2 ..., Pm, Vm, PT, the form of LT is exported its result of calculation;
In the 7th step, storage generic line and the circuit that saves time most send starting point and endpoint information to vehicle supervision department, or send the circuit that selected circuit link name or the user's selection on the way that save time most travelled;
The 8th step, list generic line and the circuit that saves time most on the link name, retrieve electronic map historical record, the averaging time or the scheduled time of calculating these links of process under existing traffic weight, as can't directly calculating under existing traffic weight averaging time through a certain or some bar in the above-mentioned link, can calculate the averaging time under other traffic weights, method with interpolation converses under existing traffic weight, the averaging time of process this or these link, addition averaging time with all links of process under the existing traffic weight draws the scheduled time through this circuit;
The 9th step, if user no show destination still after after a while, electronic chart requires the user to redefine starting point and terminal point automatically, calculate the new generic line and the circuit that saves time most, if the user need recomputate, send new starting point and terminal point to vehicle supervision department, or send save time most circuit or user and select the circuit that travels.
2, the method for making of electronic chart according to claim 1 is characterized in that, the method for described node and additional information being set the accurate coordinates scope has following several:
Garden, ellipse, contain foursquare rectangle, polygon and combination thereof, the point that gathers on node that provides in order or the additional information border is used following parametric description respectively,
Garden: heart position, garden (x
0, y
0), radius r
0,
Oval: two focal position (x
1, y
1) and (x
2, y
2), longitudinal axis L,
Square and rectangle: the coordinate (x that is parallel to its center line two ends on one side
1, y
1) and (x
2, y
2), (length) square length of side a or length and width a, b just,
Polygon: the coordinate (x on summit
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n),
The combination of above-mentioned two kinds or multiple figure: figure can be overlapping, and figure also divides positive figure and negative patterning, and positive diagrammatic representation is subordinate's node or additional information in it, and negative nodal point represents that its inside does not belong to node or additional information;
The coordinate of densely covered point on node that provides successively in order or the additional information border: { (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n);
For the additional field information that several domain nodes are arranged, adopt following two kinds of methods to determine scope:
1), there is same scope the sub-district of whole additional field information representative, nearest from which domain node, which domain node is this part of sub-district just belong to;
2), piece that dividing into for a short time of additional field information representative is identical with domain node quantity, each piece comprises and only comprises a domain node, when the user is in this piece with this its position of domain node coordinate representation;
For the accurate scope of link, with the end points (x of one group of end to end n section broken line
1, y
1), (x
2, y
2) ... (x
n, y
n), (x
N+1, y
N+1) represent its center line, represent link width with d.
3, the method for making of electronic chart according to claim 1 is characterized in that, the method for described definite search track scope is divided into following steps,
1), is identified for the position of two points of specialized range, (x
b, y
b), (x
e, y
e);
2), extract two parameter: L and S, L is (x
b, y
b) and (x
e, y
e) between distance, S is the change value;
3), adopt one of following method to determine the scope of searching,
Garden: heart position, garden (x
0, y
0) and radius r
0, x
0=(x
b+ x
e)/2, y
0=(y
b+ y
e)/2, r
0=L/2+S,
Oval: two focal positions are (x
b, y
b), (x
e, y
e), major axis is L+2S,
Square and rectangle: (x
b, y
b) and (x
e, y
e) for being parallel to the coordinate of its center line two ends on one side, rectangular another length of side is 2S,
Rhombus: with (x
b, y
b), (x
e, y
e) be cornerwise a pair of summit, another diagonal angle line length 2S,
4), when needs enlarge search area, increase S, perhaps a kind of scope that redefines search of alternative from said method.
4, the method for making of electronic chart according to claim 1 is characterized in that, the method for described definite generic line is divided into following steps:
1), list all and starting point connected node and corresponding link, each link and other end node account for delegation,
2), for the 1st) new-found node of step and arrival link that this node passes through, retrieval traffic limited case, look into it and can arrive other nodes by which link, list the node of every circuit of such formation and arrival and calculate line length, for the node on the listed circuit, each bar circuit of this node of arrival and this node line length of listed arrival of comparing this new generation, shorter as listed line length, the circuit of ignoring new generation, otherwise the circuit that replaces arriving in the listed circuit this node with the shortest circuit of length in the new generation circuit, for listing the node that does not have in the circuit, newly produce in the circuit and to arrive the shortest circuit of this node ' s length and be put into and list in the circuit table;
3), for the 2nd) new-found node of step and the arrival link that this node passed through, verify listed circuit table, find out the link that can arrive other nodes, list these circuits and Route Length, to listing the node of circuit, compare each bar circuit of this new generation and listed the length on line midline road, replace having listed the circuit that arrives this node in the circuit with the shortest circuit of length, contain this node in certain bar circuit in the circuit table but be not the circuit last point as listing, relatively can last link arrive the former node of listing this node back in the circuit in the new line, if can get at and reach, replace the former circuit before this node in the circuit of listing with new line, otherwise keep original circuit constant, for listing the node that does not have in the circuit table, newly produce and arrive this node ' s length in the circuit, the shortest circuit is put into lists in the circuit table;
4), for the 3rd) go on foot new-found node, repeat the 3rd) step,
Repeat said process, appear at up to all nodes and terminal point and list in the circuit table, listed then that final node is the delegation of terminal point in the circuit table, be the generic line of origin-to-destination;
Determine two rules:
1. in the above-mentioned line length comparison procedure,, get and comprise the few circuit of node as two-lines road equal in length, also identical as two-lines circuit node number, then get a circuit at random;
2. when replacing having listed the circuit that arrives this node in the circuit table with the shortest circuit of length in the new generation circuit, list and contain this node in certain bar circuit in the circuit table but be not the circuit last point, in this case, can not arrive the node of having listed this node back in the original circuit of circuit table as last link in the new line, keep this original circuit constant, listed circuit and only change other, when this circuit is not generic line, can adopt following modification method: produce during a) next step calculates and arrive the shorter circuit of this node, and this circuit can arrive the former next node in the circuit table circuit of having listed, replaces having listed this node previous section of the original circuit of circuit table with new line; B) use all circuits, can arrive the generic line of having listed next node in the circuit table and replace having listed this node previous section of the original circuit of circuit table from starting point to this node;
5), as not finding the generic line of origin-to-destination, the expansion search area.
5, the method for making of electronic chart according to claim 1 is characterized in that, as user coordinates be (x, y), calculate user's displaing coordinate and judge further that with accurate scope the algorithm that the user specifically is on which node, link or the additional information is:
Garden: (x-x
0)
2+ (y-y
0)
2≤ r
0 2
Oval: ((x-x
0)
2+ (y-y
0)
2)
1/2+ ((x-x
0)
2+ (y-y
0)
2)
1/2≤ L
For rectangle (to square a=b), a=((x is arranged
2-x
1)
2+ (y
2-y
1)
2)
1/2Relation exist, differentiation is that one group of two inequality is set up simultaneously:
0≤(x-x
1)(x
2-x
1)/a+(y-y
1)(y
2-y
1)/a≤a
-b/2≤-(x-x
1)(y
2-y
1)/a+(y-y
1)(x
2-x
1)/a≤b/2
For n limit type, be respectively (x as its apex coordinate of counting counterclockwise from certain vertex
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n), then its differentiation is that one group of n inequality is set up simultaneously:
-(x-x
1)(y
2-y
1)/L
1+(y-y
1)(x
2-x
1)/L
1≥0
-(x-x
2)(y
3-y
2)/L
2+(y-y
2)(x
3-x
2)/L
2≥0
……
-(x-x
n-1)(y
n-y
n-1)/L
n-1+(y-y
n-1)(x
n-x
n-1)/L
n-1≥0
-(x-x
n)(y
1-y
n)/L
n+(y-y
n)(x
1-x
n)/L
n≥0
Wherein,
L
1＝((x
2-x
1)
2+(y
2-y
1)
2)
1/2
L
2＝((x
3-x
2)
2+(y
3-y
2)
2)
1/2
……
L
n-1＝((x
n-x
n-1)
2+(y
n-y
n-1)
2)
1/2
L
n＝((x
1-x
n)
2+(y
1-y
n)
2)
1/2
For the additional field information that a plurality of domain nodes are arranged, determine according to its scope method judges which domain node the user is in:
1. whole additional field information has same scope, and the domain node coordinate is respectively (x
1, y
1), (x
2, y
2) ... (x
N-1, y
N-1), (x
n, y
n), can compare that (x is y) apart from the distance ((x of each domain node
i-x)
2+ (y
i-y)
2)
1/2Size, i=1 wherein, 2 ..., n thinks that the user is in nearest domain node, and is all identical with several domain node distances as the user, can select one at random;
2. additional field information is divided into a plurality of scopes, each domain node is represented one, then can carry out the judgement of general node, additional information by the front;
When node, additional information can not be represented with above-mentioned garden, ellipse, rectangle (square) or salient angle polygon, and when needing to represent with above-mentioned multiple combination of shapes, available said method combination judges that criterion is that user coordinates is not in one of positive figure and in all negative patterning;
When node, additional information gather the coordinate of point on node that provides successively in order or additional information border when describing, its differentiation is:
1. can find two couples of consecutive point (x
I-1, y
I-1), (x
i, y
i) and (x
J-1, y
J-1), (x
j, y
j),
x
i-1≤x≤x
I，x
j-1≤x≤x
j
y
I-1≤ y≤y
J-1, y
i≤ y≤y
jPerhaps y
I-1〉=y 〉=y
J-1, y
i〉=y 〉=y
j
2. can find two couples of consecutive point (x
1-1, y
1-1), (x
1, y
1) and (x
K-1, y
K-1), (x
k, y
k),
x
1-1≤ x≤x
K-1, x
1≤ x≤x
kPerhaps x
1-1〉=x 〉=x
K-1, x
1〉=x 〉=x
k,
y
1-1≤y≤y
1，y
k-1≤y≤y
k，
3. above-mentioned two conditions must be set up simultaneously; For complex figure, even above-mentioned two conditions are set up simultaneously, the user also may not be in above-mentioned node or the additional information, and conversely, above-mentioned two conditions are false, and the user also may be in this node or additional information;
For the link of being made up of n bar broken line, then it is differentiated and to be n group inequality, stands as long as forms by one, organizes as i, just thinks that the user is on this link i section broken line:
-d/2≤-(x-x
1)(y
2-y
1)/L
1+(y-y
1)(x
2-x
1)/L
1≤d/2
0≤(x
2-x
1)(x-x
1)/L
1+(y
2-y
1)(y-y
1)/L
1≤L
1
(1)
-d/2≤-(x-x
2)(y
3-y
2)/L
2+(y-y
2)(x
3-x
2)/L
2≤d/2
0≤(x
3-x
2)(x-x
2)/L
2+(y
3-y
2)(y-y
2)/L
2≤L
2
(2)
……
-d/2≤-(x-x
n-1)(y
n-y
n-1)/L
n-1+(y-y
n-1)(x
n-x
n-1)/L
n-1≤d/2
0≤(x
n-x
n-1)(x-x
n-1)/L
n-1+(y
n-y
n-1)(y-y
n-1)/L
n-1≤L
n-1
(n-1)
-d/2≤-(x-x
n)(y
n+1-y
n)/L
n+(y-y
n)(x
n+1-x
n)/L
n≤d/2
0≤(x
n+1-x
n)(x-x
n)/L
n+(y
n+1-y
n)(y-y
n)/L
n≤L
n
(n)
Wherein,
L
1＝((x
2-x
1)
2+(y
2-y
1)
2)
1/2
L
2＝((x
3-x
2)
2+(y
3-y
2)
2)
1/2
……
L
n-1＝((x
n-x
n-1)
2+(y
n-y
n-1)
2)
1/2
L
n＝((x
n+1-x
n)
2+(y
n+1-y
n)
2)
1/2
6, the method for making of electronic chart according to claim 1 is characterized in that, the employing integrated circuit is definite with user's displaing coordinate, search area is determined, the shortest path search algorithm solidifies.
7, a kind of display packing of electronic chart is characterized in that being divided into following steps:
Which layer electronic chart be the first step determine to use;
Second step, access the type parameter of retrieval node, link and additional information, 1. finding out should be in the node and the additional information of this layer demonstration, and at the coordinate place with the point represent, 2. access this layer link range parameter, and link up with broken line and to represent, 3. show its place name with literal on the next door of main node, link and important additional information;
In the 3rd step, input user type of vehicle reads current date and time from clock circuit automatically; Access link traffic limited case parameter,, determine the traffic limited case and the demonstration of display layer according to user's type of vehicle, current date and time;
The 4th step accessed product/image advertising, showed the literal or the visual advertisement of product/image advertising on the screen next door;
The 5th step, when customer requirements shows traffic, the traffic weight of representing link with the line of different brightness, different flash speed, different thicknesses or different color, each link can represent that with two identical or different lines the single line of also available that represent traffic situation weighted mean is represented according to the traffic weight of each direction;
The 6th step, after receiving the user coordinates that outside locating device is determined, with form explicit user position and near the main additional information this coordinate, the positioning advertising etc. of bright spot, point of scintillation or colored bright spot or distinctive marks, its manifestation mode can be: at the additional information place, positioning advertising coordinate place marks, aside marks, broadcasts with the rolling written form or broadcast with the voice synthesized form on the next door of display screen with fixing written form with the form of bright spot, point of scintillation or colored bright spot or distinctive marks;
The 7th step, as receive customer requirements demonstration oneself after the instruction of which node, additional information or any bar link, displaing coordinate the user marks customer location, or mark user place link, or show the title of this node, link or additional information, simultaneously, search near the main additional information of user's displaing coordinate, positioning advertising and demonstration;
The 8th step, do not use outside locating device as the user, electronic chart is the explicit user position not, wish to show as the user, manually the position of input oneself is determined user's displaing coordinate and is shown that near main additional information, the positioning advertising the search user displaing coordinate also shows;
The 9th step, when customer requirements inquiry circuit, at first import starting point and terminal point, inquire that then the user will inquire about the generic line circuit that still saves time most, after obtaining above-mentioned two questions answer, begin to calculate, after calculating the result, show the generic line or the circuit that saves time most, or access the title of link on the way, explain circuit with explanatory note, also can explain circuit, when showing above-mentioned information, can show this Route Length and the scheduled time of passing through simultaneously by phonetic synthesis;
The tenth step, search generic line or circuit main additional information, the positioning advertising on the link on the way that save time most, if the user has used external positioning system, the user coordinates position by showing shows by said method; If the user does not use external positioning system, press the order of link on the way, according to through the scheduled time of link under existing traffic weight, accuse with the mode word demonstration location factory of rolling on the screen next door;
The 11 step, when customer requirements is inquired about certain information, retrieve this information earlier, mark this information at this information coordinate place again, demonstration to the generic line of this information or the circuit that saves time most, and shows the situations such as address, telephone number, service item and the scope of business of this information from the present position on screen next door;
In the 12 step,, or indicate the zone of demonstration in detail by keyboard, configuration platform after, show with this position or zone to be following one deck electronic chart at center if the user double-clicks a certain position by touch-screen or mouse.
8. the display packing of electronic chart according to claim 7, it is characterized in that, when showing the traffic limited case, the broken line of band arrow is represented the link of one-way road, at certain node place, if it is forbidden to another link from a link, then replace point to show this node with star-like or other remarkable marks, when the user passes through touch-screen, mouse, during this node of keyboard inquiry, the big figure that shows this node, the hollow arrow that adds " * " with the arrow place is represented to forbid to keep straight on, turn left, traffic restriction such as turn right is represented to allow to turn around with hollow arrow, or at link near the symbolic representation traffic restriction of node location with the standard traffic sign, allow to turn around etc.;
During the explicit user position, be on certain bar link, make this link integral body be in highlight, add black, flicker, one of colored, significant state, show that the user is on this link as the user.
9. the display packing of electronic chart according to claim 7, it is characterized in that, when the user manually imports starting point, terminal point or retrieving information, place name as all information in title and the electronic chart of input is all inconsistent, retrieves with fuzzy method: 1. replace each word in the place name respectively with phonetically similar word; 2. the user imports the part that name is called place name; 3. the user imports title and place name some overlaps; 4. use the three kinds of methods in front simultaneously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02130885 CN1257469C (en) | 2002-10-16 | 2002-10-16 | Method for preparing electronic maps and display method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02130885 CN1257469C (en) | 2002-10-16 | 2002-10-16 | Method for preparing electronic maps and display method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1480867A true CN1480867A (en) | 2004-03-10 |
| CN1257469C CN1257469C (en) | 2006-05-24 |
Family
ID=34144672
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 02130885 Expired - Fee Related CN1257469C (en) | 2002-10-16 | 2002-10-16 | Method for preparing electronic maps and display method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1257469C (en) |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009018763A1 (en) * | 2007-08-03 | 2009-02-12 | Suzhou Industrial Park Linkerinfo Ltd. | Method for loading advertisement in electronic map |
| CN101192219B (en) * | 2006-11-22 | 2011-02-02 | 致伸科技股份有限公司 | Electronic map display system using electronic map and the method |
| CN102033940A (en) * | 2010-12-21 | 2011-04-27 | 郑州峰华电子有限责任公司 | Traffic stream shortest path querier |
| CN101925941B (en) * | 2008-03-26 | 2012-03-28 | 三菱电机株式会社 | Map data creating device and map drawing device |
| CN101739498B (en) * | 2009-12-10 | 2012-05-23 | 西安煤航信息产业有限公司 | Method for accurately designing and building ArcGIS symbol library |
| CN102506849A (en) * | 2011-09-28 | 2012-06-20 | 浙江大学 | Method for optimizing shortest path with restraint |
| CN101847339B (en) * | 2009-03-27 | 2012-07-04 | 北京四维图新科技股份有限公司 | Topology information generating method and device for road network of electronic map |
| CN102770907A (en) * | 2010-02-23 | 2012-11-07 | 三菱电机株式会社 | Map scrolling device |
| CN102915348A (en) * | 2012-09-27 | 2013-02-06 | 北京百度网讯科技有限公司 | Method and system for recommending search information to user in map |
| CN103021257A (en) * | 2012-12-04 | 2013-04-03 | 北京世纪高通科技有限公司 | Method and apparatus for generating electronic map |
| CN103049465A (en) * | 2011-10-12 | 2013-04-17 | 富士施乐株式会社 | Information processing apparatus, information processing method, and computer readable medium storing program |
| CN102177495B (en) * | 2008-10-14 | 2013-08-07 | 中石滋雄 | Electronic nomogram, method for displaying electronic nomogram |
| CN103279524A (en) * | 2013-05-29 | 2013-09-04 | 浙江搜车客网络技术有限公司 | Searching and sequencing method of vehicle source information of second-hand vehicles based on geocoding |
| CN103593712A (en) * | 2013-11-01 | 2014-02-19 | 中国电子科技集团公司第十五研究所 | Resource optimization dispatching system and dispatching method |
| CN103714195A (en) * | 2012-10-08 | 2014-04-09 | 国际商业机器公司 | Method and system for mapping infrastructure layout between non-corresponding datasets |
| CN104035950A (en) * | 2013-03-05 | 2014-09-10 | 多费俉株式会社 | User-based Map Manufacturing Apparatus |
| CN104765803A (en) * | 2015-03-30 | 2015-07-08 | 王喆平 | Drawing method and device of electronic map |
| CN104992616A (en) * | 2015-07-31 | 2015-10-21 | 小米科技有限责任公司 | Map display method and device thereof |
| CN105091888A (en) * | 2014-04-30 | 2015-11-25 | 环达电脑(上海)有限公司 | Navigation apparatus and method for updating map data of same |
| CN101930665B (en) * | 2009-06-23 | 2016-08-17 | 宏达国际电子股份有限公司 | The method of display transport information and electronic installation |
| CN106457043A (en) * | 2014-04-15 | 2017-02-22 | 金.Com有限公司 | Device, game and methods therefore |
| CN107238775A (en) * | 2017-05-24 | 2017-10-10 | 中国电子科技集团公司第四十研究所 | A kind of channel status colour code method |
| CN111226254A (en) * | 2017-07-10 | 2020-06-02 | 埃奈迪斯公司 | Reliability of network maps |
| CN111383446A (en) * | 2018-12-28 | 2020-07-07 | 西安四维图新信息技术有限公司 | Method and equipment for making electronic map road information |
| CN113494926A (en) * | 2021-09-06 | 2021-10-12 | 深圳慧拓无限科技有限公司 | Path finding method, device and equipment |
-
2002
- 2002-10-16 CN CN 02130885 patent/CN1257469C/en not_active Expired - Fee Related
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101192219B (en) * | 2006-11-22 | 2011-02-02 | 致伸科技股份有限公司 | Electronic map display system using electronic map and the method |
| WO2009018763A1 (en) * | 2007-08-03 | 2009-02-12 | Suzhou Industrial Park Linkerinfo Ltd. | Method for loading advertisement in electronic map |
| CN101925941B (en) * | 2008-03-26 | 2012-03-28 | 三菱电机株式会社 | Map data creating device and map drawing device |
| CN102177495B (en) * | 2008-10-14 | 2013-08-07 | 中石滋雄 | Electronic nomogram, method for displaying electronic nomogram |
| CN101847339B (en) * | 2009-03-27 | 2012-07-04 | 北京四维图新科技股份有限公司 | Topology information generating method and device for road network of electronic map |
| CN101930665B (en) * | 2009-06-23 | 2016-08-17 | 宏达国际电子股份有限公司 | The method of display transport information and electronic installation |
| CN101739498B (en) * | 2009-12-10 | 2012-05-23 | 西安煤航信息产业有限公司 | Method for accurately designing and building ArcGIS symbol library |
| CN102770907A (en) * | 2010-02-23 | 2012-11-07 | 三菱电机株式会社 | Map scrolling device |
| CN102770907B (en) * | 2010-02-23 | 2014-12-03 | 三菱电机株式会社 | Map scrolling device |
| CN102033940B (en) * | 2010-12-21 | 2012-08-08 | 郑州峰华电子有限责任公司 | Traffic stream shortest path querier |
| CN102033940A (en) * | 2010-12-21 | 2011-04-27 | 郑州峰华电子有限责任公司 | Traffic stream shortest path querier |
| CN102506849A (en) * | 2011-09-28 | 2012-06-20 | 浙江大学 | Method for optimizing shortest path with restraint |
| CN102506849B (en) * | 2011-09-28 | 2013-10-23 | 浙江大学 | Method for optimizing shortest path with restraint |
| CN103049465A (en) * | 2011-10-12 | 2013-04-17 | 富士施乐株式会社 | Information processing apparatus, information processing method, and computer readable medium storing program |
| CN102915348A (en) * | 2012-09-27 | 2013-02-06 | 北京百度网讯科技有限公司 | Method and system for recommending search information to user in map |
| CN102915348B (en) * | 2012-09-27 | 2015-09-09 | 北京百度网讯科技有限公司 | Recommend the method and system of search information to user in map |
| CN103714195A (en) * | 2012-10-08 | 2014-04-09 | 国际商业机器公司 | Method and system for mapping infrastructure layout between non-corresponding datasets |
| US10424092B2 (en) | 2012-10-08 | 2019-09-24 | International Business Machines Corporation | Mapping infrastructure layout between non-corresponding datasets |
| US9928620B2 (en) | 2012-10-08 | 2018-03-27 | International Business Machines Corporation | Mapping infrastructure layout between non-corresponding datasets |
| CN103714195B (en) * | 2012-10-08 | 2017-07-07 | 国际商业机器公司 | The method and system drawn to infrastructure layout between non-corresponding data collection |
| US9552372B2 (en) | 2012-10-08 | 2017-01-24 | International Business Machines Corporation | Mapping infrastructure layout between non-corresponding datasets |
| CN103021257B (en) * | 2012-12-04 | 2015-06-10 | 北京世纪高通科技有限公司 | Method and apparatus for generating electronic map |
| CN103021257A (en) * | 2012-12-04 | 2013-04-03 | 北京世纪高通科技有限公司 | Method and apparatus for generating electronic map |
| CN104035950A (en) * | 2013-03-05 | 2014-09-10 | 多费俉株式会社 | User-based Map Manufacturing Apparatus |
| CN103279524A (en) * | 2013-05-29 | 2013-09-04 | 浙江搜车客网络技术有限公司 | Searching and sequencing method of vehicle source information of second-hand vehicles based on geocoding |
| CN103593712A (en) * | 2013-11-01 | 2014-02-19 | 中国电子科技集团公司第十五研究所 | Resource optimization dispatching system and dispatching method |
| CN106457043A (en) * | 2014-04-15 | 2017-02-22 | 金.Com有限公司 | Device, game and methods therefore |
| CN105091888A (en) * | 2014-04-30 | 2015-11-25 | 环达电脑(上海)有限公司 | Navigation apparatus and method for updating map data of same |
| CN104765803A (en) * | 2015-03-30 | 2015-07-08 | 王喆平 | Drawing method and device of electronic map |
| CN104992616A (en) * | 2015-07-31 | 2015-10-21 | 小米科技有限责任公司 | Map display method and device thereof |
| CN107238775A (en) * | 2017-05-24 | 2017-10-10 | 中国电子科技集团公司第四十研究所 | A kind of channel status colour code method |
| CN107238775B (en) * | 2017-05-24 | 2019-06-18 | 中国电子科技集团公司第四十一研究所 | A kind of channel status color identifier method |
| CN111226254A (en) * | 2017-07-10 | 2020-06-02 | 埃奈迪斯公司 | Reliability of network maps |
| CN111383446A (en) * | 2018-12-28 | 2020-07-07 | 西安四维图新信息技术有限公司 | Method and equipment for making electronic map road information |
| CN113494926A (en) * | 2021-09-06 | 2021-10-12 | 深圳慧拓无限科技有限公司 | Path finding method, device and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1257469C (en) | 2006-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1257469C (en) | Method for preparing electronic maps and display method | |
| CN101053001A (en) | Map information updating device and map information updating method | |
| CN1300554C (en) | Mutual navigation system | |
| CN1267705C (en) | Guidance system and setting up method and program of same | |
| CN1181316C (en) | Pedestrian information providing system, its memory device and pedestrian information processor | |
| CN1576789A (en) | Device, system, method and program for notifying traffic condition and recording medium storing the program | |
| CN1614356A (en) | Traffic-condition notifying device, its system, its method, its program and recording medium storing the program | |
| CN1095107C (en) | Mobile navigation system | |
| CN1105902C (en) | Reading machine and recording medium and transmitting method of road map information | |
| CN1560784A (en) | Map, geographic information providing system and describing method and deformed map generating device | |
| CN1536514A (en) | Route searching method of navigation device and communication information display method | |
| CN1115649C (en) | Image output device | |
| CN1940912A (en) | Document production system, document production method, program, and storage medium | |
| CN1550756A (en) | Process time counting method for navigation equipment and traffic information displaying method | |
| CN1656522A (en) | Road information providing system and device, and road information generation method | |
| CN1109325C (en) | On-vehicle path guide apparatus and path search method | |
| CN1611918A (en) | Device, system and method for reporting a traffic condition and program and recording medium | |
| CN1211765C (en) | Three-dimension picture and target display apparatus and method, and nevigation apparatus using said method | |
| CN1601228A (en) | Navigation apparatus | |
| CN1647130A (en) | E-learning course editor | |
| CN1338088A (en) | Device and method for creating and using data on road map expressed by polygons | |
| CN1627044A (en) | Guiding device, system thereof, method thereof, program thereof and recording medium | |
| CN1756188A (en) | Large-scale network topology graphics display method | |
| CN1499399A (en) | Map and updating instruction information data structure, map information processing and providing device | |
| CN1959759A (en) | Traffic analysis method based on fluctuated data of vehicles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20060524 Termination date: 20101016 |