CN106997056A - A kind of scenic spot intelligent guidance system based on hand-drawing map - Google Patents

A kind of scenic spot intelligent guidance system based on hand-drawing map Download PDF

Info

Publication number
CN106997056A
CN106997056A CN201710342331.7A CN201710342331A CN106997056A CN 106997056 A CN106997056 A CN 106997056A CN 201710342331 A CN201710342331 A CN 201710342331A CN 106997056 A CN106997056 A CN 106997056A
Authority
CN
China
Prior art keywords
map
summit
gps
distance
shortest path
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.)
Pending
Application number
CN201710342331.7A
Other languages
Chinese (zh)
Inventor
陈勇
刘敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Polytron Technologies Inc Travel
Original Assignee
Polytron Technologies Inc Travel
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Polytron Technologies Inc Travel filed Critical Polytron Technologies Inc Travel
Priority to CN201710342331.7A priority Critical patent/CN106997056A/en
Publication of CN106997056A publication Critical patent/CN106997056A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S19/00Satellite radio beacon positioning systems; Determining position, velocity or attitude using signals transmitted by such systems
    • G01S19/38Determining a navigation solution using signals transmitted by a satellite radio beacon positioning system
    • G01S19/39Determining a navigation solution using signals transmitted by a satellite radio beacon positioning system the satellite radio beacon positioning system transmitting time-stamped messages, e.g. GPS [Global Positioning System], GLONASS [Global Orbiting Navigation Satellite System] or GALILEO
    • G01S19/42Determining position
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30Map- or contour-matching
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3407Route searching; Route guidance specially adapted for specific applications

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Navigation (AREA)

Abstract

A kind of scenic spot intelligent guidance system based on hand-drawing map, including the engineer's scale module for being adapted to dimension of picture, GPS and map mapping block, the computing module of minimal path are obtained, wherein:User can just draw the engineer's scale corresponding to intelligent terminal dimension of picture by the actual range for comparing map range Yu being obtained according to GPS information;The mapping blocks of GPS on the electronic map:User is in navigation procedure, by obtaining GPS position information, is then labeled according to mapping relations on map, it is possible to realize basic navigation function;The mapping blocks of GPS on the electronic map are improved based on Dijkstra, make it to record source point to all shortest paths of arbitrfary point.

Description

A kind of scenic spot intelligent guidance system based on hand-drawing map
Technical field:
The present invention relates to a kind of intelligent scenic region navigation technology based on mobile Internet, Freehandhand-drawing is based on more particularly, to one kind The scenic spot intelligent guidance system of map.
Background technology
" 12 " planning point out to greatly develop domestic travel, walk connotation analysis road, realize speed, structure, quality, Benefit, science and technology, network are mutually unified, and lift technicalization, the level of IT application of tourism development.For the national tourist culture office political affairs of response Plan, can not intelligent navigation in the case that the uneven service deficiency of solution scenic spot guide explanation quality, solution scenic spot route are a lot Function, the step of power-assisted scenic spot one is striden into the mobile Internet epoch.Lighter, more convenient, more comfortable trip is made for visitor Mode.
Although there are some products for providing tourist service in the market, these navigational tools there is no The coordination of method cost of implementation and function, for small scenic spot, how low cost input on the premise of bring high property as far as possible The experience of energy is particularly important.Some current main navigational tools can not all realize the navigation to small scenic spot well, for example, The more New function of Gologe maps is poor, and Baidu's cell phone map section coarse, mark of description is not obvious, and they are to these small scenic spots Road description it is not careful.Small Scene Tourist is generally to be easy to occur the mistake on route, causes to can not find destination, very Got lost in tourism way, not only expend the time, it is also possible to be in peril of one's life.So, the present invention can not only reduce above-mentioned feelings The generation of condition, also facilitates visitor and plays.
The content of the invention
In order to solve the deficiencies in the prior art, the invention provides a kind of scenic spot intelligent navigation system based on hand-drawing map System.
A kind of scenic spot intelligent guidance system based on hand-drawing map of the present invention uses following technical scheme:
A kind of scenic spot intelligent guidance system based on hand-drawing map, including obtain be adapted to dimension of picture engineer's scale module, The mapping block of GPS and map, the computing module of minimal path, wherein:
Obtain the engineer's scale module for being adapted to dimension of picture:User in a confirmable position such as scenic spot porch, A mark is done in corresponding position on picture simultaneously, and program records GPS position information herein;First point is indicated Afterwards, user is moved to next confirmable position, and corresponding point is equally marked on picture, and program can also be recorded herein GPS position information, by the actual range for comparing map range Yu being obtained according to GPS information can just draw corresponding to intelligence The engineer's scale of terminal dimension of picture;
The mapping blocks of GPS on the electronic map:User is in navigation procedure, by obtaining GPS position information, Ran Hougen It is labeled according to mapping relations on map, it is possible to realize basic navigation function;
The computing module of minimal path:If G=(V, E) is a Weighted Directed Graph, vertex set V in figure is divided into two Group, first group is the vertex set for having obtained shortest path, and the collection shares S and represented, only one of which source point in S when initial, after A shortest path is often tried to achieve, just be will be added in set S, until whole summits are all added in S, algorithm just finishes;The Two groups do not determine the vertex set of shortest path for remaining, are represented with U, by the increasing order of shortest path length successively second The summit of group is added in S;During addition, in always keeping from source point v to S the shortest path length on each summit be not more than from The shortest path length on any summit in source point v to U;In addition, the distance on summit in each one distance of vertex correspondence, S is just The distance on the summit in the shortest path length from v to this summit, U, be from v only include S to this summit in summit be Between summit current shortest path length.
Further, the mapping blocks of GPS on the electronic map are specially:Two marked when user starts are obtained first The pixel coordinate of point:(PX1, PY1) and (PX2, PY2), and this 2 points to gps coordinate:(Log1, Lat1) and (Log2, Lat2), x-axis direction correspondence longitude, Y direction corresponding latitude, so obtaining longitude density and the Y-axis in X-direction on picture Latitude density on direction, you can the formula of export longitude and latitude to pixel, and coordinate is retouched on map, error ten meters with It is interior.
Further, the calculating process of the mapping blocks of GPS on the electronic map is as follows:
Precision density and latitude density are calculated first:
X=abs ((PX1-PX2)/(Log1-Log2))
Y=abs ((PY1-PY2)/(Lat1-Lat2))
Then converted for gps coordinate and pixel can be just realized, GPS point is depicted on map, formula is as follows:
Final_X=(lo-Longitudel) * X+PX1
Final_Y=PY1- (1a-Latitudel) * Y.
Further, the algorithm steps of the computing module of minimal path:
(1) when initial, S only includes source point, i.e. S={ v }, and v distance is 0.U includes other summits in addition to v, i.e.,:U= { remaining summit }, if summit u has side in v and U,<U, v>Normally there are weights, if u, which is not v, goes out side abutment points,<U, v>Power It is worth for ∞;
(2) one is chosen from U apart from summit k minimum v, k, in addition S, the selected distance be exactly v to k most Short path length;
(3) using k as the intermediate point newly considered, the distance on each summit in modification U;If from source point v to summit u distance than former Apart from short, then to change summit u distance value, the summit k of amended distance value distance is plus the power on side;
(4) repeat step b and c is until all summits are included in S.
In recent years, significantly improving with rapid development of economy and people's quality of life, tourist industry has been developed rapidly Come.Annual 4400000000 person-times of domestic tourist in 2016, increases by 11.2%, 3,939,000,000,000 yuan of revenue from domestic tourism increases than last year 15.2%, people's tourism enthusiasm it is lasting surging, visitor's number is also being continuously increased, tourist industry has welcome unprecedented development machine Meeting.The tourism pressure excessively brought with Famous sceneries visitor's number is increasingly weighed, and the tourism idea of people has changed, and is started Little by little tend to the tourism at small scenic spot, this allow for tourist attractions it is not familiar become in visitor's tourism way main ask Topic.It is of course possible to which the guide service pattern at large-scale scenic spot is indiscriminately imitated, it is done so that not only waste of resource, and cost compared with Height, has then occurred as soon as contradiction between the development of tourist industry and the actual demand of visitor, and this also brings to tourist service industry simultaneously Huge pressure.Trip tourist guide guide to visitors APP, high-quality from scenic spot and visitor's angle there is provided high standard at once Travel service.Provided a great convenience to visitor's trip.
Brief description of the drawings:
Fig. 1 is a kind of structural representation of scenic spot intelligent guidance system based on hand-drawing map of the present invention.
Embodiment:
A kind of scenic spot intelligent guidance system based on hand-drawing map of the present invention is done into one with reference to Figure of description Step detailed description.
A kind of scenic spot intelligent guidance system based on hand-drawing map of the present invention, including algorithm main flow module, the master Process module is divided into three big modules, respectively obtain the engineer's scale module for being adapted to dimension of picture, GPS and map mapping block, Some key issues being related to during exploitation will be explained in detail by the computing module of minimal path herein.Under Figure is that scenic region navigation realizes block diagram, and each process is directed to the processing of some key issues.
Wherein:
First, the engineer's scale module for being adapted to dimension of picture is obtained:
The acquisition of engineer's scale is also vital to scenic region navigation, although engineer's scale may be marked on the tourist map of scenic spot, But that engineer's scale is made according to the size of true tourist map, want to be led using tourist map photo in mobile terminal Boat is, it is necessary to obtain the engineer's scale of suitable photo size.It can all mark and believe known to doorway, famous sites etc. on the tourist map of scenic spot Breath, can point out user to assist to obtain engineer's scale.Method is as follows:
User is in a confirmable position such as scenic spot porch, while a mark is done in corresponding position on picture Note, program records GPS position information herein;Indicate after first point, user is moved to next confirmable position Put, corresponding point is equally marked on picture, program can also record GPS position information herein.Certain user can basis The multiple mark position of aforesaid way makes engineer's scale more accurate, requires that user tries one's best here and takes the air line, to facilitate map range Acquisition, reduce error improve precision.It can just be drawn by comparing actual range of the map range with being obtained according to GPS information Corresponding to the engineer's scale of intelligent terminal dimension of picture.Because this navigation system supports the amplification and diminution to picture, change every time The all amplification and diminution of comparative example chi progress in proportion, so ensure that the accurate of map scale during dimension of picture.With Upper is exactly the processing procedure of engineer's scale problem.
2nd, the mapping blocks of GPS on the electronic map:
User is in navigation procedure, by obtaining GPS position information, then according to mapping relations in the enterprising rower of map Note, it is possible to realize basic navigation function.The plan that this navigation system is used for the mapping of GPS and electronic map is explained below Omit and algorithm.
The gps coordinate conversion regime commonly used at present in mapping, error precision is only Centimeter Level, and transfer process is as follows:First It is (x, y) that (L, B), which is passed through Guass plane projection, is operated by rotation, translation, scaling etc. and is further converted into (xt, yt), most It is afterwards (Px, Py) according to scale change.Amount of calculation is larger needed for Guass plane projection wherein in the first step, when program is run Between it is longer, and there is very big gap in calculating speed due to mobile device with computer, and the operational efficiency of mobile device is very low, makes Obtain Guass plane projection method and be not suitable for mobile device.And because the navigation system object is to be navigated in zonule, pass through Checking computations, regard GPS as errors that plane directly carries out engineer's scale conversion within ten meters, belong to acceptable scope, therefore, Directly proportion of utilization chi is changed herein.
The pixel coordinate of two points marked when user starts is obtained first:(PX1, PY1) and (PX2, PY2), and this 2 points to gps coordinate:(Log1, Lat1) and (Log2, Lat2).By analysis, x-axis direction correspondence longitude, Y-axis on picture Direction corresponding latitude, so obtaining the latitude density in longitude density and the Y direction in X-direction, you can export longitude and latitude Retouched to the formula of pixel, and by coordinate on map, error is within ten meters.Calculating process is as follows:
Precision density and latitude density are calculated first:
X=abs ((PX1-PX2)/(Log1-Log2))
Y=abs ((PY1-PY2)/(Lat1-Lat2))
Then converted for gps coordinate and pixel can be just realized, GPS point is depicted on map, formula is as follows:
Final_X=(lo-Longitudel) * X+PX1
Final_Y=PY1- (1a-Latitudel) * Y
3rd, the computing module of minimal path
Dijkstra is to solve the problems, such as signal source shortest path, and most basic algorithm is only capable of obtaining the length of shortest path Degree, and outgoing route is unable to, the present invention is improved based on Dijkstra, makes it record source point to all most short of arbitrfary point Path.
Arthmetic statement
Algorithm idea:If G=(V, E) is a Weighted Directed Graph, vertex set V in figure is divided into two groups, first group is The vertex set for having obtained shortest path (represents that only one of which source point in S when initial often tries to achieve a shortest path later with S Footpath, just will be added in set S, and until whole summits are all added in S, algorithm just finishes), second group does not determine for remaining Second group of summit, S is added by the increasing order of shortest path length by the vertex set (being represented with U) of shortest path successively In.During addition, appoint during the shortest path length on each summit is not more than from source point v to U in always keeping from source point v to S The shortest path length on what summit.In addition, the distance on the summit in one distance of each vertex correspondence, S is exactly from v to this summit Shortest path length, the distance on the summit in U, be from v only include S to this summit in summit for intermediate vertex it is current most Short path length.
Algorithm steps:
A. when initial, S only includes source point, i.e. S={ v }, and v distance is 0.U includes other summits in addition to v, i.e.,:U= { remaining summit }, if summit u has side in v and U,<U, v>Normally there are weights, if u, which is not v, goes out side abutment points,<U, v>Power It is worth for ∞.
B. one is chosen from U apart from summit k minimum v, k, in addition S (the selected distance be exactly v to k most Short path length).
C. using k as the intermediate point newly considered, the distance on each summit in modification U;If the distance from source point v to summit u (is passed through Summit k) than original distance (it is short without summit k), then change summit u distance value, the summit k of amended distance value away from From plus the power on side.
D. repeat step b and c is until all summits are included in S.
3. algorithm examples
A non-directed graph is first provided, as shown in Figure 1:
The signal source shortest path step found out with dijkstra's algorithm using A as starting point is as follows:
Model application --- from scenic spot and visitor's angle analysis exemplified by swimming tourist guide APP at once, trip guide leads at once Look at APP, brought great convenience to visitor's trip.
From scenic spot angle From visitor's angle
Standardization, high-quality, lifting service image Low consumption
Increase visitor and scenic spot viscosity It is easy to operate
Respond national policy It is feature-rich, experience excellent
It should be pointed out that the above is enumerating for the preferred forms of the present invention, wherein not being described in detail to the greatest extent Part, it is understood that be practiced with the general fashion of the art.Simultaneously for those of ordinary skill in the art For, the equivalent transformation done in the scope without departing from the present invention to the present invention and modification fall within the present invention's Within scope of the claims.

Claims (4)

1. a kind of scenic spot intelligent guidance system based on hand-drawing map, it is characterised in that:It is adapted to the ratio of dimension of picture including obtaining Mapping block, the computing module of minimal path of example chi module, GPS and map, wherein:
Obtain the engineer's scale module for being adapted to dimension of picture:User is in a confirmable position such as scenic spot porch, simultaneously A mark is done in corresponding position on picture, and program records GPS position information herein;Indicate after first point, used Family is moved to next confirmable position, and corresponding point is equally marked on picture, and program can also record GPS herein Positional information, can just be drawn corresponding to intelligent terminal by the actual range for comparing map range Yu being obtained according to GPS information The engineer's scale of dimension of picture;
The mapping blocks of GPS on the electronic map:User is in navigation procedure, by obtaining GPS position information, and then basis is reflected Penetrate relation to be labeled on map, it is possible to realize basic navigation function;
The computing module of minimal path:If G=(V, E) is a Weighted Directed Graph, vertex set V in figure is divided into two groups, One group is the vertex set for having obtained shortest path, and the collection shares S and represented, only one of which source point in S, is often tried to achieve later when initial One shortest path, just will be added in set S, and until whole summits are all added in S, algorithm just finishes;Second group is Remaining does not determine the vertex set of shortest path, is represented with U, by the increasing order of shortest path length successively second group of top Point is added in S;During addition, the shortest path length on each summit is not more than from source point v in always keeping from source point v to S The shortest path length on any summit into U;In addition, the distance on the summit in one distance of each vertex correspondence, S is exactly from v To the shortest path length on this summit, the distance on the summit in U, be from v only include S to this summit in summit be intermediate vertex Current shortest path length.
2. a kind of scenic spot intelligent guidance system based on hand-drawing map as claimed in claim 1, it is characterised in that:GPS is in electricity Mapping block on sub- map is specially:The pixel coordinate of two points marked when user starts is obtained first:(PX1, PY1) and (PX2, PY2), and this 2 points to gps coordinate:X-axis direction correspondence on (Log1, Lat1) and (Log2, Lat2), picture Longitude, Y direction corresponding latitude, so obtaining the latitude density in longitude density and the Y direction in X-direction, you can lead Go out longitude and latitude to retouch on map to the formula of pixel, and by coordinate, error is within ten meters.
3. a kind of scenic spot intelligent guidance system based on hand-drawing map as claimed in claim 2, it is characterised in that:GPS is in electricity The calculating process of mapping block on sub- map is as follows:
Precision density and latitude density are calculated first:
X=abs ((PX1-PX2)/(Log1-Log2))
Y=abs ((PY1-PY2)/(Lat1-Lat2))
Then converted for gps coordinate and pixel can be just realized, GPS point is depicted on map, formula is as follows:
Final_X=(lo-Longitudel) * X+PX1
Final_Y=PY1- (la-Latitudel) * Y.
4. a kind of scenic spot intelligent guidance system based on hand-drawing map as claimed in claim 1, it is characterised in that:Minimal path Computing module algorithm steps:
(1) when initial, S only includes source point, i.e. S={ v }, and v distance is 0;U includes other summits in addition to v, i.e.,:U={ its Remaining summit }, if summit u has side in v and U,<U, v>Normally there are weights, if u, which is not v, goes out side abutment points,<U, v>Weights For ∞;
(2) one is chosen from U apart from summit k minimum v, k, is added in S, the selected distance is exactly v to k shortest path Electrical path length;
(3) using k as the intermediate point newly considered, the distance on each summit in modification U;If from source point v to summit u distance than it is original away from From short, then summit u distance value is changed, the summit k of amended distance value distance is plus the power on side;
(4) repeat step b and c is until all summits are included in S.
CN201710342331.7A 2017-05-15 2017-05-15 A kind of scenic spot intelligent guidance system based on hand-drawing map Pending CN106997056A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710342331.7A CN106997056A (en) 2017-05-15 2017-05-15 A kind of scenic spot intelligent guidance system based on hand-drawing map

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710342331.7A CN106997056A (en) 2017-05-15 2017-05-15 A kind of scenic spot intelligent guidance system based on hand-drawing map

Publications (1)

Publication Number Publication Date
CN106997056A true CN106997056A (en) 2017-08-01

Family

ID=59434450

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710342331.7A Pending CN106997056A (en) 2017-05-15 2017-05-15 A kind of scenic spot intelligent guidance system based on hand-drawing map

Country Status (1)

Country Link
CN (1) CN106997056A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107844523A (en) * 2017-10-12 2018-03-27 江苏鸿信系统集成有限公司 The position converting system of double coordinate-systems based on GPS and hand-drawing map
CN108763587A (en) * 2018-06-12 2018-11-06 广州市驴迹科技有限责任公司 The method and system that hand-drawing map is overlapped with electronic map
CN110516018A (en) * 2019-08-05 2019-11-29 山东开创云软件有限公司 A kind of the electronics method for drafting and device in river
CN111102974A (en) * 2019-12-20 2020-05-05 柴日发 System and method for realizing tour guide based on hand-drawing map photo of mobile phone
CN112037307A (en) * 2020-09-15 2020-12-04 恒瑞通(福建)信息技术有限公司 Method and terminal for drawing and positioning map picture

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102915310A (en) * 2011-08-03 2013-02-06 中国移动通信集团公司 Generating method of electronic maps, navigation method and navigation device
CN103366634A (en) * 2012-03-28 2013-10-23 嘉兴佳利电子股份有限公司 Seamless connection method for inserting picture into electronic map
CN104713544A (en) * 2013-12-13 2015-06-17 中国移动通信集团公司 Location information display method and equipment
CN105354633A (en) * 2015-10-26 2016-02-24 努比亚技术有限公司 Transportation route calculation system and method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102915310A (en) * 2011-08-03 2013-02-06 中国移动通信集团公司 Generating method of electronic maps, navigation method and navigation device
CN103366634A (en) * 2012-03-28 2013-10-23 嘉兴佳利电子股份有限公司 Seamless connection method for inserting picture into electronic map
CN104713544A (en) * 2013-12-13 2015-06-17 中国移动通信集团公司 Location information display method and equipment
CN105354633A (en) * 2015-10-26 2016-02-24 努比亚技术有限公司 Transportation route calculation system and method

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107844523A (en) * 2017-10-12 2018-03-27 江苏鸿信系统集成有限公司 The position converting system of double coordinate-systems based on GPS and hand-drawing map
CN108763587A (en) * 2018-06-12 2018-11-06 广州市驴迹科技有限责任公司 The method and system that hand-drawing map is overlapped with electronic map
CN110516018A (en) * 2019-08-05 2019-11-29 山东开创云软件有限公司 A kind of the electronics method for drafting and device in river
CN110516018B (en) * 2019-08-05 2022-03-15 山东开创云计算有限公司 Electronic river channel drawing method and device
CN111102974A (en) * 2019-12-20 2020-05-05 柴日发 System and method for realizing tour guide based on hand-drawing map photo of mobile phone
CN112037307A (en) * 2020-09-15 2020-12-04 恒瑞通(福建)信息技术有限公司 Method and terminal for drawing and positioning map picture

Similar Documents

Publication Publication Date Title
CN106997056A (en) A kind of scenic spot intelligent guidance system based on hand-drawing map
RU2667036C9 (en) Method and apparatus for identifying and communicating locations
CN101178310B (en) Method for surveying and designing powerline and inside and outside trade integration using full digitisation photogrammetric technology
CN106779417A (en) The collection of engineering investigation information digitalization, management and integrated application method
CN103914544A (en) Method for quickly matching Chinese addresses in multi-level manner on basis of address feature words
CN111581315B (en) Public service facility reachability calculation method and device
CN102967303B (en) Rapid geographical position search positioning system and method
CN106257446A (en) Geography information Freehandhand-drawing system based on longitude and latitude
CN108168554A (en) A kind of quick planing method of unmanned plane power-line patrolling system map
CN105547310B (en) A kind of path planning apparatus and method based on the trip of PM2.5 health
US9264857B1 (en) Compact codes for geographic locations
CN105913347A (en) House coding method orienting house information acquisition
CN102235858A (en) Coded real-time kinematic global positioning system (RTK-GPS) plane section measuring method and system
CN106842266A (en) A kind of instant reference station localization method and system
CN106643698A (en) Preset two-dimensional bar code identifier-based closed region precise navigation method
CN107832386A (en) A kind of error correction method and apparatus of electronic map
CN105843948A (en) Intelligent scenic spot recommendation method based on index technique in mobile environment
CN116796489B (en) Distribution network line loss calculation and visualization method and system based on graph calculation
CN107895392A (en) A kind of method for drafting of time map
CN102324096B (en) Method and device for splicing characteristic point correction partitions
CN103065363B (en) A kind of pole tower three-dimensional model quickly introduces scene method
CN113074735B (en) Processing method of map data structure
CN104199937A (en) Multi-website POI position mapping method and device
CN110096564B (en) Route point positioning method, device and system based on BIM + GIS
CN115511149A (en) Method, device, equipment and medium for dividing service areas of public service facilities

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20170801